/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:53:53,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:53:53,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:53:53,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:53:53,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:53:53,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:53:53,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:53:53,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:53:53,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:53:53,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:53:53,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:53:53,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:53:53,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:53:53,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:53:53,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:53:53,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:53:53,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:53:53,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:53:53,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:53:53,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:53:53,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:53:53,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:53:53,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:53:53,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:53:53,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:53:53,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:53:53,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:53:53,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:53:53,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:53:53,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:53:53,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:53:53,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:53:53,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:53:53,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:53:53,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:53:53,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:53:53,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:53:53,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:53:53,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:53:53,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:53:53,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:53:53,301 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:53:53,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:53:53,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:53:53,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:53:53,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:53:53,334 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:53:53,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:53:53,334 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:53:53,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:53:53,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:53:53,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:53:53,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:53:53,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:53:53,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:53:53,335 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:53:53,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:53:53,335 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:53:53,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:53:53,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:53:53,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:53:53,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:53:53,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:53:53,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:53:53,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:53:53,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:53:53,336 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:53:53,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:53:53,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:53:53,336 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:53:53,337 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:53:53,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:53:53,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:53:53,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:53:53,653 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:53:53,654 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:53:53,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2022-12-06 07:53:54,646 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:53:54,855 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:53:54,856 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2022-12-06 07:53:54,865 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bda07192/d580de63be9b47649a070a707e76f70f/FLAG619f3f111 [2022-12-06 07:53:54,875 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bda07192/d580de63be9b47649a070a707e76f70f [2022-12-06 07:53:54,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:53:54,879 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:53:54,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:53:54,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:53:54,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:53:54,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:53:54" (1/1) ... [2022-12-06 07:53:54,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f78f3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:54, skipping insertion in model container [2022-12-06 07:53:54,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:53:54" (1/1) ... [2022-12-06 07:53:54,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:53:54,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:53:55,051 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-4.wvr.c[2572,2585] [2022-12-06 07:53:55,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:53:55,070 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:53:55,101 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-4.wvr.c[2572,2585] [2022-12-06 07:53:55,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:53:55,117 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:53:55,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55 WrapperNode [2022-12-06 07:53:55,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:53:55,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:53:55,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:53:55,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:53:55,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (1/1) ... [2022-12-06 07:53:55,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (1/1) ... [2022-12-06 07:53:55,157 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 154 [2022-12-06 07:53:55,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:53:55,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:53:55,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:53:55,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:53:55,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (1/1) ... [2022-12-06 07:53:55,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (1/1) ... [2022-12-06 07:53:55,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (1/1) ... [2022-12-06 07:53:55,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (1/1) ... [2022-12-06 07:53:55,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (1/1) ... [2022-12-06 07:53:55,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (1/1) ... [2022-12-06 07:53:55,188 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (1/1) ... [2022-12-06 07:53:55,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (1/1) ... [2022-12-06 07:53:55,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:53:55,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:53:55,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:53:55,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:53:55,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (1/1) ... [2022-12-06 07:53:55,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:53:55,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:55,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:53:55,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:53:55,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:53:55,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:53:55,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:53:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:53:55,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:53:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:53:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:53:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:53:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:53:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:53:55,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:53:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:53:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:53:55,253 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:53:55,324 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:53:55,325 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:53:55,603 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:53:55,609 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:53:55,609 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:53:55,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:53:55 BoogieIcfgContainer [2022-12-06 07:53:55,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:53:55,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:53:55,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:53:55,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:53:55,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:53:54" (1/3) ... [2022-12-06 07:53:55,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4482d4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:53:55, skipping insertion in model container [2022-12-06 07:53:55,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:55" (2/3) ... [2022-12-06 07:53:55,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4482d4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:53:55, skipping insertion in model container [2022-12-06 07:53:55,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:53:55" (3/3) ... [2022-12-06 07:53:55,619 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2022-12-06 07:53:55,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:53:55,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:53:55,631 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:53:55,714 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:53:55,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 180 transitions, 376 flow [2022-12-06 07:53:55,789 INFO L130 PetriNetUnfolder]: 16/178 cut-off events. [2022-12-06 07:53:55,790 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:53:55,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 178 events. 16/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 161 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 07:53:55,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 180 transitions, 376 flow [2022-12-06 07:53:55,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 170 transitions, 352 flow [2022-12-06 07:53:55,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:55,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 170 transitions, 352 flow [2022-12-06 07:53:55,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 170 transitions, 352 flow [2022-12-06 07:53:55,865 INFO L130 PetriNetUnfolder]: 16/170 cut-off events. [2022-12-06 07:53:55,866 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:53:55,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 16/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 142 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 07:53:55,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 170 transitions, 352 flow [2022-12-06 07:53:55,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 3242 [2022-12-06 07:54:00,203 INFO L203 LiptonReduction]: Total number of compositions: 153 [2022-12-06 07:54:00,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:54:00,219 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;@192ac393, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:54:00,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:54:00,222 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 07:54:00,222 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:54:00,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:00,223 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:00,223 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:00,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:00,226 INFO L85 PathProgramCache]: Analyzing trace with hash -862149159, now seen corresponding path program 1 times [2022-12-06 07:54:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:00,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128148710] [2022-12-06 07:54:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:00,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:00,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128148710] [2022-12-06 07:54:00,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128148710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:00,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:00,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:54:00,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288476246] [2022-12-06 07:54:00,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:00,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:54:00,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:00,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:54:00,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:54:00,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 07:54:00,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:00,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:00,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 07:54:00,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:00,568 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-06 07:54:00,568 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 07:54:00,568 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 187 event pairs, 18 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 07:54:00,569 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 07:54:00,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 07:54:00,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:54:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:54:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 07:54:00,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 07:54:00,588 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 07:54:00,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 07:54:00,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:54:00,592 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 07:54:00,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-06 07:54:00,596 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 07:54:00,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:00,596 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 07:54:00,598 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:00,598 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:00,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 07:54:00,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 07:54:00,605 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 07:54:00,605 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:54:00,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-06 07:54:00,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 07:54:00,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 07:54:01,306 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:01,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 712 [2022-12-06 07:54:01,308 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 07:54:01,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:01,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:01,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:01,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:54:01,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:01,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash -552535443, now seen corresponding path program 1 times [2022-12-06 07:54:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:01,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092669385] [2022-12-06 07:54:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:01,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:01,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:01,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092669385] [2022-12-06 07:54:01,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092669385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:01,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:01,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:54:01,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385716307] [2022-12-06 07:54:01,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:01,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:54:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:01,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:54:01,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:54:01,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 07:54:01,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:01,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:01,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 07:54:01,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:01,430 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 07:54:01,430 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:54:01,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 116 events. 66/116 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 324 event pairs, 9 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 234. Up to 85 conditions per place. [2022-12-06 07:54:01,431 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 07:54:01,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-06 07:54:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:54:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:54:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 07:54:01,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 07:54:01,432 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 07:54:01,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-06 07:54:01,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 27 transitions, 111 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:01,433 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-06 07:54:01,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2022-12-06 07:54:01,433 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 07:54:01,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:01,433 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 07:54:01,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:01,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:01,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 07:54:01,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 07:54:01,437 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-06 07:54:01,437 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:54:01,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 8/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-06 07:54:01,438 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 07:54:01,438 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 07:54:01,438 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:01,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 07:54:01,439 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-06 07:54:01,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:01,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:01,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:01,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:54:01,439 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:01,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:01,440 INFO L85 PathProgramCache]: Analyzing trace with hash 949209500, now seen corresponding path program 1 times [2022-12-06 07:54:01,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:01,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320896635] [2022-12-06 07:54:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:01,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:01,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:01,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320896635] [2022-12-06 07:54:01,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320896635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:01,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:01,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:54:01,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013872386] [2022-12-06 07:54:01,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:01,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:01,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:01,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:01,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:01,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:54:01,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:01,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:01,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:54:01,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:01,608 INFO L130 PetriNetUnfolder]: 85/169 cut-off events. [2022-12-06 07:54:01,608 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-06 07:54:01,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 169 events. 85/169 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 553 event pairs, 26 based on Foata normal form. 12/180 useless extension candidates. Maximal degree in co-relation 140. Up to 86 conditions per place. [2022-12-06 07:54:01,609 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 8/42 dead transitions. [2022-12-06 07:54:01,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 42 transitions, 202 flow [2022-12-06 07:54:01,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:54:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:54:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 07:54:01,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 07:54:01,610 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 41 transitions. [2022-12-06 07:54:01,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 42 transitions, 202 flow [2022-12-06 07:54:01,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:54:01,611 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-06 07:54:01,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-06 07:54:01,612 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 07:54:01,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:01,612 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-06 07:54:01,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:01,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:01,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-06 07:54:01,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-06 07:54:01,631 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2022-12-06 07:54:01,631 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-06 07:54:01,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 38 events. 7/38 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 51. Up to 11 conditions per place. [2022-12-06 07:54:01,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-06 07:54:01,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 07:54:01,784 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:01,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:54:01,785 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-06 07:54:01,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:01,785 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:01,785 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:01,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:54:01,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:01,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1910570962, now seen corresponding path program 1 times [2022-12-06 07:54:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:01,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635484151] [2022-12-06 07:54:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:01,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:01,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:01,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635484151] [2022-12-06 07:54:01,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635484151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:01,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:01,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:01,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580125826] [2022-12-06 07:54:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:01,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:01,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:01,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:54:01,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:01,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:01,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:54:01,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:01,932 INFO L130 PetriNetUnfolder]: 64/123 cut-off events. [2022-12-06 07:54:01,933 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-12-06 07:54:01,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 123 events. 64/123 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 351 event pairs, 11 based on Foata normal form. 10/132 useless extension candidates. Maximal degree in co-relation 331. Up to 72 conditions per place. [2022-12-06 07:54:01,942 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 4 changer transitions 4/34 dead transitions. [2022-12-06 07:54:01,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 195 flow [2022-12-06 07:54:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:54:01,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 07:54:01,944 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:54:01,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 195 flow [2022-12-06 07:54:01,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 174 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:01,947 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 92 flow [2022-12-06 07:54:01,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-06 07:54:01,949 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 07:54:01,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:01,949 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 92 flow [2022-12-06 07:54:01,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:01,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:01,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 92 flow [2022-12-06 07:54:01,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 92 flow [2022-12-06 07:54:01,953 INFO L130 PetriNetUnfolder]: 7/28 cut-off events. [2022-12-06 07:54:01,953 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 07:54:01,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 28 events. 7/28 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 42. Up to 11 conditions per place. [2022-12-06 07:54:01,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 92 flow [2022-12-06 07:54:01,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 07:54:01,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:01,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 07:54:01,956 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 73 flow [2022-12-06 07:54:01,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:01,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:01,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:01,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:54:01,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1277300122, now seen corresponding path program 2 times [2022-12-06 07:54:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:01,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248494555] [2022-12-06 07:54:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:02,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:02,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248494555] [2022-12-06 07:54:02,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248494555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:02,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:02,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:02,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258158557] [2022-12-06 07:54:02,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:02,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:02,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:02,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:02,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:02,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 07:54:02,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:02,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:02,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 07:54:02,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:02,056 INFO L130 PetriNetUnfolder]: 53/107 cut-off events. [2022-12-06 07:54:02,057 INFO L131 PetriNetUnfolder]: For 157/157 co-relation queries the response was YES. [2022-12-06 07:54:02,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 107 events. 53/107 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 266 event pairs, 14 based on Foata normal form. 4/110 useless extension candidates. Maximal degree in co-relation 120. Up to 64 conditions per place. [2022-12-06 07:54:02,057 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 27 selfloop transitions, 3 changer transitions 2/32 dead transitions. [2022-12-06 07:54:02,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 181 flow [2022-12-06 07:54:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 07:54:02,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 07:54:02,058 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 73 flow. Second operand 4 states and 33 transitions. [2022-12-06 07:54:02,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 181 flow [2022-12-06 07:54:02,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 32 transitions, 164 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:02,059 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 80 flow [2022-12-06 07:54:02,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-06 07:54:02,060 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 07:54:02,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:02,060 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 80 flow [2022-12-06 07:54:02,060 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:02,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:02,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 80 flow [2022-12-06 07:54:02,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 80 flow [2022-12-06 07:54:02,063 INFO L130 PetriNetUnfolder]: 5/28 cut-off events. [2022-12-06 07:54:02,063 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 07:54:02,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 28 events. 5/28 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 42. Up to 8 conditions per place. [2022-12-06 07:54:02,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 80 flow [2022-12-06 07:54:02,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 07:54:02,064 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:02,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 07:54:02,065 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 80 flow [2022-12-06 07:54:02,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:02,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:02,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:02,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:54:02,065 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:02,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2031968726, now seen corresponding path program 3 times [2022-12-06 07:54:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:02,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520306688] [2022-12-06 07:54:02,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:02,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:02,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:02,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520306688] [2022-12-06 07:54:02,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520306688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:02,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:02,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:02,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285637354] [2022-12-06 07:54:02,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:02,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:02,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:02,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:02,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:02,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:54:02,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:02,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:02,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:54:02,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:02,152 INFO L130 PetriNetUnfolder]: 39/79 cut-off events. [2022-12-06 07:54:02,152 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-06 07:54:02,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 79 events. 39/79 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 145 event pairs, 14 based on Foata normal form. 6/84 useless extension candidates. Maximal degree in co-relation 118. Up to 64 conditions per place. [2022-12-06 07:54:02,153 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 2/26 dead transitions. [2022-12-06 07:54:02,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 156 flow [2022-12-06 07:54:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 07:54:02,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2022-12-06 07:54:02,154 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 80 flow. Second operand 4 states and 27 transitions. [2022-12-06 07:54:02,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 156 flow [2022-12-06 07:54:02,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 140 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:02,155 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 66 flow [2022-12-06 07:54:02,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-06 07:54:02,156 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 07:54:02,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:02,156 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 66 flow [2022-12-06 07:54:02,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:02,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:02,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 66 flow [2022-12-06 07:54:02,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 66 flow [2022-12-06 07:54:02,159 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2022-12-06 07:54:02,159 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:54:02,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 19 events. 4/19 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 6 conditions per place. [2022-12-06 07:54:02,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 66 flow [2022-12-06 07:54:02,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 07:54:02,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] $Ultimate##0-->L59-2: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] and [711] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 1) (= (select (select |v_#memory_int_158| v_~f~0.base_90) (+ v_~f~0.offset_90 (* v_~x1~0_71 4))) v_~x1~0_70) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967295) 4294967296) (* (mod v_~n~0_76 1073741824) 4)) (= (ite (and (<= 0 v_~x1~0_71) (< v_~x1~0_71 v_~size~0_100)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|)) InVars {~size~0=v_~size~0_100, ~f~0.base=v_~f~0.base_90, #memory_int=|v_#memory_int_158|, ~n~0=v_~n~0_76, ~x1~0=v_~x1~0_71, ~f~0.offset=v_~f~0.offset_90} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_23|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~size~0=v_~size~0_100, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, #memory_int=|v_#memory_int_158|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|, ~n~0=v_~n~0_76, ~x1~0=v_~x1~0_70, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_33|, ~f~0.offset=v_~f~0.offset_90} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:02,206 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:02,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 07:54:02,207 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 62 flow [2022-12-06 07:54:02,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:02,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:02,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:02,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:54:02,207 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:02,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:02,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1157667799, now seen corresponding path program 1 times [2022-12-06 07:54:02,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:02,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852476994] [2022-12-06 07:54:02,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:02,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:02,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:02,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852476994] [2022-12-06 07:54:02,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852476994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:02,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:02,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:54:02,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468754869] [2022-12-06 07:54:02,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:02,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:54:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:02,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:54:02,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:54:02,279 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 07:54:02,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:02,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:02,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 07:54:02,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:02,331 INFO L130 PetriNetUnfolder]: 36/68 cut-off events. [2022-12-06 07:54:02,331 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 07:54:02,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 68 events. 36/68 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 125 event pairs, 6 based on Foata normal form. 6/73 useless extension candidates. Maximal degree in co-relation 150. Up to 58 conditions per place. [2022-12-06 07:54:02,332 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 20 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2022-12-06 07:54:02,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 128 flow [2022-12-06 07:54:02,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:54:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:54:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-12-06 07:54:02,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-06 07:54:02,333 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 62 flow. Second operand 3 states and 21 transitions. [2022-12-06 07:54:02,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 128 flow [2022-12-06 07:54:02,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 117 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 07:54:02,333 INFO L231 Difference]: Finished difference. Result has 23 places, 18 transitions, 67 flow [2022-12-06 07:54:02,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=20, 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=67, PETRI_PLACES=23, PETRI_TRANSITIONS=18} [2022-12-06 07:54:02,334 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-06 07:54:02,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:02,334 INFO L89 Accepts]: Start accepts. Operand has 23 places, 18 transitions, 67 flow [2022-12-06 07:54:02,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:02,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:02,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 18 transitions, 67 flow [2022-12-06 07:54:02,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 67 flow [2022-12-06 07:54:02,337 INFO L130 PetriNetUnfolder]: 6/23 cut-off events. [2022-12-06 07:54:02,338 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 07:54:02,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 23 events. 6/23 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 1 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2022-12-06 07:54:02,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 67 flow [2022-12-06 07:54:02,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 07:54:02,338 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:02,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 07:54:02,339 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 18 transitions, 67 flow [2022-12-06 07:54:02,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:02,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:02,339 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:02,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:54:02,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:02,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2039327826, now seen corresponding path program 1 times [2022-12-06 07:54:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:02,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031288271] [2022-12-06 07:54:02,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:02,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:02,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:02,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031288271] [2022-12-06 07:54:02,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031288271] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:02,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366525702] [2022-12-06 07:54:02,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:02,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:02,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:02,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:02,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:54:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:02,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 07:54:02,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:02,792 INFO L321 Elim1Store]: treesize reduction 42, result has 14.3 percent of original size [2022-12-06 07:54:02,792 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 103 treesize of output 40 [2022-12-06 07:54:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:02,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:03,094 INFO L321 Elim1Store]: treesize reduction 10, result has 93.6 percent of original size [2022-12-06 07:54:03,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 146 treesize of output 196 [2022-12-06 07:54:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:03,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366525702] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:03,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:03,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 07:54:03,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617188576] [2022-12-06 07:54:03,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:03,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:54:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:03,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:54:03,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:54:03,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 07:54:03,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 67 flow. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:03,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:03,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 07:54:03,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:04,354 INFO L130 PetriNetUnfolder]: 101/184 cut-off events. [2022-12-06 07:54:04,355 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-06 07:54:04,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 184 events. 101/184 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 0 based on Foata normal form. 13/195 useless extension candidates. Maximal degree in co-relation 141. Up to 93 conditions per place. [2022-12-06 07:54:04,356 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 23 selfloop transitions, 11 changer transitions 30/64 dead transitions. [2022-12-06 07:54:04,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 387 flow [2022-12-06 07:54:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:54:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:54:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 61 transitions. [2022-12-06 07:54:04,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27232142857142855 [2022-12-06 07:54:04,358 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 67 flow. Second operand 14 states and 61 transitions. [2022-12-06 07:54:04,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 387 flow [2022-12-06 07:54:04,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 361 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 07:54:04,360 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 160 flow [2022-12-06 07:54:04,360 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=160, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2022-12-06 07:54:04,362 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 07:54:04,362 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:04,363 INFO L89 Accepts]: Start accepts. Operand has 43 places, 26 transitions, 160 flow [2022-12-06 07:54:04,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:04,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:04,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 26 transitions, 160 flow [2022-12-06 07:54:04,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 160 flow [2022-12-06 07:54:04,389 INFO L130 PetriNetUnfolder]: 10/35 cut-off events. [2022-12-06 07:54:04,390 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 07:54:04,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 35 events. 10/35 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 113. Up to 17 conditions per place. [2022-12-06 07:54:04,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 160 flow [2022-12-06 07:54:04,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 07:54:04,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [714] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_55| 1) (= (select (select |v_#memory_int_162| v_~f~0.base_94) (+ v_~f~0.offset_94 (* v_~x1~0_79 4))) v_~x1~0_78) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (ite (and (< v_~x1~0_79 v_~size~0_104) (<= 0 v_~x1~0_79)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|) (= |v_thread2Thread1of1ForFork1_~i~1#1_165| 0) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_55| 4294967295) 4294967296) (* (mod v_~n~0_82 1073741824) 4))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_94, #memory_int=|v_#memory_int_162|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_79, ~f~0.offset=v_~f~0.offset_94} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_94, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, #memory_int=|v_#memory_int_162|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_165|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_37|, ~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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:06,240 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [717] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_168| v_~f~0.base_99))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_99 (* v_~x2~0_184 4))))) (let ((.cse1 (select .cse2 (+ (* .cse3 4) v_~f~0.offset_99)))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_99 (* .cse1 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_93) (< v_~x1~0_93 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_46| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|) (= (ite (and (< .cse0 v_~size~0_108) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_46| 0)) (not (= (ite (and (< v_~x2~0_184 v_~size~0_108) (<= 0 v_~x2~0_184)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_172| 4) (not (= (ite (and (< .cse1 v_~size~0_108) (<= 0 .cse1)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* (mod v_~n~0_86 1073741824) 4)) (= v_~x2~0_183 (select .cse2 (+ v_~f~0.offset_99 (* 4 .cse0)))) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_108)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_139| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_139| 0)) (= v_~x1~0_92 (select .cse2 (+ v_~f~0.offset_99 (* v_~x1~0_93 4))))))))) InVars {~x2~0=v_~x2~0_184, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_168|, ~n~0=v_~n~0_86, ~x1~0=v_~x1~0_93, ~f~0.offset=v_~f~0.offset_99} OutVars{~x2~0=v_~x2~0_183, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_33|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_51|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_99, 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_99|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_172|, ~x1~0=v_~x1~0_92, ~f~0.offset=v_~f~0.offset_99, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_139|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_33|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_31|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, #memory_int=|v_#memory_int_168|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_46|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_45|, ~n~0=v_~n~0_86, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_47|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_46|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:06,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_176| v_~f~0.base_103))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_190 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_103 (* .cse1 4))))) (let ((.cse2 (* (mod v_~n~0_90 1073741824) 4)) (.cse4 (select .cse0 (+ v_~f~0.offset_103 (* .cse3 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141| 0)) (= (select .cse0 (+ v_~f~0.offset_103 (* v_~x1~0_99 4))) v_~x1~0_98) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_112)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_66| 4294967295) 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|) (not (= (ite (and (< .cse3 v_~size~0_112) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_13| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_112)) 1 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_13|) (= |v_thread2Thread1of1ForFork1_~i~1#1_176| 4) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_176| 4294967296) .cse2)) (= v_~x2~0_189 (select .cse0 (+ v_~f~0.offset_103 (* .cse4 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_66| 1) (not (= (ite (and (< v_~x2~0_190 v_~size~0_112) (<= 0 v_~x2~0_190)) 1 0) 0)) (= (ite (and (<= 0 v_~x1~0_99) (< v_~x1~0_99 v_~size~0_112)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|)))))) InVars {~x2~0=v_~x2~0_190, ~size~0=v_~size~0_112, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_176|, ~n~0=v_~n~0_90, ~x1~0=v_~x1~0_99, ~f~0.offset=v_~f~0.offset_103} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_38|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_35|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_53|, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_13|, 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_101|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_176|, ~x1~0=v_~x1~0_98, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_35|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_47|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_49|, ~x2~0=v_~x2~0_189, ~size~0=v_~size~0_112, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_66|, #memory_int=|v_#memory_int_176|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_47|, ~n~0=v_~n~0_90, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_48|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#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_#t~mem9#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:06,891 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:54:06,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2530 [2022-12-06 07:54:06,892 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 184 flow [2022-12-06 07:54:06,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:06,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:06,892 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:06,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:54:07,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:07,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:07,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1871161492, now seen corresponding path program 1 times [2022-12-06 07:54:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:07,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776537375] [2022-12-06 07:54:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:54:07,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:07,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776537375] [2022-12-06 07:54:07,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776537375] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:07,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280216970] [2022-12-06 07:54:07,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:07,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:07,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:07,180 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:07,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:54:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:07,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:54:07,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:54:07,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:54:07,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280216970] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:07,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:07,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 07:54:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596306078] [2022-12-06 07:54:07,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:07,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:54:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:54:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:54:07,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:54:07,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:07,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:07,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:54:07,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:07,439 INFO L130 PetriNetUnfolder]: 65/115 cut-off events. [2022-12-06 07:54:07,439 INFO L131 PetriNetUnfolder]: For 288/288 co-relation queries the response was YES. [2022-12-06 07:54:07,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 115 events. 65/115 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 264 event pairs, 6 based on Foata normal form. 10/120 useless extension candidates. Maximal degree in co-relation 567. Up to 63 conditions per place. [2022-12-06 07:54:07,441 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 30 selfloop transitions, 8 changer transitions 2/40 dead transitions. [2022-12-06 07:54:07,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 380 flow [2022-12-06 07:54:07,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:54:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:54:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-06 07:54:07,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2022-12-06 07:54:07,442 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 184 flow. Second operand 6 states and 39 transitions. [2022-12-06 07:54:07,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 380 flow [2022-12-06 07:54:07,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 296 flow, removed 37 selfloop flow, removed 7 redundant places. [2022-12-06 07:54:07,444 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 146 flow [2022-12-06 07:54:07,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-06 07:54:07,444 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 07:54:07,444 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:07,444 INFO L89 Accepts]: Start accepts. Operand has 35 places, 24 transitions, 146 flow [2022-12-06 07:54:07,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:07,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:07,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 146 flow [2022-12-06 07:54:07,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 146 flow [2022-12-06 07:54:07,450 INFO L130 PetriNetUnfolder]: 15/44 cut-off events. [2022-12-06 07:54:07,450 INFO L131 PetriNetUnfolder]: For 26/29 co-relation queries the response was YES. [2022-12-06 07:54:07,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 44 events. 15/44 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 139. Up to 24 conditions per place. [2022-12-06 07:54:07,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 146 flow [2022-12-06 07:54:07,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 07:54:07,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:07,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 422 [2022-12-06 07:54:07,866 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 149 flow [2022-12-06 07:54:07,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:07,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:07,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:07,872 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-06 07:54:08,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-06 07:54:08,067 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:08,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:08,067 INFO L85 PathProgramCache]: Analyzing trace with hash -781138648, now seen corresponding path program 1 times [2022-12-06 07:54:08,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:08,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819859796] [2022-12-06 07:54:08,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:08,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:09,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:09,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819859796] [2022-12-06 07:54:09,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819859796] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:09,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529977045] [2022-12-06 07:54:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:09,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:09,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:09,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:09,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:54:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:09,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 07:54:09,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:09,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:09,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 07:54:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:09,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:10,309 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 07:54:10,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-06 07:54:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:11,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529977045] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:11,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:11,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 2] total 9 [2022-12-06 07:54:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492790428] [2022-12-06 07:54:11,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:11,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:54:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:11,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:54:11,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:54:11,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:54:11,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 149 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:11,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:11,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:54:11,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:11,344 INFO L130 PetriNetUnfolder]: 92/165 cut-off events. [2022-12-06 07:54:11,344 INFO L131 PetriNetUnfolder]: For 300/300 co-relation queries the response was YES. [2022-12-06 07:54:11,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 165 events. 92/165 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 456 event pairs, 2 based on Foata normal form. 1/164 useless extension candidates. Maximal degree in co-relation 702. Up to 119 conditions per place. [2022-12-06 07:54:11,345 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 28 selfloop transitions, 18 changer transitions 4/50 dead transitions. [2022-12-06 07:54:11,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 407 flow [2022-12-06 07:54:11,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:54:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:54:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-06 07:54:11,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3233082706766917 [2022-12-06 07:54:11,346 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 149 flow. Second operand 7 states and 43 transitions. [2022-12-06 07:54:11,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 407 flow [2022-12-06 07:54:11,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 331 flow, removed 29 selfloop flow, removed 5 redundant places. [2022-12-06 07:54:11,349 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 262 flow [2022-12-06 07:54:11,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2022-12-06 07:54:11,349 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-06 07:54:11,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:11,349 INFO L89 Accepts]: Start accepts. Operand has 37 places, 37 transitions, 262 flow [2022-12-06 07:54:11,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:11,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:11,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 37 transitions, 262 flow [2022-12-06 07:54:11,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 37 transitions, 262 flow [2022-12-06 07:54:11,356 INFO L130 PetriNetUnfolder]: 21/66 cut-off events. [2022-12-06 07:54:11,357 INFO L131 PetriNetUnfolder]: For 72/76 co-relation queries the response was YES. [2022-12-06 07:54:11,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 66 events. 21/66 cut-off events. For 72/76 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 164 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 159. Up to 34 conditions per place. [2022-12-06 07:54:11,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 37 transitions, 262 flow [2022-12-06 07:54:11,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 07:54:13,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_166| v_~f~0.base_97))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_97 (* v_~x1~0_88 4))))) (and (not (= (ite (and (< v_~x1~0_88 v_~size~0_106) (<= 0 v_~x1~0_88)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_106) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (< 0 (* 4 (mod v_~n~0_84 1073741824))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= |v_thread1Thread1of1ForFork0_~i~0#1_60| 2) (= v_~x1~0_86 (select .cse1 (+ v_~f~0.offset_97 (* .cse0 4)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_170| 0)))) InVars {~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_166|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_32|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, ~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_60|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_170|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_86, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|, ~f~0.offset=v_~f~0.offset_97} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:13,363 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:13,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2015 [2022-12-06 07:54:13,364 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 260 flow [2022-12-06 07:54:13,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:13,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:13,364 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:13,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 07:54:13,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:13,569 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:13,571 INFO L85 PathProgramCache]: Analyzing trace with hash 97247192, now seen corresponding path program 1 times [2022-12-06 07:54:13,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:13,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557867608] [2022-12-06 07:54:13,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:13,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:13,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557867608] [2022-12-06 07:54:13,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557867608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:13,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72680446] [2022-12-06 07:54:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:13,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:13,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:13,663 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:13,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:54:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:13,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:54:13,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:13,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:13,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72680446] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:13,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:13,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-06 07:54:13,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618121513] [2022-12-06 07:54:13,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:13,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:54:13,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:13,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:54:13,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:54:13,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:54:13,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:13,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:13,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:54:13,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:13,984 INFO L130 PetriNetUnfolder]: 90/162 cut-off events. [2022-12-06 07:54:13,984 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2022-12-06 07:54:13,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 162 events. 90/162 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 437 event pairs, 27 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 476. Up to 120 conditions per place. [2022-12-06 07:54:13,985 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 35 selfloop transitions, 1 changer transitions 9/45 dead transitions. [2022-12-06 07:54:13,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 377 flow [2022-12-06 07:54:13,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:54:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:54:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-06 07:54:13,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3047619047619048 [2022-12-06 07:54:13,986 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 260 flow. Second operand 5 states and 32 transitions. [2022-12-06 07:54:13,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 377 flow [2022-12-06 07:54:13,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 355 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 07:54:13,988 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 200 flow [2022-12-06 07:54:13,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-06 07:54:13,988 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2022-12-06 07:54:13,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:13,989 INFO L89 Accepts]: Start accepts. Operand has 39 places, 32 transitions, 200 flow [2022-12-06 07:54:13,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:13,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:13,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 200 flow [2022-12-06 07:54:13,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 200 flow [2022-12-06 07:54:13,995 INFO L130 PetriNetUnfolder]: 18/52 cut-off events. [2022-12-06 07:54:13,995 INFO L131 PetriNetUnfolder]: For 60/64 co-relation queries the response was YES. [2022-12-06 07:54:13,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 52 events. 18/52 cut-off events. For 60/64 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 104 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 145. Up to 23 conditions per place. [2022-12-06 07:54:13,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 32 transitions, 200 flow [2022-12-06 07:54:13,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 07:54:14,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [721] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_178| v_~f~0.base_105))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_105 (* v_~x2~0_195 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_105 (* .cse0 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_105 (* .cse3 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_105 (* .cse7 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_105 (* 4 .cse5))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_105 (* .cse4 4))))) (let ((.cse2 (select .cse1 (+ (* .cse6 4) v_~f~0.offset_105)))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_114)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_68| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_178| 8) (= (select .cse1 (+ v_~f~0.offset_105 (* .cse2 4))) v_~x2~0_193) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| (ite (and (< .cse2 v_~size~0_114) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_195) (< v_~x2~0_195 v_~size~0_114)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_114)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_114)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_114)) 1 0) 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_178|) 4294967296) (* (mod v_~n~0_92 1073741824) 4)) (not (= (ite (and (< .cse6 v_~size~0_114) (<= 0 .cse6)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143|) (= (select .cse1 (+ (* v_~x1~0_103 4) v_~f~0.offset_105)) v_~x1~0_102) (not (= (ite (and (< .cse7 v_~size~0_114) (<= 0 .cse7)) 1 0) 0)) (= (ite (and (<= 0 v_~x1~0_103) (< v_~x1~0_103 v_~size~0_114)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|)))))))))) InVars {~x2~0=v_~x2~0_195, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_105, #memory_int=|v_#memory_int_178|, ~n~0=v_~n~0_92, ~x1~0=v_~x1~0_103, ~f~0.offset=v_~f~0.offset_105} OutVars{~x2~0=v_~x2~0_193, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_40|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_37|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_55|, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_105, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_43|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_178|, ~x1~0=v_~x1~0_102, ~f~0.offset=v_~f~0.offset_105, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_37|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_35|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_68|, #memory_int=|v_#memory_int_178|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_49|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_92, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_51|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_50|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:15,348 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_204| v_~f~0.base_124))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_124 (* v_~x2~0_229 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_124 (* 4 .cse7))))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_124 (* .cse0 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_124 (* .cse9 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_124 (* .cse3 4))))) (let ((.cse11 (select .cse1 (+ v_~f~0.offset_124 (* .cse6 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_124 (* .cse11 4))))) (let ((.cse4 (select .cse1 (+ (* .cse5 4) v_~f~0.offset_124)))) (let ((.cse8 (select .cse1 (+ (* .cse4 4) v_~f~0.offset_124)))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_124 (* .cse8 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_124 (* .cse10 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_130) (<= 0 .cse0)) 1 0) 0)) (= v_~x2~0_227 (select .cse1 (+ v_~f~0.offset_124 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_98| 1) (not (= (ite (and (< .cse3 v_~size~0_130) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_199| 12) (not (= 0 (ite (and (< .cse4 v_~size~0_130) (<= 0 .cse4)) 1 0))) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_130)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_229 v_~size~0_130) (<= 0 v_~x2~0_229)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_130)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_130)) 1 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_130)) 1 0) 0)) (< 8 (* (mod v_~n~0_108 1073741824) 4)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_130)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_124 (* v_~x1~0_148 4))) v_~x1~0_147) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_130)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_130)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (< .cse11 v_~size~0_130) (<= 0 .cse11)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|) (= (ite (and (< v_~x1~0_148 v_~size~0_130) (<= 0 v_~x1~0_148)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|)))))))))))))) InVars {~x2~0=v_~x2~0_229, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_124, #memory_int=|v_#memory_int_204|, ~n~0=v_~n~0_108, ~x1~0=v_~x1~0_148, ~f~0.offset=v_~f~0.offset_124} OutVars{~x2~0=v_~x2~0_227, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_55|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_73|, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_124, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_61|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_199|, ~x1~0=v_~x1~0_147, ~f~0.offset=v_~f~0.offset_124, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_55|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_53|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_98|, #memory_int=|v_#memory_int_204|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_67|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_67|, ~n~0=v_~n~0_108, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_69|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_78|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:16,154 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:16,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2169 [2022-12-06 07:54:16,157 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 216 flow [2022-12-06 07:54:16,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:16,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:16,157 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:16,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:16,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:16,358 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:16,358 INFO L85 PathProgramCache]: Analyzing trace with hash -127990386, now seen corresponding path program 1 times [2022-12-06 07:54:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:16,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009105609] [2022-12-06 07:54:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:16,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:17,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:17,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009105609] [2022-12-06 07:54:17,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009105609] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:17,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403328605] [2022-12-06 07:54:17,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:17,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:17,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:17,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:17,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:54:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:17,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:54:17,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:17,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:17,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 07:54:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:17,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:17,927 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 07:54:17,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-06 07:54:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:18,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403328605] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:18,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:18,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 07:54:18,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919343650] [2022-12-06 07:54:18,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:18,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:54:18,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:18,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:54:18,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:54:18,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:54:18,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 216 flow. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:18,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:18,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:54:18,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:19,290 INFO L130 PetriNetUnfolder]: 145/255 cut-off events. [2022-12-06 07:54:19,290 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-12-06 07:54:19,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 255 events. 145/255 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 857 event pairs, 6 based on Foata normal form. 1/250 useless extension candidates. Maximal degree in co-relation 790. Up to 121 conditions per place. [2022-12-06 07:54:19,292 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 42 selfloop transitions, 23 changer transitions 2/67 dead transitions. [2022-12-06 07:54:19,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 526 flow [2022-12-06 07:54:19,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:54:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:54:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-12-06 07:54:19,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29292929292929293 [2022-12-06 07:54:19,293 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 216 flow. Second operand 9 states and 58 transitions. [2022-12-06 07:54:19,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 526 flow [2022-12-06 07:54:19,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 503 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-06 07:54:19,295 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 359 flow [2022-12-06 07:54:19,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2022-12-06 07:54:19,296 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-06 07:54:19,296 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:19,296 INFO L89 Accepts]: Start accepts. Operand has 46 places, 43 transitions, 359 flow [2022-12-06 07:54:19,296 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:19,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:19,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 43 transitions, 359 flow [2022-12-06 07:54:19,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 43 transitions, 359 flow [2022-12-06 07:54:19,304 INFO L130 PetriNetUnfolder]: 25/76 cut-off events. [2022-12-06 07:54:19,305 INFO L131 PetriNetUnfolder]: For 133/138 co-relation queries the response was YES. [2022-12-06 07:54:19,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 76 events. 25/76 cut-off events. For 133/138 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 226 event pairs, 1 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 268. Up to 38 conditions per place. [2022-12-06 07:54:19,305 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 43 transitions, 359 flow [2022-12-06 07:54:19,305 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 07:54:19,442 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:19,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:19,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 329 [2022-12-06 07:54:19,625 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 359 flow [2022-12-06 07:54:19,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:19,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:19,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:19,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:19,826 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,SelfDestructingSolverStorable11 [2022-12-06 07:54:19,826 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:19,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1600915337, now seen corresponding path program 1 times [2022-12-06 07:54:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:19,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313737911] [2022-12-06 07:54:19,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:19,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-06 07:54:19,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:19,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313737911] [2022-12-06 07:54:19,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313737911] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:19,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102405187] [2022-12-06 07:54:19,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:19,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:19,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:19,919 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:19,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:54:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:20,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:54:20,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:20,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:20,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102405187] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:20,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:20,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-06 07:54:20,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911869499] [2022-12-06 07:54:20,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:20,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:54:20,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:20,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:54:20,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:54:20,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:54:20,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 359 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-06 07:54:20,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:20,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:54:20,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:20,213 INFO L130 PetriNetUnfolder]: 171/291 cut-off events. [2022-12-06 07:54:20,213 INFO L131 PetriNetUnfolder]: For 768/768 co-relation queries the response was YES. [2022-12-06 07:54:20,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 291 events. 171/291 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 980 event pairs, 10 based on Foata normal form. 28/314 useless extension candidates. Maximal degree in co-relation 1324. Up to 149 conditions per place. [2022-12-06 07:54:20,215 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 44 selfloop transitions, 28 changer transitions 0/72 dead transitions. [2022-12-06 07:54:20,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 719 flow [2022-12-06 07:54:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:54:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:54:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-12-06 07:54:20,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2022-12-06 07:54:20,216 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 359 flow. Second operand 8 states and 52 transitions. [2022-12-06 07:54:20,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 719 flow [2022-12-06 07:54:20,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 628 flow, removed 42 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:20,219 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 485 flow [2022-12-06 07:54:20,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=485, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2022-12-06 07:54:20,220 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 07:54:20,220 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:20,220 INFO L89 Accepts]: Start accepts. Operand has 53 places, 51 transitions, 485 flow [2022-12-06 07:54:20,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:20,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:20,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions, 485 flow [2022-12-06 07:54:20,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions, 485 flow [2022-12-06 07:54:20,230 INFO L130 PetriNetUnfolder]: 32/90 cut-off events. [2022-12-06 07:54:20,230 INFO L131 PetriNetUnfolder]: For 254/262 co-relation queries the response was YES. [2022-12-06 07:54:20,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 90 events. 32/90 cut-off events. For 254/262 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 279 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 299. Up to 37 conditions per place. [2022-12-06 07:54:20,231 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 51 transitions, 485 flow [2022-12-06 07:54:20,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 07:54:20,232 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:20,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 07:54:20,232 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 485 flow [2022-12-06 07:54:20,232 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-06 07:54:20,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:20,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:20,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 07:54:20,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:20,437 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:20,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1384627034, now seen corresponding path program 1 times [2022-12-06 07:54:20,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:20,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420552455] [2022-12-06 07:54:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:20,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:20,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420552455] [2022-12-06 07:54:20,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420552455] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:20,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767390156] [2022-12-06 07:54:20,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:20,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:20,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:20,524 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:20,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:54:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:20,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:54:20,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:20,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:20,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767390156] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:20,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:20,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 07:54:20,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006157581] [2022-12-06 07:54:20,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:20,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:54:20,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:20,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:54:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:54:20,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:54:20,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 485 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:20,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:20,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:54:20,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:21,123 INFO L130 PetriNetUnfolder]: 228/393 cut-off events. [2022-12-06 07:54:21,124 INFO L131 PetriNetUnfolder]: For 1625/1625 co-relation queries the response was YES. [2022-12-06 07:54:21,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 393 events. 228/393 cut-off events. For 1625/1625 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1466 event pairs, 11 based on Foata normal form. 14/404 useless extension candidates. Maximal degree in co-relation 1339. Up to 149 conditions per place. [2022-12-06 07:54:21,126 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 61 selfloop transitions, 35 changer transitions 2/98 dead transitions. [2022-12-06 07:54:21,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 982 flow [2022-12-06 07:54:21,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:54:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:54:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-12-06 07:54:21,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2465277777777778 [2022-12-06 07:54:21,127 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 485 flow. Second operand 12 states and 71 transitions. [2022-12-06 07:54:21,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 982 flow [2022-12-06 07:54:21,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 98 transitions, 923 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:21,136 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 623 flow [2022-12-06 07:54:21,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=623, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2022-12-06 07:54:21,137 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 44 predicate places. [2022-12-06 07:54:21,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:21,137 INFO L89 Accepts]: Start accepts. Operand has 65 places, 60 transitions, 623 flow [2022-12-06 07:54:21,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:21,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:21,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 60 transitions, 623 flow [2022-12-06 07:54:21,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 60 transitions, 623 flow [2022-12-06 07:54:21,151 INFO L130 PetriNetUnfolder]: 41/122 cut-off events. [2022-12-06 07:54:21,152 INFO L131 PetriNetUnfolder]: For 361/372 co-relation queries the response was YES. [2022-12-06 07:54:21,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 122 events. 41/122 cut-off events. For 361/372 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 1 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 493. Up to 50 conditions per place. [2022-12-06 07:54:21,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 60 transitions, 623 flow [2022-12-06 07:54:21,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-06 07:54:21,156 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:21,660 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:54:21,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 524 [2022-12-06 07:54:21,661 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 635 flow [2022-12-06 07:54:21,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:21,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:21,669 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:21,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:21,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:21,874 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:21,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:21,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1481718263, now seen corresponding path program 1 times [2022-12-06 07:54:21,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:21,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803158197] [2022-12-06 07:54:21,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:22,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:22,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803158197] [2022-12-06 07:54:22,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803158197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:22,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118738842] [2022-12-06 07:54:22,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:22,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:22,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:22,010 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:22,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:54:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:22,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:54:22,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:22,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:22,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118738842] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:22,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:22,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 07:54:22,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048385107] [2022-12-06 07:54:22,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:22,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:54:22,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:22,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:54:22,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:54:22,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:54:22,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 635 flow. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:22,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:22,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:54:22,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:22,510 INFO L130 PetriNetUnfolder]: 263/454 cut-off events. [2022-12-06 07:54:22,510 INFO L131 PetriNetUnfolder]: For 1861/1861 co-relation queries the response was YES. [2022-12-06 07:54:22,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 454 events. 263/454 cut-off events. For 1861/1861 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1848 event pairs, 34 based on Foata normal form. 20/471 useless extension candidates. Maximal degree in co-relation 2037. Up to 195 conditions per place. [2022-12-06 07:54:22,514 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 59 selfloop transitions, 40 changer transitions 0/99 dead transitions. [2022-12-06 07:54:22,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 1111 flow [2022-12-06 07:54:22,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:54:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:54:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 68 transitions. [2022-12-06 07:54:22,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22077922077922077 [2022-12-06 07:54:22,515 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 635 flow. Second operand 11 states and 68 transitions. [2022-12-06 07:54:22,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 1111 flow [2022-12-06 07:54:22,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 1013 flow, removed 37 selfloop flow, removed 4 redundant places. [2022-12-06 07:54:22,521 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 778 flow [2022-12-06 07:54:22,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=778, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2022-12-06 07:54:22,522 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 54 predicate places. [2022-12-06 07:54:22,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:22,522 INFO L89 Accepts]: Start accepts. Operand has 75 places, 68 transitions, 778 flow [2022-12-06 07:54:22,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:22,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:22,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 68 transitions, 778 flow [2022-12-06 07:54:22,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 68 transitions, 778 flow [2022-12-06 07:54:22,537 INFO L130 PetriNetUnfolder]: 50/139 cut-off events. [2022-12-06 07:54:22,538 INFO L131 PetriNetUnfolder]: For 546/560 co-relation queries the response was YES. [2022-12-06 07:54:22,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 139 events. 50/139 cut-off events. For 546/560 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 555 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 586. Up to 67 conditions per place. [2022-12-06 07:54:22,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 68 transitions, 778 flow [2022-12-06 07:54:22,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 07:54:22,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [721] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_178| v_~f~0.base_105))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_105 (* v_~x2~0_195 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_105 (* .cse0 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_105 (* .cse3 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_105 (* .cse7 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_105 (* 4 .cse5))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_105 (* .cse4 4))))) (let ((.cse2 (select .cse1 (+ (* .cse6 4) v_~f~0.offset_105)))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_114)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_68| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_178| 8) (= (select .cse1 (+ v_~f~0.offset_105 (* .cse2 4))) v_~x2~0_193) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| (ite (and (< .cse2 v_~size~0_114) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_195) (< v_~x2~0_195 v_~size~0_114)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_114)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_114)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_114)) 1 0) 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_178|) 4294967296) (* (mod v_~n~0_92 1073741824) 4)) (not (= (ite (and (< .cse6 v_~size~0_114) (<= 0 .cse6)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143|) (= (select .cse1 (+ (* v_~x1~0_103 4) v_~f~0.offset_105)) v_~x1~0_102) (not (= (ite (and (< .cse7 v_~size~0_114) (<= 0 .cse7)) 1 0) 0)) (= (ite (and (<= 0 v_~x1~0_103) (< v_~x1~0_103 v_~size~0_114)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|)))))))))) InVars {~x2~0=v_~x2~0_195, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_105, #memory_int=|v_#memory_int_178|, ~n~0=v_~n~0_92, ~x1~0=v_~x1~0_103, ~f~0.offset=v_~f~0.offset_105} OutVars{~x2~0=v_~x2~0_193, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_40|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_37|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_55|, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_105, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_43|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_178|, ~x1~0=v_~x1~0_102, ~f~0.offset=v_~f~0.offset_105, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_37|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_35|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_68|, #memory_int=|v_#memory_int_178|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_49|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_92, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_51|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_50|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:23,745 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:23,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1224 [2022-12-06 07:54:23,747 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 802 flow [2022-12-06 07:54:23,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:23,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:23,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:23,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 07:54:23,951 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,SelfDestructingSolverStorable14 [2022-12-06 07:54:23,952 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:23,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2145938201, now seen corresponding path program 1 times [2022-12-06 07:54:23,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:23,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728437247] [2022-12-06 07:54:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:23,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:24,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:24,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728437247] [2022-12-06 07:54:24,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728437247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:24,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:24,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:24,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587750347] [2022-12-06 07:54:24,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:24,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:24,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:24,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:24,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:54:24,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 802 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:24,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:24,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:54:24,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:24,170 INFO L130 PetriNetUnfolder]: 256/454 cut-off events. [2022-12-06 07:54:24,170 INFO L131 PetriNetUnfolder]: For 2284/2284 co-relation queries the response was YES. [2022-12-06 07:54:24,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 454 events. 256/454 cut-off events. For 2284/2284 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1852 event pairs, 114 based on Foata normal form. 4/455 useless extension candidates. Maximal degree in co-relation 2234. Up to 410 conditions per place. [2022-12-06 07:54:24,173 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 66 selfloop transitions, 10 changer transitions 3/79 dead transitions. [2022-12-06 07:54:24,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 79 transitions, 1041 flow [2022-12-06 07:54:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 07:54:24,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 07:54:24,174 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 802 flow. Second operand 4 states and 42 transitions. [2022-12-06 07:54:24,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 79 transitions, 1041 flow [2022-12-06 07:54:24,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 79 transitions, 939 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 07:54:24,180 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 692 flow [2022-12-06 07:54:24,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=692, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2022-12-06 07:54:24,181 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 53 predicate places. [2022-12-06 07:54:24,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:24,181 INFO L89 Accepts]: Start accepts. Operand has 74 places, 66 transitions, 692 flow [2022-12-06 07:54:24,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:24,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:24,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 66 transitions, 692 flow [2022-12-06 07:54:24,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 66 transitions, 692 flow [2022-12-06 07:54:24,195 INFO L130 PetriNetUnfolder]: 47/133 cut-off events. [2022-12-06 07:54:24,195 INFO L131 PetriNetUnfolder]: For 514/529 co-relation queries the response was YES. [2022-12-06 07:54:24,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 133 events. 47/133 cut-off events. For 514/529 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 511 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 553. Up to 64 conditions per place. [2022-12-06 07:54:24,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 66 transitions, 692 flow [2022-12-06 07:54:24,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 07:54:24,197 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:24,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 07:54:24,198 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 692 flow [2022-12-06 07:54:24,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:24,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:24,198 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:24,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:54:24,198 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1563093600, now seen corresponding path program 1 times [2022-12-06 07:54:24,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:24,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559535629] [2022-12-06 07:54:24,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:24,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:24,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:24,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559535629] [2022-12-06 07:54:24,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559535629] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:24,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674306053] [2022-12-06 07:54:24,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:24,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:24,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:24,271 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:24,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 07:54:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:24,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:54:24,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:24,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:24,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674306053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:24,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:24,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 07:54:24,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851371561] [2022-12-06 07:54:24,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:24,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:54:24,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:24,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:54:24,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:54:24,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:54:24,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 692 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:24,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:24,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:54:24,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:24,773 INFO L130 PetriNetUnfolder]: 300/531 cut-off events. [2022-12-06 07:54:24,773 INFO L131 PetriNetUnfolder]: For 2392/2392 co-relation queries the response was YES. [2022-12-06 07:54:24,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2790 conditions, 531 events. 300/531 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2251 event pairs, 96 based on Foata normal form. 2/530 useless extension candidates. Maximal degree in co-relation 2460. Up to 347 conditions per place. [2022-12-06 07:54:24,776 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 78 selfloop transitions, 20 changer transitions 8/106 dead transitions. [2022-12-06 07:54:24,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 106 transitions, 1184 flow [2022-12-06 07:54:24,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:54:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:54:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-12-06 07:54:24,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23412698412698413 [2022-12-06 07:54:24,778 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 692 flow. Second operand 9 states and 59 transitions. [2022-12-06 07:54:24,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 106 transitions, 1184 flow [2022-12-06 07:54:24,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 106 transitions, 1148 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 07:54:24,784 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 795 flow [2022-12-06 07:54:24,784 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=795, PETRI_PLACES=80, PETRI_TRANSITIONS=73} [2022-12-06 07:54:24,784 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 59 predicate places. [2022-12-06 07:54:24,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:24,785 INFO L89 Accepts]: Start accepts. Operand has 80 places, 73 transitions, 795 flow [2022-12-06 07:54:24,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:24,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:24,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 73 transitions, 795 flow [2022-12-06 07:54:24,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 73 transitions, 795 flow [2022-12-06 07:54:24,801 INFO L130 PetriNetUnfolder]: 55/155 cut-off events. [2022-12-06 07:54:24,801 INFO L131 PetriNetUnfolder]: For 847/895 co-relation queries the response was YES. [2022-12-06 07:54:24,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 155 events. 55/155 cut-off events. For 847/895 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 611 event pairs, 4 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 719. Up to 75 conditions per place. [2022-12-06 07:54:24,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 73 transitions, 795 flow [2022-12-06 07:54:24,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 07:54:24,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:24,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:25,143 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 07:54:25,203 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:25,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:25,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 599 [2022-12-06 07:54:25,383 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 879 flow [2022-12-06 07:54:25,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:25,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:25,383 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:25,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 07:54:25,583 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,SelfDestructingSolverStorable16 [2022-12-06 07:54:25,584 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash -719104254, now seen corresponding path program 1 times [2022-12-06 07:54:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:25,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590497012] [2022-12-06 07:54:25,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590497012] [2022-12-06 07:54:27,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590497012] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:27,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635731814] [2022-12-06 07:54:27,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:27,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:27,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:27,306 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:27,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 07:54:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:27,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:54:27,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:27,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:27,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 07:54:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:27,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:27,899 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 07:54:27,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-06 07:54:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:28,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635731814] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:28,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:28,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2022-12-06 07:54:28,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722360043] [2022-12-06 07:54:28,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:28,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:54:28,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:28,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:54:28,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:54:28,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:54:28,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 879 flow. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:28,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:28,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:54:28,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:29,935 INFO L130 PetriNetUnfolder]: 387/691 cut-off events. [2022-12-06 07:54:29,936 INFO L131 PetriNetUnfolder]: For 4697/4697 co-relation queries the response was YES. [2022-12-06 07:54:29,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4108 conditions, 691 events. 387/691 cut-off events. For 4697/4697 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3161 event pairs, 32 based on Foata normal form. 2/690 useless extension candidates. Maximal degree in co-relation 3727. Up to 367 conditions per place. [2022-12-06 07:54:29,940 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 77 selfloop transitions, 49 changer transitions 18/144 dead transitions. [2022-12-06 07:54:29,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 144 transitions, 1799 flow [2022-12-06 07:54:29,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:54:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:54:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2022-12-06 07:54:29,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2304147465437788 [2022-12-06 07:54:29,942 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 879 flow. Second operand 14 states and 100 transitions. [2022-12-06 07:54:29,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 144 transitions, 1799 flow [2022-12-06 07:54:29,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 144 transitions, 1732 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:29,951 INFO L231 Difference]: Finished difference. Result has 90 places, 95 transitions, 1246 flow [2022-12-06 07:54:29,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1246, PETRI_PLACES=90, PETRI_TRANSITIONS=95} [2022-12-06 07:54:29,951 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 69 predicate places. [2022-12-06 07:54:29,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:29,952 INFO L89 Accepts]: Start accepts. Operand has 90 places, 95 transitions, 1246 flow [2022-12-06 07:54:29,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:29,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:29,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 95 transitions, 1246 flow [2022-12-06 07:54:29,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 95 transitions, 1246 flow [2022-12-06 07:54:29,973 INFO L130 PetriNetUnfolder]: 67/212 cut-off events. [2022-12-06 07:54:29,973 INFO L131 PetriNetUnfolder]: For 1597/1667 co-relation queries the response was YES. [2022-12-06 07:54:29,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 212 events. 67/212 cut-off events. For 1597/1667 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1051 event pairs, 2 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 1053. Up to 97 conditions per place. [2022-12-06 07:54:29,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 95 transitions, 1246 flow [2022-12-06 07:54:29,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 07:54:30,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:30,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_166| v_~f~0.base_97))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_97 (* v_~x1~0_88 4))))) (and (not (= (ite (and (< v_~x1~0_88 v_~size~0_106) (<= 0 v_~x1~0_88)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_106) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (< 0 (* 4 (mod v_~n~0_84 1073741824))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= |v_thread1Thread1of1ForFork0_~i~0#1_60| 2) (= v_~x1~0_86 (select .cse1 (+ v_~f~0.offset_97 (* .cse0 4)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_170| 0)))) InVars {~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_166|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_32|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, ~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_60|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_170|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_86, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|, ~f~0.offset=v_~f~0.offset_97} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:30,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [756] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_238| v_~f~0.base_156))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_156 (* v_~x1~0_237 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_156 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136|) (= (select .cse0 (+ v_~f~0.offset_156 (* .cse1 4))) v_~x1~0_235) (= |v_thread2Thread1of1ForFork1_~i~1#1_248| 0) (< 0 (* (mod v_~n~0_142 1073741824) 4)) (not (= (ite (and (< v_~x1~0_237 v_~size~0_162) (<= 0 v_~x1~0_237)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132| (ite (and (< .cse1 v_~size~0_162) (<= 0 .cse1)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_162)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_187| 3))))) InVars {~size~0=v_~size~0_162, ~f~0.base=v_~f~0.base_156, #memory_int=|v_#memory_int_238|, ~n~0=v_~n~0_142, ~x1~0=v_~x1~0_237, ~f~0.offset=v_~f~0.offset_156} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_126|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132|, ~size~0=v_~size~0_162, ~f~0.base=v_~f~0.base_156, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_187|, #memory_int=|v_#memory_int_238|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_248|, ~n~0=v_~n~0_142, ~x1~0=v_~x1~0_235, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_136|, ~f~0.offset=v_~f~0.offset_156} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:31,363 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [758] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_240| v_~f~0.base_158))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_158 (* v_~x1~0_243 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_158 (* .cse3 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_158 (* .cse1 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_140|) (= |v_thread2Thread1of1ForFork1_~i~1#1_250| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_191| 4) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_164)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|) (not (= (ite (and (< v_~x1~0_243 v_~size~0_164) (<= 0 v_~x1~0_243)) 1 0) 0)) (< 0 (* (mod v_~n~0_144 1073741824) 4)) (not (= (ite (and (< .cse1 v_~size~0_164) (<= 0 .cse1)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_158 (* .cse0 4))) v_~x1~0_241) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_164)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_140| 0))))))) InVars {~size~0=v_~size~0_164, ~f~0.base=v_~f~0.base_158, #memory_int=|v_#memory_int_240|, ~n~0=v_~n~0_144, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_158} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_130|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|, ~size~0=v_~size~0_164, ~f~0.base=v_~f~0.base_158, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_191|, #memory_int=|v_#memory_int_240|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_140|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_250|, ~n~0=v_~n~0_144, ~x1~0=v_~x1~0_241, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_140|, ~f~0.offset=v_~f~0.offset_158} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:31,692 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:54:31,692 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1741 [2022-12-06 07:54:31,693 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 1314 flow [2022-12-06 07:54:31,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:31,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:31,693 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:31,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:31,893 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,SelfDestructingSolverStorable17 [2022-12-06 07:54:31,893 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1906459602, now seen corresponding path program 1 times [2022-12-06 07:54:31,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:31,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190281717] [2022-12-06 07:54:31,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:31,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190281717] [2022-12-06 07:54:32,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190281717] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994316123] [2022-12-06 07:54:32,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:32,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:32,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:32,002 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:32,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 07:54:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:32,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:54:32,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:32,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:32,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994316123] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:32,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:32,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 07:54:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313430491] [2022-12-06 07:54:32,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:32,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:54:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:32,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:54:32,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:54:32,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:54:32,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 1314 flow. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:32,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:32,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:54:32,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:34,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:54:35,120 INFO L130 PetriNetUnfolder]: 686/1187 cut-off events. [2022-12-06 07:54:35,120 INFO L131 PetriNetUnfolder]: For 11195/11195 co-relation queries the response was YES. [2022-12-06 07:54:35,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7800 conditions, 1187 events. 686/1187 cut-off events. For 11195/11195 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5929 event pairs, 43 based on Foata normal form. 104/1278 useless extension candidates. Maximal degree in co-relation 7282. Up to 537 conditions per place. [2022-12-06 07:54:35,129 INFO L137 encePairwiseOnDemand]: 15/39 looper letters, 133 selfloop transitions, 91 changer transitions 6/230 dead transitions. [2022-12-06 07:54:35,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 230 transitions, 3420 flow [2022-12-06 07:54:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:54:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:54:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 143 transitions. [2022-12-06 07:54:35,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19298245614035087 [2022-12-06 07:54:35,134 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 1314 flow. Second operand 19 states and 143 transitions. [2022-12-06 07:54:35,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 230 transitions, 3420 flow [2022-12-06 07:54:35,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 230 transitions, 3093 flow, removed 147 selfloop flow, removed 5 redundant places. [2022-12-06 07:54:35,162 INFO L231 Difference]: Finished difference. Result has 110 places, 132 transitions, 2043 flow [2022-12-06 07:54:35,162 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2043, PETRI_PLACES=110, PETRI_TRANSITIONS=132} [2022-12-06 07:54:35,163 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 07:54:35,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:35,163 INFO L89 Accepts]: Start accepts. Operand has 110 places, 132 transitions, 2043 flow [2022-12-06 07:54:35,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:35,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:35,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 132 transitions, 2043 flow [2022-12-06 07:54:35,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 132 transitions, 2043 flow [2022-12-06 07:54:35,201 INFO L130 PetriNetUnfolder]: 114/314 cut-off events. [2022-12-06 07:54:35,201 INFO L131 PetriNetUnfolder]: For 2975/3111 co-relation queries the response was YES. [2022-12-06 07:54:35,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 314 events. 114/314 cut-off events. For 2975/3111 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1617 event pairs, 2 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 1761. Up to 144 conditions per place. [2022-12-06 07:54:35,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 132 transitions, 2043 flow [2022-12-06 07:54:35,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-06 07:54:35,986 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:35,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 823 [2022-12-06 07:54:35,987 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 132 transitions, 2047 flow [2022-12-06 07:54:35,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:35,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:35,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:35,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 07:54:36,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:36,187 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash -5261297, now seen corresponding path program 1 times [2022-12-06 07:54:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:36,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413305788] [2022-12-06 07:54:36,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:36,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:37,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:37,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413305788] [2022-12-06 07:54:37,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413305788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:37,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140273634] [2022-12-06 07:54:37,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:37,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:37,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:37,209 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:37,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 07:54:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:37,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 07:54:37,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:37,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:37,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 07:54:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:37,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:37,704 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 07:54:37,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-06 07:54:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:38,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140273634] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:38,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:38,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-06 07:54:38,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077780827] [2022-12-06 07:54:38,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:38,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:54:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:38,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:54:38,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:54:38,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:54:38,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 132 transitions, 2047 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:38,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:38,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:54:38,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:38,953 INFO L130 PetriNetUnfolder]: 723/1234 cut-off events. [2022-12-06 07:54:38,953 INFO L131 PetriNetUnfolder]: For 13002/13002 co-relation queries the response was YES. [2022-12-06 07:54:38,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8572 conditions, 1234 events. 723/1234 cut-off events. For 13002/13002 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6181 event pairs, 128 based on Foata normal form. 1/1232 useless extension candidates. Maximal degree in co-relation 7583. Up to 1152 conditions per place. [2022-12-06 07:54:38,962 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 123 selfloop transitions, 27 changer transitions 1/151 dead transitions. [2022-12-06 07:54:38,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 151 transitions, 2522 flow [2022-12-06 07:54:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:54:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:54:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 07:54:38,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24561403508771928 [2022-12-06 07:54:38,963 INFO L175 Difference]: Start difference. First operand has 107 places, 132 transitions, 2047 flow. Second operand 6 states and 56 transitions. [2022-12-06 07:54:38,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 151 transitions, 2522 flow [2022-12-06 07:54:38,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 151 transitions, 2177 flow, removed 155 selfloop flow, removed 4 redundant places. [2022-12-06 07:54:38,996 INFO L231 Difference]: Finished difference. Result has 110 places, 139 transitions, 1896 flow [2022-12-06 07:54:38,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1713, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1896, PETRI_PLACES=110, PETRI_TRANSITIONS=139} [2022-12-06 07:54:38,996 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 07:54:38,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:38,997 INFO L89 Accepts]: Start accepts. Operand has 110 places, 139 transitions, 1896 flow [2022-12-06 07:54:38,998 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:38,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:38,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 139 transitions, 1896 flow [2022-12-06 07:54:38,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 139 transitions, 1896 flow [2022-12-06 07:54:39,044 INFO L130 PetriNetUnfolder]: 118/330 cut-off events. [2022-12-06 07:54:39,044 INFO L131 PetriNetUnfolder]: For 3051/3188 co-relation queries the response was YES. [2022-12-06 07:54:39,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1994 conditions, 330 events. 118/330 cut-off events. For 3051/3188 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1809 event pairs, 2 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 1748. Up to 152 conditions per place. [2022-12-06 07:54:39,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 139 transitions, 1896 flow [2022-12-06 07:54:39,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-06 07:54:39,570 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_242| v_~f~0.base_160))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_160 (* v_~x2~0_280 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_160 (* .cse4 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_160 (* v_~x1~0_248 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_160 (* .cse3 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_160 (* .cse2 4))))) (and (= v_~x1~0_247 (select .cse0 (+ v_~f~0.offset_160 (* .cse1 4)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_252| 4) (not (= (ite (and (< .cse2 v_~size~0_166) (<= 0 .cse2)) 1 0) 0)) (not (= 0 (ite (and (< v_~x2~0_280 v_~size~0_166) (<= 0 v_~x2~0_280)) 1 0))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_144| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193| 0)) (not (= (ite (and (< .cse3 v_~size~0_166) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_195| 3) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_166)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_166)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_144|) (not (= (ite (and (< v_~x1~0_248 v_~size~0_166) (<= 0 v_~x1~0_248)) 1 0) 0)) (< 0 (* (mod v_~n~0_146 1073741824) 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_166)) 1 0)) (= (select .cse0 (+ (* .cse5 4) v_~f~0.offset_160)) v_~x2~0_279)))))) InVars {~x2~0=v_~x2~0_280, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, #memory_int=|v_#memory_int_242|, ~n~0=v_~n~0_146, ~x1~0=v_~x1~0_248, ~f~0.offset=v_~f~0.offset_160} OutVars{~x2~0=v_~x2~0_279, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_134|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_87|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_105|, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_93|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_252|, ~x1~0=v_~x1~0_247, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_87|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_85|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, #memory_int=|v_#memory_int_242|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_99|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_144|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_99|, ~n~0=v_~n~0_146, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_101|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:39,896 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:39,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 901 [2022-12-06 07:54:39,897 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 139 transitions, 1916 flow [2022-12-06 07:54:39,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:39,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:39,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:39,904 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-06 07:54:40,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:40,102 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:40,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1660388292, now seen corresponding path program 1 times [2022-12-06 07:54:40,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:40,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433327313] [2022-12-06 07:54:40,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:40,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:40,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:40,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433327313] [2022-12-06 07:54:40,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433327313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:40,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899233803] [2022-12-06 07:54:40,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:40,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:40,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:40,184 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:40,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 07:54:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:40,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 07:54:40,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:40,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:40,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:54:40,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:54:40,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:54:40,650 INFO L321 Elim1Store]: treesize reduction 185, result has 17.8 percent of original size [2022-12-06 07:54:40,650 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 244 treesize of output 102 [2022-12-06 07:54:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:40,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:41,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899233803] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:41,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:41,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 07:54:41,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313737883] [2022-12-06 07:54:41,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:41,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:54:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:41,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:54:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=117, Unknown=2, NotChecked=0, Total=156 [2022-12-06 07:54:41,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:54:41,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 139 transitions, 1916 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:41,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:41,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:54:41,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:17,983 WARN L233 SmtUtils]: Spent 36.68s on a formula simplification. DAG size of input: 160 DAG size of output: 156 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:55:50,772 WARN L233 SmtUtils]: Spent 32.65s on a formula simplification. DAG size of input: 147 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:55:52,674 INFO L130 PetriNetUnfolder]: 757/1292 cut-off events. [2022-12-06 07:55:52,674 INFO L131 PetriNetUnfolder]: For 13295/13295 co-relation queries the response was YES. [2022-12-06 07:55:52,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8364 conditions, 1292 events. 757/1292 cut-off events. For 13295/13295 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6590 event pairs, 80 based on Foata normal form. 8/1297 useless extension candidates. Maximal degree in co-relation 7352. Up to 1094 conditions per place. [2022-12-06 07:55:52,684 INFO L137 encePairwiseOnDemand]: 16/40 looper letters, 126 selfloop transitions, 48 changer transitions 4/178 dead transitions. [2022-12-06 07:55:52,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 178 transitions, 2595 flow [2022-12-06 07:55:52,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:55:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:55:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 84 transitions. [2022-12-06 07:55:52,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.175 [2022-12-06 07:55:52,686 INFO L175 Difference]: Start difference. First operand has 110 places, 139 transitions, 1916 flow. Second operand 12 states and 84 transitions. [2022-12-06 07:55:52,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 178 transitions, 2595 flow [2022-12-06 07:55:52,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 178 transitions, 2529 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 07:55:52,719 INFO L231 Difference]: Finished difference. Result has 122 places, 147 transitions, 2106 flow [2022-12-06 07:55:52,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2106, PETRI_PLACES=122, PETRI_TRANSITIONS=147} [2022-12-06 07:55:52,719 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 101 predicate places. [2022-12-06 07:55:52,719 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:52,720 INFO L89 Accepts]: Start accepts. Operand has 122 places, 147 transitions, 2106 flow [2022-12-06 07:55:52,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:52,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:52,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 147 transitions, 2106 flow [2022-12-06 07:55:52,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 147 transitions, 2106 flow [2022-12-06 07:55:52,759 INFO L130 PetriNetUnfolder]: 127/346 cut-off events. [2022-12-06 07:55:52,759 INFO L131 PetriNetUnfolder]: For 3917/4063 co-relation queries the response was YES. [2022-12-06 07:55:52,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 346 events. 127/346 cut-off events. For 3917/4063 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1900 event pairs, 2 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 2087. Up to 166 conditions per place. [2022-12-06 07:55:52,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 147 transitions, 2106 flow [2022-12-06 07:55:52,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-06 07:55:54,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_253| v_~f~0.base_170))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_170 (* v_~x2~0_296 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_170 (* 4 .cse3))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_170 (* .cse9 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_170 (* .cse7 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_170 (* .cse6 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_170 (* v_~x1~0_282 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_170 (* .cse2 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_170 (* .cse4 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_170 (* .cse8 4))))) (and (= v_~x1~0_281 (select .cse0 (+ v_~f~0.offset_170 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167| 0)) (not (= (ite (and (< .cse2 v_~size~0_176) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_176)) 1 0) 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_269|) 4294967296) (* (mod v_~n~0_156 1073741824) 4)) (not (= (ite (and (<= 0 v_~x1~0_282) (< v_~x1~0_282 v_~size~0_176)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_176)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_269| 8) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_162| (ite (and (< .cse5 v_~size~0_176) (<= 0 .cse5)) 1 0)) (= v_~x2~0_294 (select .cse0 (+ v_~f~0.offset_170 (* .cse5 4)))) (not (= (ite (and (< .cse6 v_~size~0_176) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_176) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202| 0)) (= (ite (and (< .cse1 v_~size~0_176) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163|) (not (= (ite (and (<= 0 v_~x2~0_296) (< v_~x2~0_296 v_~size~0_176)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_162| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|) (not (= 0 (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_176)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_225| 3) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_176)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_296, ~size~0=v_~size~0_176, ~f~0.base=v_~f~0.base_170, #memory_int=|v_#memory_int_253|, ~n~0=v_~n~0_156, ~x1~0=v_~x1~0_282, ~f~0.offset=v_~f~0.offset_170} OutVars{~x2~0=v_~x2~0_294, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_157|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_96|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_114|, ~size~0=v_~size~0_176, ~f~0.base=v_~f~0.base_170, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_102|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_162|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_269|, ~x1~0=v_~x1~0_281, ~f~0.offset=v_~f~0.offset_170, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_96|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_94|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_225|, #memory_int=|v_#memory_int_253|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_108|, ~n~0=v_~n~0_156, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_110|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_167|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:55:56,315 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:55:56,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3597 [2022-12-06 07:55:56,316 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 147 transitions, 2174 flow [2022-12-06 07:55:56,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:56,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:56,316 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:56,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 07:55:56,523 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,SelfDestructingSolverStorable20 [2022-12-06 07:55:56,523 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:55:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash -324503891, now seen corresponding path program 1 times [2022-12-06 07:55:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:56,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637935176] [2022-12-06 07:55:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:57,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:57,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637935176] [2022-12-06 07:55:57,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637935176] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:57,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526924949] [2022-12-06 07:55:57,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:57,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:57,696 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:55:57,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 07:55:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:57,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:55:57,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:57,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:57,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 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 07:55:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:57,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:58,263 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 07:55:58,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-06 07:55:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:59,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526924949] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:59,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:59,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 11 [2022-12-06 07:55:59,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675078527] [2022-12-06 07:55:59,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:59,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:55:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:59,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:55:59,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:55:59,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:55:59,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 147 transitions, 2174 flow. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 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-06 07:55:59,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:59,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:55:59,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:00,600 INFO L130 PetriNetUnfolder]: 827/1416 cut-off events. [2022-12-06 07:56:00,601 INFO L131 PetriNetUnfolder]: For 17207/17207 co-relation queries the response was YES. [2022-12-06 07:56:00,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9682 conditions, 1416 events. 827/1416 cut-off events. For 17207/17207 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7472 event pairs, 122 based on Foata normal form. 3/1416 useless extension candidates. Maximal degree in co-relation 9118. Up to 934 conditions per place. [2022-12-06 07:56:00,618 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 110 selfloop transitions, 69 changer transitions 7/186 dead transitions. [2022-12-06 07:56:00,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 186 transitions, 2977 flow [2022-12-06 07:56:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:56:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:56:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-12-06 07:56:00,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1937984496124031 [2022-12-06 07:56:00,619 INFO L175 Difference]: Start difference. First operand has 120 places, 147 transitions, 2174 flow. Second operand 9 states and 75 transitions. [2022-12-06 07:56:00,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 186 transitions, 2977 flow [2022-12-06 07:56:00,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 186 transitions, 2794 flow, removed 70 selfloop flow, removed 4 redundant places. [2022-12-06 07:56:00,663 INFO L231 Difference]: Finished difference. Result has 127 places, 159 transitions, 2445 flow [2022-12-06 07:56:00,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2445, PETRI_PLACES=127, PETRI_TRANSITIONS=159} [2022-12-06 07:56:00,664 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 106 predicate places. [2022-12-06 07:56:00,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:00,664 INFO L89 Accepts]: Start accepts. Operand has 127 places, 159 transitions, 2445 flow [2022-12-06 07:56:00,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:00,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:00,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 159 transitions, 2445 flow [2022-12-06 07:56:00,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 159 transitions, 2445 flow [2022-12-06 07:56:00,706 INFO L130 PetriNetUnfolder]: 136/376 cut-off events. [2022-12-06 07:56:00,706 INFO L131 PetriNetUnfolder]: For 5479/5636 co-relation queries the response was YES. [2022-12-06 07:56:00,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2659 conditions, 376 events. 136/376 cut-off events. For 5479/5636 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2191 event pairs, 2 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 2456. Up to 174 conditions per place. [2022-12-06 07:56:00,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 159 transitions, 2445 flow [2022-12-06 07:56:00,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-06 07:56:00,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_209| v_~f~0.base_128))) (let ((.cse2 (* (mod v_~n~0_112 1073741824) 4)) (.cse1 (select .cse0 (+ v_~f~0.offset_128 (* v_~x1~0_165 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= (select .cse0 (+ v_~f~0.offset_128 (* .cse1 4))) v_~x1~0_163) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_84|) (not (= (ite (and (<= 0 v_~x1~0_165) (< v_~x1~0_165 v_~size~0_134)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_134)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_84|)))) InVars {~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_128, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_209|, ~n~0=v_~n~0_112, ~x1~0=v_~x1~0_165, ~f~0.offset=v_~f~0.offset_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_78|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_84|, ~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_128, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, #memory_int=|v_#memory_int_209|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88|, ~n~0=v_~n~0_112, ~x1~0=v_~x1~0_163, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_88|, ~f~0.offset=v_~f~0.offset_128} AuxVars[] 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:56:01,001 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_270| v_~f~0.base_184))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_184 (* v_~x2~0_320 4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_184 (* .cse5 4))))) (let ((.cse13 (select .cse1 (+ v_~f~0.offset_184 (* .cse8 4))))) (let ((.cse11 (select .cse1 (+ v_~f~0.offset_184 (* .cse13 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_184 (* .cse11 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_184 (* .cse10 4))))) (let ((.cse12 (select .cse1 (+ v_~f~0.offset_184 (* .cse3 4))))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_184 (* .cse12 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_184 (* 4 .cse9))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_184 (* 4 .cse6)))) (.cse4 (select .cse1 (+ v_~f~0.offset_184 (* v_~x1~0_326 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_184 (* .cse4 4)))) (.cse7 (select .cse1 (+ v_~f~0.offset_184 (* .cse0 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_326) (< v_~x1~0_326 v_~size~0_190)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_190)) 1 0) 0)) (= v_~x1~0_325 (select .cse1 (+ v_~f~0.offset_184 (* .cse2 4)))) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_190)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_216|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_190)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_190) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_190)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| (ite (and (< .cse7 v_~size~0_190) (<= 0 .cse7)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_291| 12) (not (= (ite (and (< .cse8 v_~size~0_190) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_190)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_190) (<= 0 .cse10)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192| (ite (and (< .cse2 v_~size~0_190) (<= 0 .cse2)) 1 0)) (= (select .cse1 (+ v_~f~0.offset_184 (* .cse7 4))) v_~x2~0_318) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_190)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_216| 0)) (not (= (ite (and (< .cse12 v_~size~0_190) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_190) (<= 0 .cse13)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_254| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|) (not (= (ite (and (< v_~x2~0_320 v_~size~0_190) (<= 0 v_~x2~0_320)) 1 0) 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_291|) 4294967296) (* (mod v_~n~0_170 1073741824) 4))))))))))))))) InVars {~x2~0=v_~x2~0_320, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_184, #memory_int=|v_#memory_int_270|, ~n~0=v_~n~0_170, ~x1~0=v_~x1~0_326, ~f~0.offset=v_~f~0.offset_184} OutVars{~x2~0=v_~x2~0_318, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_110|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_128|, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_184, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_116|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_291|, ~x1~0=v_~x1~0_325, ~f~0.offset=v_~f~0.offset_184, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_216|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_110|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_108|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_254|, #memory_int=|v_#memory_int_270|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_122|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_122|, ~n~0=v_~n~0_170, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_124|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_196|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:56:02,163 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:56:02,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1500 [2022-12-06 07:56:02,164 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 158 transitions, 2444 flow [2022-12-06 07:56:02,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 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-06 07:56:02,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:02,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:02,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 07:56:02,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:02,365 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:02,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1263582363, now seen corresponding path program 1 times [2022-12-06 07:56:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:02,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615897616] [2022-12-06 07:56:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:02,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:02,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615897616] [2022-12-06 07:56:02,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615897616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:56:02,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482885090] [2022-12-06 07:56:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:02,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:02,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:02,446 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:56:02,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 07:56:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:02,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:56:02,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:56:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:02,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:56:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:02,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482885090] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:56:02,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:56:02,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 07:56:02,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291723140] [2022-12-06 07:56:02,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:56:02,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:56:02,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:02,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:56:02,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:56:02,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:56:02,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 158 transitions, 2444 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:02,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:02,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:56:02,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:03,266 INFO L130 PetriNetUnfolder]: 996/1703 cut-off events. [2022-12-06 07:56:03,266 INFO L131 PetriNetUnfolder]: For 24487/24487 co-relation queries the response was YES. [2022-12-06 07:56:03,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12317 conditions, 1703 events. 996/1703 cut-off events. For 24487/24487 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9228 event pairs, 401 based on Foata normal form. 126/1826 useless extension candidates. Maximal degree in co-relation 11492. Up to 1444 conditions per place. [2022-12-06 07:56:03,277 INFO L137 encePairwiseOnDemand]: 33/43 looper letters, 200 selfloop transitions, 31 changer transitions 4/235 dead transitions. [2022-12-06 07:56:03,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 235 transitions, 3854 flow [2022-12-06 07:56:03,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:56:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:56:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-12-06 07:56:03,278 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21188630490956073 [2022-12-06 07:56:03,279 INFO L175 Difference]: Start difference. First operand has 125 places, 158 transitions, 2444 flow. Second operand 9 states and 82 transitions. [2022-12-06 07:56:03,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 235 transitions, 3854 flow [2022-12-06 07:56:03,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 235 transitions, 3765 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-06 07:56:03,330 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 2805 flow [2022-12-06 07:56:03,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2378, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2805, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2022-12-06 07:56:03,330 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 112 predicate places. [2022-12-06 07:56:03,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:03,331 INFO L89 Accepts]: Start accepts. Operand has 133 places, 179 transitions, 2805 flow [2022-12-06 07:56:03,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:03,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:03,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 179 transitions, 2805 flow [2022-12-06 07:56:03,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 179 transitions, 2805 flow [2022-12-06 07:56:03,386 INFO L130 PetriNetUnfolder]: 169/470 cut-off events. [2022-12-06 07:56:03,386 INFO L131 PetriNetUnfolder]: For 6940/7101 co-relation queries the response was YES. [2022-12-06 07:56:03,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3486 conditions, 470 events. 169/470 cut-off events. For 6940/7101 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2916 event pairs, 5 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 3227. Up to 236 conditions per place. [2022-12-06 07:56:03,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 179 transitions, 2805 flow [2022-12-06 07:56:03,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-06 07:56:03,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [772] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_260| v_~f~0.base_174))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_174 (* v_~x1~0_297 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_174 (* .cse0 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_174 (* .cse6 4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_174 (* .cse3 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_174 (* .cse8 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_174 (* .cse4 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_174 (* .cse7 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_174 (* 4 .cse5))))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_277| 0) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_180)) 1 0) 0)) (= v_~x1~0_295 (select .cse1 (+ v_~f~0.offset_174 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|) (not (= (ite (and (< .cse3 v_~size~0_180) (<= 0 .cse3)) 1 0) 0)) (= (ite (and (< .cse2 v_~size~0_180) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_234| 4294967295) 4294967296) (* (mod v_~n~0_160 1073741824) 4)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_180)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_180) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_234| 9) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176| 0)) (not (= (ite (and (<= 0 v_~x1~0_297) (< v_~x1~0_297 v_~size~0_180)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_180)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_180) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_180) (<= 0 .cse8)) 1 0) 0)))))))))))) InVars {~size~0=v_~size~0_180, ~f~0.base=v_~f~0.base_174, #memory_int=|v_#memory_int_260|, ~n~0=v_~n~0_160, ~x1~0=v_~x1~0_297, ~f~0.offset=v_~f~0.offset_174} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_166|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|, ~size~0=v_~size~0_180, ~f~0.base=v_~f~0.base_174, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_234|, #memory_int=|v_#memory_int_260|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_277|, ~n~0=v_~n~0_160, ~x1~0=v_~x1~0_295, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_176|, ~f~0.offset=v_~f~0.offset_174} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:56:05,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_262| v_~f~0.base_176))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_176 (* v_~x1~0_303 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_176 (* .cse4 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_176 (* .cse5 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_176 (* .cse6 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_176 (* .cse1 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_176 (* .cse2 4))))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_182)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176|) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_238|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_182)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|) (not (= (ite (and (<= 0 v_~x1~0_303) (< v_~x1~0_303 v_~size~0_182)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180| 0)) (< 5 (* 4 (mod v_~n~0_162 1073741824))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_182)) 1 0) 0)) (= v_~x1~0_301 (select .cse3 (+ v_~f~0.offset_176 (* 4 .cse0)))) (not (= (ite (and (< .cse4 v_~size~0_182) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_182)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_279| 0) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_182)) 1 0) 0)))))))))) InVars {~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_176, #memory_int=|v_#memory_int_262|, ~n~0=v_~n~0_162, ~x1~0=v_~x1~0_303, ~f~0.offset=v_~f~0.offset_176} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_170|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176|, ~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_176, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_238|, #memory_int=|v_#memory_int_262|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_279|, ~n~0=v_~n~0_162, ~x1~0=v_~x1~0_301, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_180|, ~f~0.offset=v_~f~0.offset_176} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:56:06,290 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_244| v_~f~0.base_162))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_162 (* v_~x1~0_253 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_162 (* .cse1 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_162 (* 4 .cse3))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_162 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_142| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_168)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_197| 5) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_142| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_146|) (not (= (ite (and (<= 0 v_~x1~0_253) (< v_~x1~0_253 v_~size~0_168)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_168)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_197| 4294967295) 4294967296) (* (mod v_~n~0_148 1073741824) 4)) (= |v_thread2Thread1of1ForFork1_~i~1#1_256| 0) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_168)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_168)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_162 (* .cse0 4))) v_~x1~0_251) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_146| 0)))))))) InVars {~size~0=v_~size~0_168, ~f~0.base=v_~f~0.base_162, #memory_int=|v_#memory_int_244|, ~n~0=v_~n~0_148, ~x1~0=v_~x1~0_253, ~f~0.offset=v_~f~0.offset_162} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_142|, ~size~0=v_~size~0_168, ~f~0.base=v_~f~0.base_162, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_197|, #memory_int=|v_#memory_int_244|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_146|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_256|, ~n~0=v_~n~0_148, ~x1~0=v_~x1~0_251, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_146|, ~f~0.offset=v_~f~0.offset_162} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:56:07,823 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:56:07,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4493 [2022-12-06 07:56:07,824 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 178 transitions, 2858 flow [2022-12-06 07:56:07,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:07,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:07,824 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:07,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 07:56:08,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:08,025 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:08,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:08,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1772704836, now seen corresponding path program 1 times [2022-12-06 07:56:08,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:08,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519196256] [2022-12-06 07:56:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:08,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:11,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:11,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519196256] [2022-12-06 07:56:11,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519196256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:56:11,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594460952] [2022-12-06 07:56:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:11,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:11,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:11,024 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:56:11,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 07:56:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:11,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-06 07:56:11,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:56:11,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:56:11,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:56:11,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:56:11,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:56:11,666 INFO L321 Elim1Store]: treesize reduction 185, result has 17.8 percent of original size [2022-12-06 07:56:11,666 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 201 treesize of output 99 [2022-12-06 07:56:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:56:11,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:56:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:15,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594460952] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:56:15,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:56:15,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 17 [2022-12-06 07:56:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276342264] [2022-12-06 07:56:15,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:56:15,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 07:56:15,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:15,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 07:56:15,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=271, Unknown=3, NotChecked=0, Total=342 [2022-12-06 07:56:15,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:56:15,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 178 transitions, 2858 flow. Second operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:15,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:15,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:56:15,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:21,114 INFO L130 PetriNetUnfolder]: 1423/2463 cut-off events. [2022-12-06 07:56:21,115 INFO L131 PetriNetUnfolder]: For 40244/40244 co-relation queries the response was YES. [2022-12-06 07:56:21,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19411 conditions, 2463 events. 1423/2463 cut-off events. For 40244/40244 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 14310 event pairs, 198 based on Foata normal form. 7/2463 useless extension candidates. Maximal degree in co-relation 18005. Up to 1045 conditions per place. [2022-12-06 07:56:21,132 INFO L137 encePairwiseOnDemand]: 15/47 looper letters, 132 selfloop transitions, 162 changer transitions 23/317 dead transitions. [2022-12-06 07:56:21,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 317 transitions, 5371 flow [2022-12-06 07:56:21,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:56:21,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:56:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 113 transitions. [2022-12-06 07:56:21,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20035460992907803 [2022-12-06 07:56:21,156 INFO L175 Difference]: Start difference. First operand has 132 places, 178 transitions, 2858 flow. Second operand 12 states and 113 transitions. [2022-12-06 07:56:21,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 317 transitions, 5371 flow [2022-12-06 07:56:21,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 317 transitions, 4979 flow, removed 188 selfloop flow, removed 1 redundant places. [2022-12-06 07:56:21,302 INFO L231 Difference]: Finished difference. Result has 148 places, 248 transitions, 4287 flow [2022-12-06 07:56:21,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4287, PETRI_PLACES=148, PETRI_TRANSITIONS=248} [2022-12-06 07:56:21,303 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 127 predicate places. [2022-12-06 07:56:21,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:21,303 INFO L89 Accepts]: Start accepts. Operand has 148 places, 248 transitions, 4287 flow [2022-12-06 07:56:21,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:21,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:21,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 248 transitions, 4287 flow [2022-12-06 07:56:21,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 248 transitions, 4287 flow [2022-12-06 07:56:21,403 INFO L130 PetriNetUnfolder]: 225/671 cut-off events. [2022-12-06 07:56:21,403 INFO L131 PetriNetUnfolder]: For 11677/11936 co-relation queries the response was YES. [2022-12-06 07:56:21,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5138 conditions, 671 events. 225/671 cut-off events. For 11677/11936 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4657 event pairs, 2 based on Foata normal form. 1/659 useless extension candidates. Maximal degree in co-relation 4778. Up to 333 conditions per place. [2022-12-06 07:56:21,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 248 transitions, 4287 flow [2022-12-06 07:56:21,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 930 [2022-12-06 07:56:23,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [788] $Ultimate##0-->L49-2: Formula: (let ((.cse8 (select |v_#memory_int_281| v_~f~0.base_194))) (let ((.cse6 (select .cse8 (+ v_~f~0.offset_194 (* v_~x1~0_359 4))))) (let ((.cse1 (select .cse8 (+ v_~f~0.offset_194 (* .cse6 4))))) (let ((.cse0 (select .cse8 (+ v_~f~0.offset_194 (* .cse1 4))))) (let ((.cse5 (select .cse8 (+ v_~f~0.offset_194 (* .cse0 4))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_194 (* .cse5 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_194 (* .cse4 4))))) (let ((.cse9 (select .cse8 (+ v_~f~0.offset_194 (* .cse2 4))))) (let ((.cse7 (select .cse8 (+ v_~f~0.offset_194 (* 4 .cse9))))) (let ((.cse10 (select .cse8 (+ v_~f~0.offset_194 (* .cse7 4))))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_194 (* .cse10 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_212| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_200)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_200)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_200)) 1 0) 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_200)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_212|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_277| 4294967293) 4294967296) (* (mod v_~n~0_180 1073741824) 4)) (not (= (ite (and (< .cse4 v_~size~0_200) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_314| 0) (not (= (ite (and (<= 0 v_~x1~0_359) (< v_~x1~0_359 v_~size~0_200)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_200)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_200) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_200)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_277| 11) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216| 0)) (= (select .cse8 (+ v_~f~0.offset_194 (* .cse3 4))) v_~x1~0_357) (not (= (ite (and (< .cse9 v_~size~0_200) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_200)) 1 0) 0)))))))))))))) InVars {~size~0=v_~size~0_200, ~f~0.base=v_~f~0.base_194, #memory_int=|v_#memory_int_281|, ~n~0=v_~n~0_180, ~x1~0=v_~x1~0_359, ~f~0.offset=v_~f~0.offset_194} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_206|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_212|, ~size~0=v_~size~0_200, ~f~0.base=v_~f~0.base_194, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_277|, #memory_int=|v_#memory_int_281|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_314|, ~n~0=v_~n~0_180, ~x1~0=v_~x1~0_357, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_216|, ~f~0.offset=v_~f~0.offset_194} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:56:24,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [790] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_285| v_~f~0.base_198))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_198 (* v_~x1~0_368 4))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_198 (* .cse7 4)))) (.cse5 (select .cse4 (+ v_~f~0.offset_198 (* v_~x2~0_348 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_198 (* .cse5 4)))) (.cse1 (select .cse4 (+ v_~f~0.offset_198 (* .cse6 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_198 (* .cse1 4)))) (.cse0 (select .cse4 (+ v_~f~0.offset_198 (* .cse3 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_283| 4294967295) 4294967296) (* (mod v_~n~0_184 1073741824) 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_193| (ite (and (< .cse0 v_~size~0_204) (<= 0 .cse0)) 1 0)) (not (= (ite (and (< .cse1 v_~size~0_204) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_368 v_~size~0_204) (<= 0 v_~x1~0_368)) 1 0) 0)) (= (ite (and (< .cse2 v_~size~0_204) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218|) (not (= (ite (and (< .cse3 v_~size~0_204) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_222|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_193| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_233|) (= v_~x1~0_367 (select .cse4 (+ v_~f~0.offset_198 (* .cse2 4)))) (= v_~x2~0_347 (select .cse4 (+ v_~f~0.offset_198 (* .cse0 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_222| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_233| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_283| 5) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_204)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_204) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_204)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_320| 4) (not (= (ite (and (< v_~x2~0_348 v_~size~0_204) (<= 0 v_~x2~0_348)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_348, ~size~0=v_~size~0_204, ~f~0.base=v_~f~0.base_198, #memory_int=|v_#memory_int_285|, ~n~0=v_~n~0_184, ~x1~0=v_~x1~0_368, ~f~0.offset=v_~f~0.offset_198} OutVars{~x2~0=v_~x2~0_347, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_212|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_127|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_145|, ~size~0=v_~size~0_204, ~f~0.base=v_~f~0.base_198, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_193|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_320|, ~x1~0=v_~x1~0_367, ~f~0.offset=v_~f~0.offset_198, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_233|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_127|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_125|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_283|, #memory_int=|v_#memory_int_285|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_139|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_222|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_139|, ~n~0=v_~n~0_184, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_141|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_222|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:56:24,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_283| v_~f~0.base_196))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_196 (* v_~x1~0_364 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_196 (* .cse8 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_196 (* .cse4 4))))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_196 (* .cse7 4)))) (.cse6 (select .cse1 (+ v_~f~0.offset_196 (* v_~x2~0_344 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_196 (* .cse6 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_196 (* .cse9 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_196 (* .cse5 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_196 (* .cse3 4))))) (and (= (ite (and (< .cse0 v_~size~0_202) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_220|) (= (select .cse1 (+ v_~f~0.offset_196 (* .cse2 4))) v_~x2~0_343) (not (= (ite (and (<= 0 v_~x2~0_344) (< v_~x2~0_344 v_~size~0_202)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_202) (<= 0 .cse3)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_196 (* .cse0 4))) v_~x1~0_363) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_191| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_202)) 1 0)) (not (= (ite (and (< v_~x1~0_364 v_~size~0_202) (<= 0 v_~x1~0_364)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_202) (<= 0 .cse4)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_281|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_202)) 1 0) 0)) (< 5 (* (mod v_~n~0_182 1073741824) 4)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_220| 0)) (not (= 0 (ite (and (< .cse6 v_~size~0_202) (<= 0 .cse6)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_231| 0)) (not (= (ite (and (< .cse7 v_~size~0_202) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_316| 4) (not (= (ite (and (< .cse8 v_~size~0_202) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_191| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_202)) 1 0) 0)))))))))) InVars {~x2~0=v_~x2~0_344, ~size~0=v_~size~0_202, ~f~0.base=v_~f~0.base_196, #memory_int=|v_#memory_int_283|, ~n~0=v_~n~0_182, ~x1~0=v_~x1~0_364, ~f~0.offset=v_~f~0.offset_196} OutVars{~x2~0=v_~x2~0_343, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_210|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_125|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_143|, ~size~0=v_~size~0_202, ~f~0.base=v_~f~0.base_196, 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_191|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_316|, ~x1~0=v_~x1~0_363, ~f~0.offset=v_~f~0.offset_196, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_125|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_123|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_281|, #memory_int=|v_#memory_int_283|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_137|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_220|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_137|, ~n~0=v_~n~0_182, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_139|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_220|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:56:25,252 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:56:25,253 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3950 [2022-12-06 07:56:25,253 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 248 transitions, 4360 flow [2022-12-06 07:56:25,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:25,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:25,254 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:25,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 07:56:25,459 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,SelfDestructingSolverStorable23 [2022-12-06 07:56:25,459 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:25,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1420432038, now seen corresponding path program 1 times [2022-12-06 07:56:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:25,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310826023] [2022-12-06 07:56:25,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:25,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:56:25,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:25,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310826023] [2022-12-06 07:56:25,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310826023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:25,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:25,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:56:25,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897479012] [2022-12-06 07:56:25,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:25,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 07:56:25,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:25,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 07:56:25,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 07:56:25,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:56:25,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 248 transitions, 4360 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:25,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:25,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:56:25,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:25,977 INFO L130 PetriNetUnfolder]: 1411/2445 cut-off events. [2022-12-06 07:56:25,977 INFO L131 PetriNetUnfolder]: For 42768/42768 co-relation queries the response was YES. [2022-12-06 07:56:25,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20017 conditions, 2445 events. 1411/2445 cut-off events. For 42768/42768 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 14179 event pairs, 732 based on Foata normal form. 2/2442 useless extension candidates. Maximal degree in co-relation 18457. Up to 2446 conditions per place. [2022-12-06 07:56:25,996 INFO L137 encePairwiseOnDemand]: 50/51 looper letters, 245 selfloop transitions, 0 changer transitions 1/246 dead transitions. [2022-12-06 07:56:25,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 246 transitions, 4803 flow [2022-12-06 07:56:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 07:56:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 07:56:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-12-06 07:56:25,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:56:25,997 INFO L175 Difference]: Start difference. First operand has 147 places, 248 transitions, 4360 flow. Second operand 2 states and 51 transitions. [2022-12-06 07:56:25,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 246 transitions, 4803 flow [2022-12-06 07:56:26,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 246 transitions, 4640 flow, removed 64 selfloop flow, removed 4 redundant places. [2022-12-06 07:56:26,128 INFO L231 Difference]: Finished difference. Result has 144 places, 245 transitions, 4129 flow [2022-12-06 07:56:26,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4148, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=4129, PETRI_PLACES=144, PETRI_TRANSITIONS=245} [2022-12-06 07:56:26,129 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 123 predicate places. [2022-12-06 07:56:26,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:26,129 INFO L89 Accepts]: Start accepts. Operand has 144 places, 245 transitions, 4129 flow [2022-12-06 07:56:26,130 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:26,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:26,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 245 transitions, 4129 flow [2022-12-06 07:56:26,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 245 transitions, 4129 flow [2022-12-06 07:56:26,231 INFO L130 PetriNetUnfolder]: 225/665 cut-off events. [2022-12-06 07:56:26,231 INFO L131 PetriNetUnfolder]: For 11389/11646 co-relation queries the response was YES. [2022-12-06 07:56:26,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5031 conditions, 665 events. 225/665 cut-off events. For 11389/11646 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4577 event pairs, 4 based on Foata normal form. 2/654 useless extension candidates. Maximal degree in co-relation 4857. Up to 329 conditions per place. [2022-12-06 07:56:26,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 245 transitions, 4129 flow [2022-12-06 07:56:26,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 920 [2022-12-06 07:56:27,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [798] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_298| v_~f~0.base_208))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_208 (* v_~x1~0_398 4))))) (let ((.cse4 (select .cse10 (+ (* .cse2 4) v_~f~0.offset_208)))) (let ((.cse3 (select .cse10 (+ v_~f~0.offset_208 (* .cse4 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_208 (* .cse3 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_208 (* .cse6 4))))) (let ((.cse12 (select .cse10 (+ v_~f~0.offset_208 (* .cse1 4))))) (let ((.cse0 (select .cse10 (+ v_~f~0.offset_208 (* 4 .cse12))))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_208 (* .cse0 4)))) (.cse8 (select .cse10 (+ v_~f~0.offset_208 (* v_~x2~0_370 4))))) (let ((.cse9 (select .cse10 (+ v_~f~0.offset_208 (* .cse8 4)))) (.cse5 (select .cse10 (+ v_~f~0.offset_208 (* .cse13 4))))) (let ((.cse7 (select .cse10 (+ (* 4 .cse5) v_~f~0.offset_208))) (.cse11 (select .cse10 (+ v_~f~0.offset_208 (* 4 .cse9))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_214)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_214) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_214) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_214) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_214) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_246| 0)) (not (= (ite (and (< .cse5 v_~size~0_214) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_214)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_341| 4) (= (ite (and (< .cse7 v_~size~0_214) (<= 0 .cse7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236|) (not (= (ite (and (< .cse8 v_~size~0_214) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_214) (<= 0 .cse9)) 1 0) 0)) (= (select .cse10 (+ (* .cse7 4) v_~f~0.offset_208)) v_~x1~0_397) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_214)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_246|) (= (select .cse10 (+ v_~f~0.offset_208 (* .cse11 4))) v_~x2~0_369) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_214)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_214) (<= 0 .cse13)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240|) (= |v_thread1Thread1of1ForFork0_~i~0#1_301| 11) (not (= (ite (and (<= 0 v_~x1~0_398) (< v_~x1~0_398 v_~size~0_214)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_301| 4294967293) 4294967296) (* (mod v_~n~0_194 1073741824) 4)) (not (= (ite (and (<= 0 v_~x2~0_370) (< v_~x2~0_370 v_~size~0_214)) 1 0) 0)))))))))))))) InVars {~x2~0=v_~x2~0_370, ~size~0=v_~size~0_214, ~f~0.base=v_~f~0.base_208, #memory_int=|v_#memory_int_298|, ~n~0=v_~n~0_194, ~x1~0=v_~x1~0_398, ~f~0.offset=v_~f~0.offset_208} OutVars{~x2~0=v_~x2~0_369, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_230|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_140|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_158|, ~size~0=v_~size~0_214, ~f~0.base=v_~f~0.base_208, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_146|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_341|, ~x1~0=v_~x1~0_397, ~f~0.offset=v_~f~0.offset_208, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_246|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_140|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_138|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_301|, #memory_int=|v_#memory_int_298|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_152|, 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_152|, ~n~0=v_~n~0_194, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_154|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_240|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:56:28,328 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:28,331 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2202 [2022-12-06 07:56:28,331 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 245 transitions, 4153 flow [2022-12-06 07:56:28,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:28,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:28,332 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:28,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 07:56:28,332 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash 339381868, now seen corresponding path program 1 times [2022-12-06 07:56:28,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:28,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008766533] [2022-12-06 07:56:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:28,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:28,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008766533] [2022-12-06 07:56:28,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008766533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:56:28,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829435946] [2022-12-06 07:56:28,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:28,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:28,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:28,513 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:56:28,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 07:56:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:28,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:56:28,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:56:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:28,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:56:28,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829435946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:28,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:56:28,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-12-06 07:56:28,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883372275] [2022-12-06 07:56:28,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:28,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:28,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:28,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:56:28,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:56:28,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 245 transitions, 4153 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:28,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:28,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:56:28,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:29,282 INFO L130 PetriNetUnfolder]: 1409/2443 cut-off events. [2022-12-06 07:56:29,283 INFO L131 PetriNetUnfolder]: For 41970/41970 co-relation queries the response was YES. [2022-12-06 07:56:29,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19690 conditions, 2443 events. 1409/2443 cut-off events. For 41970/41970 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 14113 event pairs, 708 based on Foata normal form. 4/2442 useless extension candidates. Maximal degree in co-relation 19360. Up to 2436 conditions per place. [2022-12-06 07:56:29,300 INFO L137 encePairwiseOnDemand]: 47/51 looper letters, 244 selfloop transitions, 3 changer transitions 5/252 dead transitions. [2022-12-06 07:56:29,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 252 transitions, 4715 flow [2022-12-06 07:56:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 07:56:29,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28921568627450983 [2022-12-06 07:56:29,317 INFO L175 Difference]: Start difference. First operand has 142 places, 245 transitions, 4153 flow. Second operand 4 states and 59 transitions. [2022-12-06 07:56:29,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 252 transitions, 4715 flow [2022-12-06 07:56:29,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 252 transitions, 4699 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 07:56:29,438 INFO L231 Difference]: Finished difference. Result has 146 places, 246 transitions, 4173 flow [2022-12-06 07:56:29,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4137, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4173, PETRI_PLACES=146, PETRI_TRANSITIONS=246} [2022-12-06 07:56:29,439 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 125 predicate places. [2022-12-06 07:56:29,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:29,439 INFO L89 Accepts]: Start accepts. Operand has 146 places, 246 transitions, 4173 flow [2022-12-06 07:56:29,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:29,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:29,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 246 transitions, 4173 flow [2022-12-06 07:56:29,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 246 transitions, 4173 flow [2022-12-06 07:56:29,523 INFO L130 PetriNetUnfolder]: 227/669 cut-off events. [2022-12-06 07:56:29,523 INFO L131 PetriNetUnfolder]: For 11704/11955 co-relation queries the response was YES. [2022-12-06 07:56:29,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5126 conditions, 669 events. 227/669 cut-off events. For 11704/11955 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4565 event pairs, 3 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 4975. Up to 332 conditions per place. [2022-12-06 07:56:29,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 246 transitions, 4173 flow [2022-12-06 07:56:29,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 914 [2022-12-06 07:56:29,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_304| v_~f~0.base_214))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_214 (* v_~x1~0_414 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_214 (* .cse3 4))))) (let ((.cse10 (select .cse6 (+ v_~f~0.offset_214 (* .cse0 4))))) (let ((.cse17 (select .cse6 (+ v_~f~0.offset_214 (* v_~x2~0_383 4)))) (.cse9 (select .cse6 (+ v_~f~0.offset_214 (* .cse10 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_214 (* .cse9 4)))) (.cse13 (select .cse6 (+ v_~f~0.offset_214 (* 4 .cse17))))) (let ((.cse15 (select .cse6 (+ v_~f~0.offset_214 (* .cse13 4)))) (.cse1 (select .cse6 (+ v_~f~0.offset_214 (* .cse4 4))))) (let ((.cse16 (select .cse6 (+ v_~f~0.offset_214 (* .cse1 4)))) (.cse11 (select .cse6 (+ v_~f~0.offset_214 (* .cse15 4))))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_214 (* .cse11 4)))) (.cse12 (select .cse6 (+ v_~f~0.offset_214 (* .cse16 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_214 (* .cse12 4)))) (.cse2 (select .cse6 (+ v_~f~0.offset_214 (* .cse8 4))))) (let ((.cse7 (select .cse6 (+ v_~f~0.offset_214 (* .cse2 4)))) (.cse14 (select .cse6 (+ v_~f~0.offset_214 (* .cse5 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_220) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_220) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_220)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_220)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250| 0)) (not (= (ite (and (< .cse4 v_~size~0_220) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_414) (< v_~x1~0_414 v_~size~0_220)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_349| 8) (= v_~x2~0_381 (select .cse6 (+ v_~f~0.offset_214 (* .cse7 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_220)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_220) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_220) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_220)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_220)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_220)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_311| 4294967293) 4294967296) (* (mod v_~n~0_200 1073741824) 4)) (not (= (ite (and (< v_~x2~0_383 v_~size~0_220) (<= 0 v_~x2~0_383)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_311| 11) (= (select .cse6 (+ v_~f~0.offset_214 (* .cse14 4))) v_~x1~0_413) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_246| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250|) (not (= (ite (and (< .cse15 v_~size~0_220) (<= 0 .cse15)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212| (ite (and (< .cse7 v_~size~0_220) (<= 0 .cse7)) 1 0)) (not (= (ite (and (< .cse16 v_~size~0_220) (<= 0 .cse16)) 1 0) 0)) (= (ite (and (< .cse14 v_~size~0_220) (<= 0 .cse14)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_246|) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_220)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_252| 0)))))))))))))) InVars {~x2~0=v_~x2~0_383, ~size~0=v_~size~0_220, ~f~0.base=v_~f~0.base_214, #memory_int=|v_#memory_int_304|, ~n~0=v_~n~0_200, ~x1~0=v_~x1~0_414, ~f~0.offset=v_~f~0.offset_214} OutVars{~x2~0=v_~x2~0_381, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_240|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_146|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_164|, ~size~0=v_~size~0_220, ~f~0.base=v_~f~0.base_214, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_152|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_349|, ~x1~0=v_~x1~0_413, ~f~0.offset=v_~f~0.offset_214, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_246|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_146|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_144|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_311|, #memory_int=|v_#memory_int_304|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_158|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_158|, ~n~0=v_~n~0_200, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_160|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_250|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:56:33,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:33,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3646 [2022-12-06 07:56:33,085 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 246 transitions, 4189 flow [2022-12-06 07:56:33,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:33,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:33,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:33,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-06 07:56:33,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 07:56:33,286 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:33,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2102858552, now seen corresponding path program 1 times [2022-12-06 07:56:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:33,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545734632] [2022-12-06 07:56:33,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:33,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:33,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545734632] [2022-12-06 07:56:33,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545734632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:33,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:33,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:56:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706651002] [2022-12-06 07:56:33,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:33,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:56:33,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:33,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:56:33,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:56:33,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:56:33,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 246 transitions, 4189 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:33,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:33,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:56:33,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:33,836 INFO L130 PetriNetUnfolder]: 1424/2460 cut-off events. [2022-12-06 07:56:33,836 INFO L131 PetriNetUnfolder]: For 43688/43688 co-relation queries the response was YES. [2022-12-06 07:56:33,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20062 conditions, 2460 events. 1424/2460 cut-off events. For 43688/43688 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14214 event pairs, 692 based on Foata normal form. 4/2459 useless extension candidates. Maximal degree in co-relation 19443. Up to 2394 conditions per place. [2022-12-06 07:56:33,854 INFO L137 encePairwiseOnDemand]: 44/52 looper letters, 244 selfloop transitions, 13 changer transitions 1/258 dead transitions. [2022-12-06 07:56:33,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 258 transitions, 4894 flow [2022-12-06 07:56:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:56:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:56:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-06 07:56:33,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-06 07:56:33,855 INFO L175 Difference]: Start difference. First operand has 144 places, 246 transitions, 4189 flow. Second operand 3 states and 57 transitions. [2022-12-06 07:56:33,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 258 transitions, 4894 flow [2022-12-06 07:56:33,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 258 transitions, 4861 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:33,987 INFO L231 Difference]: Finished difference. Result has 145 places, 249 transitions, 4259 flow [2022-12-06 07:56:33,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=4158, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4259, PETRI_PLACES=145, PETRI_TRANSITIONS=249} [2022-12-06 07:56:33,988 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 124 predicate places. [2022-12-06 07:56:33,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:33,988 INFO L89 Accepts]: Start accepts. Operand has 145 places, 249 transitions, 4259 flow [2022-12-06 07:56:33,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:33,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:33,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 249 transitions, 4259 flow [2022-12-06 07:56:33,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 249 transitions, 4259 flow [2022-12-06 07:56:34,073 INFO L130 PetriNetUnfolder]: 230/677 cut-off events. [2022-12-06 07:56:34,073 INFO L131 PetriNetUnfolder]: For 12055/12306 co-relation queries the response was YES. [2022-12-06 07:56:34,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5257 conditions, 677 events. 230/677 cut-off events. For 12055/12306 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4675 event pairs, 4 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 4883. Up to 337 conditions per place. [2022-12-06 07:56:34,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 249 transitions, 4259 flow [2022-12-06 07:56:34,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 926 [2022-12-06 07:56:34,082 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:56:34,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:56:34,083 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 249 transitions, 4259 flow [2022-12-06 07:56:34,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:34,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:34,084 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:34,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 07:56:34,084 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash 652083889, now seen corresponding path program 1 times [2022-12-06 07:56:34,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:34,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498182759] [2022-12-06 07:56:34,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:34,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:38,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:38,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498182759] [2022-12-06 07:56:38,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498182759] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:56:38,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977569780] [2022-12-06 07:56:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:38,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:38,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:38,694 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:56:38,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 07:56:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:38,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 07:56:38,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:56:38,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:56:38,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:56:38,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:56:38,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:56:39,495 INFO L321 Elim1Store]: treesize reduction 477, result has 9.8 percent of original size [2022-12-06 07:56:39,495 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 23 new quantified variables, introduced 66 case distinctions, treesize of input 651 treesize of output 149 [2022-12-06 07:56:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:39,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:56:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:42,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977569780] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:56:42,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:56:42,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 07:56:42,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819820153] [2022-12-06 07:56:42,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:56:42,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:56:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:42,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:56:42,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=124, Unknown=3, NotChecked=0, Total=182 [2022-12-06 07:56:42,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:56:42,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 249 transitions, 4259 flow. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:42,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:42,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:56:42,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:47,817 INFO L130 PetriNetUnfolder]: 1493/2582 cut-off events. [2022-12-06 07:56:47,817 INFO L131 PetriNetUnfolder]: For 45238/45238 co-relation queries the response was YES. [2022-12-06 07:56:47,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21210 conditions, 2582 events. 1493/2582 cut-off events. For 45238/45238 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15144 event pairs, 226 based on Foata normal form. 1/2578 useless extension candidates. Maximal degree in co-relation 19868. Up to 2153 conditions per place. [2022-12-06 07:56:47,838 INFO L137 encePairwiseOnDemand]: 20/51 looper letters, 207 selfloop transitions, 60 changer transitions 5/272 dead transitions. [2022-12-06 07:56:47,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 272 transitions, 5082 flow [2022-12-06 07:56:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:56:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:56:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 07:56:47,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21568627450980393 [2022-12-06 07:56:47,839 INFO L175 Difference]: Start difference. First operand has 144 places, 249 transitions, 4259 flow. Second operand 6 states and 66 transitions. [2022-12-06 07:56:47,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 272 transitions, 5082 flow [2022-12-06 07:56:48,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 272 transitions, 5063 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 07:56:48,018 INFO L231 Difference]: Finished difference. Result has 149 places, 253 transitions, 4492 flow [2022-12-06 07:56:48,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4240, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4492, PETRI_PLACES=149, PETRI_TRANSITIONS=253} [2022-12-06 07:56:48,018 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 128 predicate places. [2022-12-06 07:56:48,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:48,019 INFO L89 Accepts]: Start accepts. Operand has 149 places, 253 transitions, 4492 flow [2022-12-06 07:56:48,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:48,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:48,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 253 transitions, 4492 flow [2022-12-06 07:56:48,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 253 transitions, 4492 flow [2022-12-06 07:56:48,116 INFO L130 PetriNetUnfolder]: 238/705 cut-off events. [2022-12-06 07:56:48,117 INFO L131 PetriNetUnfolder]: For 13212/13472 co-relation queries the response was YES. [2022-12-06 07:56:48,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5569 conditions, 705 events. 238/705 cut-off events. For 13212/13472 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4954 event pairs, 7 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 5142. Up to 351 conditions per place. [2022-12-06 07:56:48,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 253 transitions, 4492 flow [2022-12-06 07:56:48,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 942 [2022-12-06 07:56:48,127 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:56:48,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 07:56:48,127 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 253 transitions, 4492 flow [2022-12-06 07:56:48,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:48,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:48,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:48,135 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-06 07:56:48,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 07:56:48,335 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:48,336 INFO L85 PathProgramCache]: Analyzing trace with hash 101167995, now seen corresponding path program 1 times [2022-12-06 07:56:48,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:48,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567644605] [2022-12-06 07:56:48,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:48,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:56,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:56,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567644605] [2022-12-06 07:56:56,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567644605] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:56:56,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479204799] [2022-12-06 07:56:56,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:56,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:56,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:56,362 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:56:56,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 07:56:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:56,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-06 07:56:56,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:56:56,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:56:56,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:56:56,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:56:56,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:56:57,190 INFO L321 Elim1Store]: treesize reduction 477, result has 9.8 percent of original size [2022-12-06 07:56:57,191 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 23 new quantified variables, introduced 66 case distinctions, treesize of input 321 treesize of output 131 [2022-12-06 07:56:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:57,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:57:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:02,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479204799] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:57:02,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:57:02,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 07:57:02,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823668516] [2022-12-06 07:57:02,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:57:02,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:57:02,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:02,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:57:02,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=127, Unknown=3, NotChecked=0, Total=182 [2022-12-06 07:57:02,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:57:02,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 253 transitions, 4492 flow. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:02,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:02,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:57:02,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:09,839 INFO L130 PetriNetUnfolder]: 1564/2708 cut-off events. [2022-12-06 07:57:09,839 INFO L131 PetriNetUnfolder]: For 49370/49370 co-relation queries the response was YES. [2022-12-06 07:57:09,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22643 conditions, 2708 events. 1564/2708 cut-off events. For 49370/49370 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 16203 event pairs, 230 based on Foata normal form. 1/2704 useless extension candidates. Maximal degree in co-relation 21190. Up to 2418 conditions per place. [2022-12-06 07:57:09,860 INFO L137 encePairwiseOnDemand]: 19/51 looper letters, 205 selfloop transitions, 76 changer transitions 2/283 dead transitions. [2022-12-06 07:57:09,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 283 transitions, 5493 flow [2022-12-06 07:57:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:57:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:57:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-06 07:57:09,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22549019607843138 [2022-12-06 07:57:09,862 INFO L175 Difference]: Start difference. First operand has 149 places, 253 transitions, 4492 flow. Second operand 6 states and 69 transitions. [2022-12-06 07:57:09,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 283 transitions, 5493 flow [2022-12-06 07:57:10,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 283 transitions, 5423 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 07:57:10,035 INFO L231 Difference]: Finished difference. Result has 152 places, 265 transitions, 4900 flow [2022-12-06 07:57:10,035 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4424, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4900, PETRI_PLACES=152, PETRI_TRANSITIONS=265} [2022-12-06 07:57:10,036 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 131 predicate places. [2022-12-06 07:57:10,036 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:10,036 INFO L89 Accepts]: Start accepts. Operand has 152 places, 265 transitions, 4900 flow [2022-12-06 07:57:10,037 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:10,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:10,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 265 transitions, 4900 flow [2022-12-06 07:57:10,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 265 transitions, 4900 flow [2022-12-06 07:57:10,141 INFO L130 PetriNetUnfolder]: 250/733 cut-off events. [2022-12-06 07:57:10,141 INFO L131 PetriNetUnfolder]: For 15133/15406 co-relation queries the response was YES. [2022-12-06 07:57:10,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6039 conditions, 733 events. 250/733 cut-off events. For 15133/15406 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5234 event pairs, 5 based on Foata normal form. 1/717 useless extension candidates. Maximal degree in co-relation 5560. Up to 370 conditions per place. [2022-12-06 07:57:10,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 265 transitions, 4900 flow [2022-12-06 07:57:10,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 996 [2022-12-06 07:57:10,150 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:57:10,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 07:57:10,151 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 265 transitions, 4900 flow [2022-12-06 07:57:10,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:10,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:10,152 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:10,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 07:57:10,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 07:57:10,357 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash -131812946, now seen corresponding path program 2 times [2022-12-06 07:57:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:10,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750825296] [2022-12-06 07:57:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:10,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:10,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750825296] [2022-12-06 07:57:10,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750825296] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:57:10,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004881148] [2022-12-06 07:57:10,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:57:10,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:57:10,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:57:10,451 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:57:10,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 07:57:10,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:57:10,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:57:10,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:57:10,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:57:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:10,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:57:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:10,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004881148] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:57:10,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:57:10,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 07:57:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623555213] [2022-12-06 07:57:10,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:57:10,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:57:10,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:10,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:57:10,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:57:10,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:57:10,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 265 transitions, 4900 flow. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:10,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:10,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:57:10,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:12,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:57:13,676 INFO L130 PetriNetUnfolder]: 1944/3380 cut-off events. [2022-12-06 07:57:13,677 INFO L131 PetriNetUnfolder]: For 69350/69350 co-relation queries the response was YES. [2022-12-06 07:57:13,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28880 conditions, 3380 events. 1944/3380 cut-off events. For 69350/69350 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21119 event pairs, 167 based on Foata normal form. 164/3539 useless extension candidates. Maximal degree in co-relation 27258. Up to 1485 conditions per place. [2022-12-06 07:57:13,703 INFO L137 encePairwiseOnDemand]: 13/51 looper letters, 241 selfloop transitions, 238 changer transitions 52/531 dead transitions. [2022-12-06 07:57:13,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 531 transitions, 10053 flow [2022-12-06 07:57:13,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 07:57:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 07:57:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 195 transitions. [2022-12-06 07:57:13,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13655462184873948 [2022-12-06 07:57:13,705 INFO L175 Difference]: Start difference. First operand has 152 places, 265 transitions, 4900 flow. Second operand 28 states and 195 transitions. [2022-12-06 07:57:13,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 531 transitions, 10053 flow [2022-12-06 07:57:13,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 531 transitions, 9909 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-06 07:57:13,906 INFO L231 Difference]: Finished difference. Result has 187 places, 351 transitions, 7264 flow [2022-12-06 07:57:13,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4817, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=7264, PETRI_PLACES=187, PETRI_TRANSITIONS=351} [2022-12-06 07:57:13,907 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2022-12-06 07:57:13,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:13,907 INFO L89 Accepts]: Start accepts. Operand has 187 places, 351 transitions, 7264 flow [2022-12-06 07:57:13,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:13,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:13,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 351 transitions, 7264 flow [2022-12-06 07:57:13,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 351 transitions, 7264 flow [2022-12-06 07:57:14,060 INFO L130 PetriNetUnfolder]: 340/957 cut-off events. [2022-12-06 07:57:14,061 INFO L131 PetriNetUnfolder]: For 32263/32899 co-relation queries the response was YES. [2022-12-06 07:57:14,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9536 conditions, 957 events. 340/957 cut-off events. For 32263/32899 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6902 event pairs, 10 based on Foata normal form. 0/946 useless extension candidates. Maximal degree in co-relation 9166. Up to 515 conditions per place. [2022-12-06 07:57:14,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 351 transitions, 7264 flow [2022-12-06 07:57:14,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 1146 [2022-12-06 07:57:18,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:57:18,201 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:57:18,202 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4295 [2022-12-06 07:57:18,202 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 350 transitions, 7271 flow [2022-12-06 07:57:18,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:18,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:18,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:18,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 07:57:18,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:57:18,407 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:18,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:18,407 INFO L85 PathProgramCache]: Analyzing trace with hash -80322943, now seen corresponding path program 1 times [2022-12-06 07:57:18,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:18,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244231934] [2022-12-06 07:57:18,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:18,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:18,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244231934] [2022-12-06 07:57:18,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244231934] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:57:18,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964420861] [2022-12-06 07:57:18,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:18,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:57:18,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:57:18,481 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:57:18,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 07:57:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:18,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:57:18,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:57:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:18,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:57:18,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-06 07:57:18,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964420861] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:57:18,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:57:18,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 07:57:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954399879] [2022-12-06 07:57:18,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:57:18,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:57:18,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:18,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:57:18,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:57:18,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:57:18,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 350 transitions, 7271 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-06 07:57:18,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:18,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:57:18,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:20,244 INFO L130 PetriNetUnfolder]: 2375/4098 cut-off events. [2022-12-06 07:57:20,244 INFO L131 PetriNetUnfolder]: For 141017/141017 co-relation queries the response was YES. [2022-12-06 07:57:20,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43826 conditions, 4098 events. 2375/4098 cut-off events. For 141017/141017 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 25758 event pairs, 602 based on Foata normal form. 2/4097 useless extension candidates. Maximal degree in co-relation 42326. Up to 2620 conditions per place. [2022-12-06 07:57:20,283 INFO L137 encePairwiseOnDemand]: 29/53 looper letters, 286 selfloop transitions, 182 changer transitions 1/469 dead transitions. [2022-12-06 07:57:20,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 469 transitions, 10404 flow [2022-12-06 07:57:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:57:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:57:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 07:57:20,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23180592991913745 [2022-12-06 07:57:20,284 INFO L175 Difference]: Start difference. First operand has 184 places, 350 transitions, 7271 flow. Second operand 7 states and 86 transitions. [2022-12-06 07:57:20,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 469 transitions, 10404 flow [2022-12-06 07:57:20,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 469 transitions, 9226 flow, removed 536 selfloop flow, removed 7 redundant places. [2022-12-06 07:57:20,686 INFO L231 Difference]: Finished difference. Result has 185 places, 434 transitions, 8478 flow [2022-12-06 07:57:20,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=6217, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8478, PETRI_PLACES=185, PETRI_TRANSITIONS=434} [2022-12-06 07:57:20,686 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2022-12-06 07:57:20,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:20,686 INFO L89 Accepts]: Start accepts. Operand has 185 places, 434 transitions, 8478 flow [2022-12-06 07:57:20,688 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:20,688 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:20,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 434 transitions, 8478 flow [2022-12-06 07:57:20,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 434 transitions, 8478 flow [2022-12-06 07:57:20,913 INFO L130 PetriNetUnfolder]: 422/1175 cut-off events. [2022-12-06 07:57:20,913 INFO L131 PetriNetUnfolder]: For 48071/49192 co-relation queries the response was YES. [2022-12-06 07:57:20,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12231 conditions, 1175 events. 422/1175 cut-off events. For 48071/49192 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8739 event pairs, 10 based on Foata normal form. 0/1160 useless extension candidates. Maximal degree in co-relation 11355. Up to 588 conditions per place. [2022-12-06 07:57:20,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 434 transitions, 8478 flow [2022-12-06 07:57:20,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 1474 [2022-12-06 07:57:21,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:57:21,486 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:57:21,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 802 [2022-12-06 07:57:21,488 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 434 transitions, 8496 flow [2022-12-06 07:57:21,489 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-06 07:57:21,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:21,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:21,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-06 07:57:21,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:57:21,694 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:21,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:21,695 INFO L85 PathProgramCache]: Analyzing trace with hash -650431766, now seen corresponding path program 1 times [2022-12-06 07:57:21,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:21,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019196748] [2022-12-06 07:57:21,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:21,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:21,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:21,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019196748] [2022-12-06 07:57:21,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019196748] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:57:21,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67442623] [2022-12-06 07:57:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:21,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:57:21,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:57:21,860 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:57:21,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 07:57:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:22,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 88 conjunts are in the unsatisfiable core [2022-12-06 07:57:22,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:57:22,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:57:22,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:57:22,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:57:22,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:57:24,466 INFO L321 Elim1Store]: treesize reduction 1496, result has 4.0 percent of original size [2022-12-06 07:57:24,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 38 new quantified variables, introduced 190 case distinctions, treesize of input 328 treesize of output 192 [2022-12-06 07:57:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:24,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:57:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:34,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67442623] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:57:34,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:57:34,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 07:57:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12621144] [2022-12-06 07:57:34,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:57:34,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:57:34,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:34,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:57:34,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=168, Unknown=2, NotChecked=0, Total=210 [2022-12-06 07:57:34,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:57:34,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 434 transitions, 8496 flow. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:34,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:34,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:57:34,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:14,380 INFO L130 PetriNetUnfolder]: 2633/4564 cut-off events. [2022-12-06 07:58:14,390 INFO L131 PetriNetUnfolder]: For 162266/162266 co-relation queries the response was YES. [2022-12-06 07:58:14,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48279 conditions, 4564 events. 2633/4564 cut-off events. For 162266/162266 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 29143 event pairs, 258 based on Foata normal form. 13/4574 useless extension candidates. Maximal degree in co-relation 45505. Up to 1927 conditions per place. [2022-12-06 07:58:14,431 INFO L137 encePairwiseOnDemand]: 19/55 looper letters, 222 selfloop transitions, 290 changer transitions 34/546 dead transitions. [2022-12-06 07:58:14,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 546 transitions, 11565 flow [2022-12-06 07:58:14,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:58:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:58:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 138 transitions. [2022-12-06 07:58:14,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14759358288770053 [2022-12-06 07:58:14,441 INFO L175 Difference]: Start difference. First operand has 185 places, 434 transitions, 8496 flow. Second operand 17 states and 138 transitions. [2022-12-06 07:58:14,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 546 transitions, 11565 flow [2022-12-06 07:58:14,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 546 transitions, 11413 flow, removed 74 selfloop flow, removed 1 redundant places. [2022-12-06 07:58:14,803 INFO L231 Difference]: Finished difference. Result has 203 places, 458 transitions, 9831 flow [2022-12-06 07:58:14,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=8362, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9831, PETRI_PLACES=203, PETRI_TRANSITIONS=458} [2022-12-06 07:58:14,805 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 182 predicate places. [2022-12-06 07:58:14,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:14,805 INFO L89 Accepts]: Start accepts. Operand has 203 places, 458 transitions, 9831 flow [2022-12-06 07:58:14,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:14,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:14,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 458 transitions, 9831 flow [2022-12-06 07:58:14,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 458 transitions, 9831 flow [2022-12-06 07:58:15,034 INFO L130 PetriNetUnfolder]: 454/1283 cut-off events. [2022-12-06 07:58:15,034 INFO L131 PetriNetUnfolder]: For 56011/57192 co-relation queries the response was YES. [2022-12-06 07:58:15,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14315 conditions, 1283 events. 454/1283 cut-off events. For 56011/57192 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9814 event pairs, 9 based on Foata normal form. 1/1268 useless extension candidates. Maximal degree in co-relation 13383. Up to 645 conditions per place. [2022-12-06 07:58:15,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 458 transitions, 9831 flow [2022-12-06 07:58:15,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 1566 [2022-12-06 07:58:15,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:58:15,404 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [809] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_310| v_~f~0.base_220))) (let ((.cse7 (select .cse5 (+ v_~f~0.offset_220 (* v_~x2~0_397 4))))) (let ((.cse12 (select .cse5 (+ v_~f~0.offset_220 (* v_~x1~0_430 4)))) (.cse10 (select .cse5 (+ v_~f~0.offset_220 (* .cse7 4))))) (let ((.cse20 (select .cse5 (+ v_~f~0.offset_220 (* .cse10 4)))) (.cse18 (select .cse5 (+ v_~f~0.offset_220 (* .cse12 4))))) (let ((.cse15 (select .cse5 (+ v_~f~0.offset_220 (* .cse18 4)))) (.cse9 (select .cse5 (+ v_~f~0.offset_220 (* .cse20 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_220 (* .cse9 4)))) (.cse13 (select .cse5 (+ v_~f~0.offset_220 (* 4 .cse15))))) (let ((.cse8 (select .cse5 (+ v_~f~0.offset_220 (* .cse13 4)))) (.cse1 (select .cse5 (+ v_~f~0.offset_220 (* .cse3 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_220 (* .cse1 4)))) (.cse16 (select .cse5 (+ v_~f~0.offset_220 (* 4 .cse8))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_220 (* .cse16 4)))) (.cse19 (select .cse5 (+ v_~f~0.offset_220 (* .cse4 4))))) (let ((.cse11 (select .cse5 (+ v_~f~0.offset_220 (* .cse19 4)))) (.cse0 (select .cse5 (+ v_~f~0.offset_220 (* .cse2 4))))) (let ((.cse21 (select .cse5 (+ v_~f~0.offset_220 (* .cse0 4)))) (.cse14 (select .cse5 (+ v_~f~0.offset_220 (* .cse11 4))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_220 (* .cse14 4)))) (.cse17 (select .cse5 (+ v_~f~0.offset_220 (* .cse21 4))))) (and (not (= (ite (and (< v_~x2~0_397 v_~size~0_226) (<= 0 v_~x2~0_397)) 1 0) 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_226) (<= 0 .cse1)) 1 0) 0)) (not (= 0 (ite (and (< .cse2 v_~size~0_226) (<= 0 .cse2)) 1 0))) (not (= (ite (and (< v_~x1~0_430 v_~size~0_226) (<= 0 v_~x1~0_430)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_226)) 1 0))) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_226)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_321| 11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|) (= (select .cse5 (+ v_~f~0.offset_220 (* .cse6 4))) v_~x2~0_395) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_226) (<= 0 .cse9)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|) (= |v_thread2Thread1of1ForFork1_~i~1#1_358| 12) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260| 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_226)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260| 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_226)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| (ite (and (< .cse6 v_~size~0_226) (<= 0 .cse6)) 1 0)) (not (= (ite (and (< .cse15 v_~size~0_226) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_226) (<= 0 .cse16)) 1 0) 0)) (= (ite (and (< .cse17 v_~size~0_226) (<= 0 .cse17)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256|) (not (= (ite (and (< .cse18 v_~size~0_226) (<= 0 .cse18)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse20) (< .cse20 v_~size~0_226)) 1 0) 0)) (not (= 0 (ite (and (< .cse21 v_~size~0_226) (<= 0 .cse21)) 1 0))) (= (select .cse5 (+ v_~f~0.offset_220 (* .cse17 4))) v_~x1~0_429) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_321| 4294967293) 4294967296) (* (mod v_~n~0_206 1073741824) 4))))))))))))))) InVars {~x2~0=v_~x2~0_397, ~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_220, #memory_int=|v_#memory_int_310|, ~n~0=v_~n~0_206, ~x1~0=v_~x1~0_430, ~f~0.offset=v_~f~0.offset_220} OutVars{~x2~0=v_~x2~0_395, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_250|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_154|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_172|, ~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_220, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_160|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_358|, ~x1~0=v_~x1~0_429, ~f~0.offset=v_~f~0.offset_220, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_154|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_152|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_321|, #memory_int=|v_#memory_int_310|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_166|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_166|, ~n~0=v_~n~0_206, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_168|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_260|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [815] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_324| v_~f~0.base_228))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_228 (* v_~x2~0_421 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_228 (* .cse3 4))))) (let ((.cse0 (* (mod v_~n~0_214 1073741824) 4)) (.cse4 (select .cse1 (+ v_~f~0.offset_228 (* 4 .cse2))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_347| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_278| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_379| 4294967296) .cse0) (= v_~x1~0_454 (select .cse1 (+ v_~f~0.offset_228 (* v_~x1~0_455 4)))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_234)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_421 v_~size~0_234) (<= 0 v_~x2~0_421)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_379| 4) |v_thread2Thread1of1ForFork1_~i~1#1_378|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_274| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_278|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_274| (ite (and (< v_~x1~0_455 v_~size~0_234) (<= 0 v_~x1~0_455)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278|) (not (= (ite (and (< .cse3 v_~size~0_234) (<= 0 .cse3)) 1 0) 0)) (= v_~x2~0_420 (select .cse1 (+ v_~f~0.offset_228 (* .cse4 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_346| (+ |v_thread1Thread1of1ForFork0_~i~0#1_347| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238| (ite (and (< .cse4 v_~size~0_234) (<= 0 .cse4)) 1 0))))))) InVars {~x2~0=v_~x2~0_421, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_228, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_347|, #memory_int=|v_#memory_int_324|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_379|, ~n~0=v_~n~0_214, ~x1~0=v_~x1~0_455, ~f~0.offset=v_~f~0.offset_228} OutVars{~x2~0=v_~x2~0_420, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_268|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_172|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_190|, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_228, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_178|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_378|, ~x1~0=v_~x1~0_454, ~f~0.offset=v_~f~0.offset_228, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_274|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_172|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_170|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_346|, #memory_int=|v_#memory_int_324|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_184|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_278|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_184|, ~n~0=v_~n~0_214, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_186|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_278|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:19,691 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:58:19,692 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4887 [2022-12-06 07:58:19,692 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 458 transitions, 9856 flow [2022-12-06 07:58:19,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:19,692 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:19,692 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:19,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 07:58:19,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:19,898 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1416216302, now seen corresponding path program 1 times [2022-12-06 07:58:19,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:19,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930349424] [2022-12-06 07:58:19,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:19,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:19,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:19,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930349424] [2022-12-06 07:58:19,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930349424] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:19,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590507782] [2022-12-06 07:58:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:19,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:19,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:19,992 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:19,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 07:58:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:20,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:58:20,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:58:20,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:58:20,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590507782] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:20,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:20,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-12-06 07:58:20,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763379345] [2022-12-06 07:58:20,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:20,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:58:20,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:20,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:58:20,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:58:20,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 07:58:20,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 458 transitions, 9856 flow. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:20,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:20,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 07:58:20,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:21,515 INFO L130 PetriNetUnfolder]: 2548/4406 cut-off events. [2022-12-06 07:58:21,516 INFO L131 PetriNetUnfolder]: For 176371/176371 co-relation queries the response was YES. [2022-12-06 07:58:21,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49284 conditions, 4406 events. 2548/4406 cut-off events. For 176371/176371 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 27617 event pairs, 1175 based on Foata normal form. 30/4433 useless extension candidates. Maximal degree in co-relation 46219. Up to 4085 conditions per place. [2022-12-06 07:58:21,565 INFO L137 encePairwiseOnDemand]: 36/57 looper letters, 393 selfloop transitions, 105 changer transitions 1/499 dead transitions. [2022-12-06 07:58:21,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 499 transitions, 11390 flow [2022-12-06 07:58:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:58:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:58:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-12-06 07:58:21,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13630229419703105 [2022-12-06 07:58:21,566 INFO L175 Difference]: Start difference. First operand has 199 places, 458 transitions, 9856 flow. Second operand 13 states and 101 transitions. [2022-12-06 07:58:21,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 499 transitions, 11390 flow [2022-12-06 07:58:22,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 499 transitions, 11081 flow, removed 87 selfloop flow, removed 7 redundant places. [2022-12-06 07:58:22,149 INFO L231 Difference]: Finished difference. Result has 207 places, 461 transitions, 9962 flow [2022-12-06 07:58:22,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=9569, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9962, PETRI_PLACES=207, PETRI_TRANSITIONS=461} [2022-12-06 07:58:22,150 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 186 predicate places. [2022-12-06 07:58:22,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:22,150 INFO L89 Accepts]: Start accepts. Operand has 207 places, 461 transitions, 9962 flow [2022-12-06 07:58:22,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:22,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:22,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 461 transitions, 9962 flow [2022-12-06 07:58:22,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 461 transitions, 9962 flow [2022-12-06 07:58:22,362 INFO L130 PetriNetUnfolder]: 449/1272 cut-off events. [2022-12-06 07:58:22,362 INFO L131 PetriNetUnfolder]: For 54573/55705 co-relation queries the response was YES. [2022-12-06 07:58:22,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14330 conditions, 1272 events. 449/1272 cut-off events. For 54573/55705 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9699 event pairs, 9 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 13345. Up to 645 conditions per place. [2022-12-06 07:58:22,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 461 transitions, 9962 flow [2022-12-06 07:58:22,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 1578 [2022-12-06 07:58:22,511 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:58:24,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_287| v_~f~0.base_200))) (let ((.cse4 (select .cse10 (+ v_~f~0.offset_200 (* v_~x1~0_372 4)))) (.cse0 (select .cse10 (+ v_~f~0.offset_200 (* v_~x2~0_353 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse0)))) (.cse9 (select .cse10 (+ v_~f~0.offset_200 (* .cse4 4))))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse9)))) (.cse5 (select .cse10 (+ v_~f~0.offset_200 (* .cse6 4))))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse5)))) (.cse12 (select .cse10 (+ v_~f~0.offset_200 (* .cse13 4))))) (let ((.cse8 (select .cse10 (+ v_~f~0.offset_200 (* .cse12 4)))) (.cse14 (select .cse10 (+ v_~f~0.offset_200 (* .cse2 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_200 (* .cse14 4)))) (.cse3 (select .cse10 (+ v_~f~0.offset_200 (* .cse8 4))))) (let ((.cse7 (select .cse10 (+ v_~f~0.offset_200 (* .cse3 4)))) (.cse11 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse1))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_285| 8) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_206)) 1 0) 0)) (not (= 0 (ite (and (< v_~x1~0_372 v_~size~0_206) (<= 0 v_~x1~0_372)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (not (= (ite (and (< .cse4 v_~size~0_206) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_324| 8) (not (= (ite (and (<= 0 v_~x2~0_353) (< v_~x2~0_353 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_206) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235| 0)) (not (= (ite (and (< .cse6 v_~size~0_206) (<= 0 .cse6)) 1 0) 0)) (= (ite (and (< .cse7 v_~size~0_206) (<= 0 .cse7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_206)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_285| 4294967295) 4294967296) (* (mod v_~n~0_186 1073741824) 4)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_206)) 1 0) 0)) (= v_~x1~0_371 (select .cse10 (+ v_~f~0.offset_200 (* .cse7 4)))) (= v_~x2~0_351 (select .cse10 (+ v_~f~0.offset_200 (* .cse11 4)))) (not (= (ite (and (< .cse12 v_~size~0_206) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_206) (<= 0 .cse14)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| (ite (and (< .cse11 v_~size~0_206) (<= 0 .cse11)) 1 0))))))))))) InVars {~x2~0=v_~x2~0_353, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, #memory_int=|v_#memory_int_287|, ~n~0=v_~n~0_186, ~x1~0=v_~x1~0_372, ~f~0.offset=v_~f~0.offset_200} OutVars{~x2~0=v_~x2~0_351, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_214|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_129|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_147|, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, 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_195|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_324|, ~x1~0=v_~x1~0_371, ~f~0.offset=v_~f~0.offset_200, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_129|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_127|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_285|, #memory_int=|v_#memory_int_287|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_141|, ~n~0=v_~n~0_186, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_143|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_224|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:25,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_287| v_~f~0.base_200))) (let ((.cse4 (select .cse10 (+ v_~f~0.offset_200 (* v_~x1~0_372 4)))) (.cse0 (select .cse10 (+ v_~f~0.offset_200 (* v_~x2~0_353 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse0)))) (.cse9 (select .cse10 (+ v_~f~0.offset_200 (* .cse4 4))))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse9)))) (.cse5 (select .cse10 (+ v_~f~0.offset_200 (* .cse6 4))))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse5)))) (.cse12 (select .cse10 (+ v_~f~0.offset_200 (* .cse13 4))))) (let ((.cse8 (select .cse10 (+ v_~f~0.offset_200 (* .cse12 4)))) (.cse14 (select .cse10 (+ v_~f~0.offset_200 (* .cse2 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_200 (* .cse14 4)))) (.cse3 (select .cse10 (+ v_~f~0.offset_200 (* .cse8 4))))) (let ((.cse7 (select .cse10 (+ v_~f~0.offset_200 (* .cse3 4)))) (.cse11 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse1))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_285| 8) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_206)) 1 0) 0)) (not (= 0 (ite (and (< v_~x1~0_372 v_~size~0_206) (<= 0 v_~x1~0_372)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (not (= (ite (and (< .cse4 v_~size~0_206) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_324| 8) (not (= (ite (and (<= 0 v_~x2~0_353) (< v_~x2~0_353 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_206) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235| 0)) (not (= (ite (and (< .cse6 v_~size~0_206) (<= 0 .cse6)) 1 0) 0)) (= (ite (and (< .cse7 v_~size~0_206) (<= 0 .cse7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_206)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_285| 4294967295) 4294967296) (* (mod v_~n~0_186 1073741824) 4)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_206)) 1 0) 0)) (= v_~x1~0_371 (select .cse10 (+ v_~f~0.offset_200 (* .cse7 4)))) (= v_~x2~0_351 (select .cse10 (+ v_~f~0.offset_200 (* .cse11 4)))) (not (= (ite (and (< .cse12 v_~size~0_206) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_206) (<= 0 .cse14)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| (ite (and (< .cse11 v_~size~0_206) (<= 0 .cse11)) 1 0))))))))))) InVars {~x2~0=v_~x2~0_353, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, #memory_int=|v_#memory_int_287|, ~n~0=v_~n~0_186, ~x1~0=v_~x1~0_372, ~f~0.offset=v_~f~0.offset_200} OutVars{~x2~0=v_~x2~0_351, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_214|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_129|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_147|, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, 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_195|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_324|, ~x1~0=v_~x1~0_371, ~f~0.offset=v_~f~0.offset_200, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_129|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_127|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_285|, #memory_int=|v_#memory_int_287|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_141|, ~n~0=v_~n~0_186, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_143|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_224|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [824] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_337| v_~f~0.base_238))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_238 (* v_~x1~0_490 4)))) (.cse1 (* (mod v_~n~0_224 1073741824) 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297| (ite (and (< .cse0 v_~size~0_244) (<= 0 .cse0)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_379| 1) 4294967296) .cse1) (= |v_thread1Thread1of1ForFork0_~i~0#1_377| (+ |v_thread1Thread1of1ForFork0_~i~0#1_379| 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301|) (= (select .cse2 (+ v_~f~0.offset_238 (* .cse0 4))) v_~x1~0_488) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_379| 4294967296) .cse1) (not (= (ite (and (< v_~x1~0_490 v_~size~0_244) (<= 0 v_~x1~0_490)) 1 0) 0))))) InVars {~size~0=v_~size~0_244, ~f~0.base=v_~f~0.base_238, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_379|, #memory_int=|v_#memory_int_337|, ~n~0=v_~n~0_224, ~x1~0=v_~x1~0_490, ~f~0.offset=v_~f~0.offset_238} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_291|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297|, ~size~0=v_~size~0_244, ~f~0.base=v_~f~0.base_238, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_377|, #memory_int=|v_#memory_int_337|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301|, ~n~0=v_~n~0_224, ~x1~0=v_~x1~0_488, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_301|, ~f~0.offset=v_~f~0.offset_238} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:27,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_287| v_~f~0.base_200))) (let ((.cse4 (select .cse10 (+ v_~f~0.offset_200 (* v_~x1~0_372 4)))) (.cse0 (select .cse10 (+ v_~f~0.offset_200 (* v_~x2~0_353 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse0)))) (.cse9 (select .cse10 (+ v_~f~0.offset_200 (* .cse4 4))))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse9)))) (.cse5 (select .cse10 (+ v_~f~0.offset_200 (* .cse6 4))))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse5)))) (.cse12 (select .cse10 (+ v_~f~0.offset_200 (* .cse13 4))))) (let ((.cse8 (select .cse10 (+ v_~f~0.offset_200 (* .cse12 4)))) (.cse14 (select .cse10 (+ v_~f~0.offset_200 (* .cse2 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_200 (* .cse14 4)))) (.cse3 (select .cse10 (+ v_~f~0.offset_200 (* .cse8 4))))) (let ((.cse7 (select .cse10 (+ v_~f~0.offset_200 (* .cse3 4)))) (.cse11 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse1))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_285| 8) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_206)) 1 0) 0)) (not (= 0 (ite (and (< v_~x1~0_372 v_~size~0_206) (<= 0 v_~x1~0_372)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (not (= (ite (and (< .cse4 v_~size~0_206) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_324| 8) (not (= (ite (and (<= 0 v_~x2~0_353) (< v_~x2~0_353 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_206) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235| 0)) (not (= (ite (and (< .cse6 v_~size~0_206) (<= 0 .cse6)) 1 0) 0)) (= (ite (and (< .cse7 v_~size~0_206) (<= 0 .cse7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_206)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_285| 4294967295) 4294967296) (* (mod v_~n~0_186 1073741824) 4)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_206)) 1 0) 0)) (= v_~x1~0_371 (select .cse10 (+ v_~f~0.offset_200 (* .cse7 4)))) (= v_~x2~0_351 (select .cse10 (+ v_~f~0.offset_200 (* .cse11 4)))) (not (= (ite (and (< .cse12 v_~size~0_206) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_206) (<= 0 .cse14)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| (ite (and (< .cse11 v_~size~0_206) (<= 0 .cse11)) 1 0))))))))))) InVars {~x2~0=v_~x2~0_353, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, #memory_int=|v_#memory_int_287|, ~n~0=v_~n~0_186, ~x1~0=v_~x1~0_372, ~f~0.offset=v_~f~0.offset_200} OutVars{~x2~0=v_~x2~0_351, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_214|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_129|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_147|, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, 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_195|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_324|, ~x1~0=v_~x1~0_371, ~f~0.offset=v_~f~0.offset_200, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_129|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_127|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_285|, #memory_int=|v_#memory_int_287|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_141|, ~n~0=v_~n~0_186, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_143|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_224|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [825] L49-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_339| v_~f~0.base_240))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_240 (* v_~x2~0_440 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_240 (* .cse2 4))))) (let ((.cse0 (* 4 (mod v_~n~0_226 1073741824))) (.cse4 (select .cse3 (+ v_~f~0.offset_240 (* .cse1 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_384| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301| (ite (and (<= 0 v_~x1~0_495) (< v_~x1~0_495 v_~size~0_246)) 1 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_384| 1) |v_thread1Thread1of1ForFork0_~i~0#1_383|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_250| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290|) (= |v_thread2Thread1of1ForFork1_~i~1#1_394| (+ |v_thread2Thread1of1ForFork1_~i~1#1_395| 4)) (not (= (ite (and (<= 0 v_~x2~0_440) (< v_~x2~0_440 v_~size~0_246)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_246)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_395| 4294967296) .cse0) (not (= (ite (and (< .cse2 v_~size~0_246) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_439 (select .cse3 (+ v_~f~0.offset_240 (* .cse4 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_250| (ite (and (< .cse4 v_~size~0_246) (<= 0 .cse4)) 1 0)) (= v_~x1~0_494 (select .cse3 (+ v_~f~0.offset_240 (* v_~x1~0_495 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305|)))))) InVars {~x2~0=v_~x2~0_440, ~size~0=v_~size~0_246, ~f~0.base=v_~f~0.base_240, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_384|, #memory_int=|v_#memory_int_339|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_395|, ~n~0=v_~n~0_226, ~x1~0=v_~x1~0_495, ~f~0.offset=v_~f~0.offset_240} OutVars{~x2~0=v_~x2~0_439, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_295|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_184|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_202|, ~size~0=v_~size~0_246, ~f~0.base=v_~f~0.base_240, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_190|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_250|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_394|, ~x1~0=v_~x1~0_494, ~f~0.offset=v_~f~0.offset_240, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_184|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_182|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, #memory_int=|v_#memory_int_339|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_196|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_196|, ~n~0=v_~n~0_226, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_198|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_305|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:28,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [784] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_277| v_~f~0.base_190))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_190 (* v_~x1~0_348 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_190 (* 4 .cse6))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_190 (* .cse9 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_190 (* .cse4 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_190 (* 4 .cse3))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_190 (* v_~x2~0_336 4)))) (.cse7 (select .cse0 (+ v_~f~0.offset_190 (* .cse5 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_190 (* .cse7 4)))) (.cse10 (select .cse0 (+ v_~f~0.offset_190 (* .cse8 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_190 (* .cse10 4)))) (.cse2 (select .cse0 (+ (* 4 .cse11) v_~f~0.offset_190)))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_306| 4) (= (select .cse0 (+ (* 4 .cse1) v_~f~0.offset_190)) v_~x2~0_335) (not (= (ite (and (< v_~x1~0_348 v_~size~0_196) (<= 0 v_~x1~0_348)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_196)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_206|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_196)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_227| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_206| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_196)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_187| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_196)) 1 0)) (not (= (ite (and (< .cse5 v_~size~0_196) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_196)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210| 0)) (not (= (ite (and (< .cse7 v_~size~0_196) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_196)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_271| 9) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_187| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_227|) (= (select .cse0 (+ v_~f~0.offset_190 (* .cse2 4))) v_~x1~0_347) (not (= 0 (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_196)) 1 0))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_271| 4294967295) 4294967296) (* (mod v_~n~0_176 1073741824) 4)) (not (= (ite (and (< .cse10 v_~size~0_196) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_196)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_336 v_~size~0_196) (<= 0 v_~x2~0_336)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_336, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_190, #memory_int=|v_#memory_int_277|, ~n~0=v_~n~0_176, ~x1~0=v_~x1~0_348, ~f~0.offset=v_~f~0.offset_190} OutVars{~x2~0=v_~x2~0_335, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_200|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_121|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_139|, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_190, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_127|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_187|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_306|, ~x1~0=v_~x1~0_347, ~f~0.offset=v_~f~0.offset_190, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_227|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_206|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_121|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_119|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_271|, #memory_int=|v_#memory_int_277|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_133|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_133|, ~n~0=v_~n~0_176, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_135|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_210|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:30,550 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:58:30,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8400 [2022-12-06 07:58:30,550 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 460 transitions, 10062 flow [2022-12-06 07:58:30,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:30,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:30,551 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:30,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 07:58:30,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:30,751 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1229519749, now seen corresponding path program 1 times [2022-12-06 07:58:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:30,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4338657] [2022-12-06 07:58:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:30,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:30,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4338657] [2022-12-06 07:58:30,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4338657] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:30,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200275394] [2022-12-06 07:58:30,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:30,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:30,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:30,940 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:30,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 07:58:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:31,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:58:31,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:31,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:31,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200275394] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:31,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:31,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-12-06 07:58:31,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592611974] [2022-12-06 07:58:31,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:31,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:58:31,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:31,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:58:31,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:58:31,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 07:58:31,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 460 transitions, 10062 flow. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:31,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:31,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 07:58:31,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:33,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:58:35,354 INFO L130 PetriNetUnfolder]: 2898/5050 cut-off events. [2022-12-06 07:58:35,355 INFO L131 PetriNetUnfolder]: For 213121/213121 co-relation queries the response was YES. [2022-12-06 07:58:35,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58456 conditions, 5050 events. 2898/5050 cut-off events. For 213121/213121 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 33271 event pairs, 631 based on Foata normal form. 84/5131 useless extension candidates. Maximal degree in co-relation 54713. Up to 2899 conditions per place. [2022-12-06 07:58:35,400 INFO L137 encePairwiseOnDemand]: 20/63 looper letters, 351 selfloop transitions, 355 changer transitions 4/710 dead transitions. [2022-12-06 07:58:35,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 710 transitions, 17627 flow [2022-12-06 07:58:35,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 07:58:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 07:58:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 133 transitions. [2022-12-06 07:58:35,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11728395061728394 [2022-12-06 07:58:35,402 INFO L175 Difference]: Start difference. First operand has 205 places, 460 transitions, 10062 flow. Second operand 18 states and 133 transitions. [2022-12-06 07:58:35,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 710 transitions, 17627 flow [2022-12-06 07:58:35,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 710 transitions, 17309 flow, removed 113 selfloop flow, removed 2 redundant places. [2022-12-06 07:58:35,952 INFO L231 Difference]: Finished difference. Result has 227 places, 620 transitions, 14896 flow [2022-12-06 07:58:35,952 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=9763, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=14896, PETRI_PLACES=227, PETRI_TRANSITIONS=620} [2022-12-06 07:58:35,953 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 206 predicate places. [2022-12-06 07:58:35,953 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:35,953 INFO L89 Accepts]: Start accepts. Operand has 227 places, 620 transitions, 14896 flow [2022-12-06 07:58:35,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:35,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:35,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 620 transitions, 14896 flow [2022-12-06 07:58:35,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 620 transitions, 14896 flow [2022-12-06 07:58:36,298 INFO L130 PetriNetUnfolder]: 702/1785 cut-off events. [2022-12-06 07:58:36,298 INFO L131 PetriNetUnfolder]: For 86812/87474 co-relation queries the response was YES. [2022-12-06 07:58:36,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22917 conditions, 1785 events. 702/1785 cut-off events. For 86812/87474 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 13790 event pairs, 24 based on Foata normal form. 5/1753 useless extension candidates. Maximal degree in co-relation 22133. Up to 988 conditions per place. [2022-12-06 07:58:36,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 620 transitions, 14896 flow [2022-12-06 07:58:36,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 1708 [2022-12-06 07:58:36,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:36,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:36,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:36,686 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:36,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:36,866 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:36,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,051 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,238 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,055 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,324 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,392 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:38,966 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,048 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,288 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,452 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,612 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,704 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,794 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:39,976 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:40,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:40,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:40,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:40,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:40,436 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:41,536 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:58:41,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5586 [2022-12-06 07:58:41,539 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 619 transitions, 16536 flow [2022-12-06 07:58:41,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:41,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:41,539 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:41,544 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-06 07:58:41,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:41,744 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:41,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash -518979359, now seen corresponding path program 1 times [2022-12-06 07:58:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:41,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25892488] [2022-12-06 07:58:41,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:58:41,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:41,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25892488] [2022-12-06 07:58:41,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25892488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:41,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242107846] [2022-12-06 07:58:41,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:41,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:41,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:41,818 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:41,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 07:58:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:42,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:58:42,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:58:42,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:58:42,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242107846] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:42,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:42,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 07:58:42,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014941929] [2022-12-06 07:58:42,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:42,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:58:42,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:42,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:58:42,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:58:42,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-06 07:58:42,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 619 transitions, 16536 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:42,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:42,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-06 07:58:42,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:43,882 INFO L130 PetriNetUnfolder]: 2807/4814 cut-off events. [2022-12-06 07:58:43,883 INFO L131 PetriNetUnfolder]: For 256425/256425 co-relation queries the response was YES. [2022-12-06 07:58:43,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61553 conditions, 4814 events. 2807/4814 cut-off events. For 256425/256425 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 30624 event pairs, 992 based on Foata normal form. 16/4827 useless extension candidates. Maximal degree in co-relation 59405. Up to 4144 conditions per place. [2022-12-06 07:58:43,932 INFO L137 encePairwiseOnDemand]: 80/110 looper letters, 549 selfloop transitions, 114 changer transitions 5/668 dead transitions. [2022-12-06 07:58:43,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 668 transitions, 18706 flow [2022-12-06 07:58:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:58:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:58:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2022-12-06 07:58:43,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2106060606060606 [2022-12-06 07:58:43,933 INFO L175 Difference]: Start difference. First operand has 223 places, 619 transitions, 16536 flow. Second operand 6 states and 139 transitions. [2022-12-06 07:58:43,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 668 transitions, 18706 flow [2022-12-06 07:58:44,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 668 transitions, 17657 flow, removed 310 selfloop flow, removed 9 redundant places. [2022-12-06 07:58:44,852 INFO L231 Difference]: Finished difference. Result has 222 places, 620 transitions, 15915 flow [2022-12-06 07:58:44,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=15513, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=15915, PETRI_PLACES=222, PETRI_TRANSITIONS=620} [2022-12-06 07:58:44,853 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 201 predicate places. [2022-12-06 07:58:44,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:44,853 INFO L89 Accepts]: Start accepts. Operand has 222 places, 620 transitions, 15915 flow [2022-12-06 07:58:44,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:44,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:44,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 620 transitions, 15915 flow [2022-12-06 07:58:44,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 620 transitions, 15915 flow [2022-12-06 07:58:45,185 INFO L130 PetriNetUnfolder]: 693/1708 cut-off events. [2022-12-06 07:58:45,185 INFO L131 PetriNetUnfolder]: For 83982/84659 co-relation queries the response was YES. [2022-12-06 07:58:45,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22271 conditions, 1708 events. 693/1708 cut-off events. For 83982/84659 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12717 event pairs, 26 based on Foata normal form. 5/1677 useless extension candidates. Maximal degree in co-relation 20844. Up to 982 conditions per place. [2022-12-06 07:58:45,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 620 transitions, 15915 flow [2022-12-06 07:58:45,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 1718 [2022-12-06 07:58:45,214 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:58:45,215 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 362 [2022-12-06 07:58:45,215 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 620 transitions, 15915 flow [2022-12-06 07:58:45,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:45,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:45,215 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:45,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 07:58:45,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-06 07:58:45,420 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1360766859, now seen corresponding path program 1 times [2022-12-06 07:58:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:45,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612715326] [2022-12-06 07:58:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:51,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:51,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612715326] [2022-12-06 07:58:51,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612715326] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:51,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695443757] [2022-12-06 07:58:51,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:51,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:51,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:51,500 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:51,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 07:58:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:51,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 103 conjunts are in the unsatisfiable core [2022-12-06 07:58:51,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:51,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:58:51,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:58:51,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:58:51,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:58:53,673 INFO L321 Elim1Store]: treesize reduction 897, result has 6.7 percent of original size [2022-12-06 07:58:53,674 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 31 new quantified variables, introduced 120 case distinctions, treesize of input 345 treesize of output 163 [2022-12-06 07:58:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:58:53,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:59:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:05,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695443757] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:59:05,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:59:05,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 18 [2022-12-06 07:59:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708934531] [2022-12-06 07:59:05,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:59:05,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:59:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:59:05,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:59:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=296, Unknown=2, NotChecked=0, Total=380 [2022-12-06 07:59:05,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-06 07:59:05,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 620 transitions, 15915 flow. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:59:05,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:59:05,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-06 07:59:05,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:59:57,063 INFO L130 PetriNetUnfolder]: 2910/4999 cut-off events. [2022-12-06 07:59:57,063 INFO L131 PetriNetUnfolder]: For 249232/249232 co-relation queries the response was YES. [2022-12-06 07:59:57,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63318 conditions, 4999 events. 2910/4999 cut-off events. For 249232/249232 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 32046 event pairs, 214 based on Foata normal form. 3/4999 useless extension candidates. Maximal degree in co-relation 59262. Up to 2451 conditions per place. [2022-12-06 07:59:57,121 INFO L137 encePairwiseOnDemand]: 32/110 looper letters, 298 selfloop transitions, 372 changer transitions 11/681 dead transitions. [2022-12-06 07:59:57,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 681 transitions, 18532 flow [2022-12-06 07:59:57,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:59:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:59:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2022-12-06 07:59:57,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16363636363636364 [2022-12-06 07:59:57,123 INFO L175 Difference]: Start difference. First operand has 222 places, 620 transitions, 15915 flow. Second operand 8 states and 144 transitions. [2022-12-06 07:59:57,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 681 transitions, 18532 flow [2022-12-06 07:59:57,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 681 transitions, 18363 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-06 07:59:57,890 INFO L231 Difference]: Finished difference. Result has 230 places, 634 transitions, 17657 flow [2022-12-06 07:59:57,891 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=15746, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17657, PETRI_PLACES=230, PETRI_TRANSITIONS=634} [2022-12-06 07:59:57,891 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 209 predicate places. [2022-12-06 07:59:57,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:59:57,891 INFO L89 Accepts]: Start accepts. Operand has 230 places, 634 transitions, 17657 flow [2022-12-06 07:59:57,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:59:57,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:59:57,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 634 transitions, 17657 flow [2022-12-06 07:59:57,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 634 transitions, 17657 flow [2022-12-06 07:59:58,316 INFO L130 PetriNetUnfolder]: 719/1785 cut-off events. [2022-12-06 07:59:58,317 INFO L131 PetriNetUnfolder]: For 94903/95551 co-relation queries the response was YES. [2022-12-06 07:59:58,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24273 conditions, 1785 events. 719/1785 cut-off events. For 94903/95551 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13532 event pairs, 28 based on Foata normal form. 4/1754 useless extension candidates. Maximal degree in co-relation 22734. Up to 1019 conditions per place. [2022-12-06 07:59:58,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 634 transitions, 17657 flow [2022-12-06 07:59:58,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 1756 [2022-12-06 07:59:58,365 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [737] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_211| v_~f~0.base_130))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_130 (* v_~x2~0_240 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_130 (* 4 .cse4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_130 (* .cse1 4)))) (.cse3 (* (mod v_~n~0_114 1073741824) 4))) (and (= (ite (and (< v_~x1~0_170 v_~size~0_136) (<= 0 v_~x1~0_170)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_88|) (= (select .cse0 (+ v_~f~0.offset_130 (* v_~x1~0_170 4))) v_~x1~0_169) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_136)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite (and (< .cse2 v_~size~0_136) (<= 0 .cse2)) 1 0)) (= v_~x2~0_239 (select .cse0 (+ v_~f~0.offset_130 (* .cse2 4)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_207| (+ |v_thread2Thread1of1ForFork1_~i~1#1_208| 4)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_208| 4294967296) .cse3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_88|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (not (= (ite (and (<= 0 v_~x2~0_240) (< v_~x2~0_240 v_~size~0_136)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_115| 1) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_115| 4294967296) .cse3) (not (= (ite (and (< .cse4 v_~size~0_136) (<= 0 .cse4)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_240, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_130, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_115|, #memory_int=|v_#memory_int_211|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_208|, ~n~0=v_~n~0_114, ~x1~0=v_~x1~0_170, ~f~0.offset=v_~f~0.offset_130} OutVars{~x2~0=v_~x2~0_239, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_82|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_63|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_130, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_207|, ~x1~0=v_~x1~0_169, ~f~0.offset=v_~f~0.offset_130, 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_88|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_63|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, #memory_int=|v_#memory_int_211|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_75|, 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_75|, ~n~0=v_~n~0_114, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_77|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_92|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:59:59,177 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:59:59,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1286 [2022-12-06 07:59:59,177 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 634 transitions, 17683 flow [2022-12-06 07:59:59,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:59:59,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:59:59,178 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:59:59,183 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-06 07:59:59,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 07:59:59,383 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:59:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:59:59,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2041254401, now seen corresponding path program 1 times [2022-12-06 07:59:59,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:59:59,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665812996] [2022-12-06 07:59:59,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:59,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:59:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:59,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:59:59,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665812996] [2022-12-06 07:59:59,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665812996] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:59:59,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054475519] [2022-12-06 07:59:59,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:59,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:59:59,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:59:59,472 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:59:59,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 07:59:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:59,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 07:59:59,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:59:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:59,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:59:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:59,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054475519] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:59:59,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:59:59,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 07:59:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417572581] [2022-12-06 07:59:59,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:59:59,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:59:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:59:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:59:59,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:59:59,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 112 [2022-12-06 07:59:59,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 634 transitions, 17683 flow. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:59:59,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:59:59,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 112 [2022-12-06 07:59:59,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:02,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 08:00:04,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 08:00:08,158 INFO L130 PetriNetUnfolder]: 3291/5752 cut-off events. [2022-12-06 08:00:08,158 INFO L131 PetriNetUnfolder]: For 325131/325131 co-relation queries the response was YES. [2022-12-06 08:00:08,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75478 conditions, 5752 events. 3291/5752 cut-off events. For 325131/325131 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 38925 event pairs, 813 based on Foata normal form. 6/5755 useless extension candidates. Maximal degree in co-relation 71167. Up to 3592 conditions per place. [2022-12-06 08:00:08,216 INFO L137 encePairwiseOnDemand]: 78/112 looper letters, 624 selfloop transitions, 147 changer transitions 27/798 dead transitions. [2022-12-06 08:00:08,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 798 transitions, 22918 flow [2022-12-06 08:00:08,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 08:00:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 08:00:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 175 transitions. [2022-12-06 08:00:08,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11160714285714286 [2022-12-06 08:00:08,218 INFO L175 Difference]: Start difference. First operand has 230 places, 634 transitions, 17683 flow. Second operand 14 states and 175 transitions. [2022-12-06 08:00:08,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 798 transitions, 22918 flow [2022-12-06 08:00:09,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 798 transitions, 22821 flow, removed 26 selfloop flow, removed 3 redundant places. [2022-12-06 08:00:09,140 INFO L231 Difference]: Finished difference. Result has 248 places, 654 transitions, 18688 flow [2022-12-06 08:00:09,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=17586, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=18688, PETRI_PLACES=248, PETRI_TRANSITIONS=654} [2022-12-06 08:00:09,141 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 227 predicate places. [2022-12-06 08:00:09,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:09,141 INFO L89 Accepts]: Start accepts. Operand has 248 places, 654 transitions, 18688 flow [2022-12-06 08:00:09,145 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:09,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:09,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 654 transitions, 18688 flow [2022-12-06 08:00:09,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 654 transitions, 18688 flow [2022-12-06 08:00:09,591 INFO L130 PetriNetUnfolder]: 769/1976 cut-off events. [2022-12-06 08:00:09,591 INFO L131 PetriNetUnfolder]: For 115690/116382 co-relation queries the response was YES. [2022-12-06 08:00:09,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27789 conditions, 1976 events. 769/1976 cut-off events. For 115690/116382 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 15773 event pairs, 37 based on Foata normal form. 0/1939 useless extension candidates. Maximal degree in co-relation 27403. Up to 1106 conditions per place. [2022-12-06 08:00:09,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 654 transitions, 18688 flow [2022-12-06 08:00:09,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 1794 [2022-12-06 08:00:09,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:00:10,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [831] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_347| v_~f~0.base_248))) (let ((.cse15 (select .cse4 (+ v_~f~0.offset_248 (* v_~x1~0_514 4))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_248 (* .cse15 4))))) (let ((.cse16 (select .cse4 (+ v_~f~0.offset_248 (* v_~x2~0_460 4)))) (.cse13 (select .cse4 (+ v_~f~0.offset_248 (* .cse5 4))))) (let ((.cse14 (select .cse4 (+ v_~f~0.offset_248 (* .cse13 4)))) (.cse2 (select .cse4 (+ v_~f~0.offset_248 (* .cse16 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_248 (* .cse2 4)))) (.cse7 (select .cse4 (+ v_~f~0.offset_248 (* .cse14 4))))) (let ((.cse11 (select .cse4 (+ v_~f~0.offset_248 (* 4 .cse7)))) (.cse1 (select .cse4 (+ v_~f~0.offset_248 (* .cse8 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_248 (* .cse1 4)))) (.cse6 (select .cse4 (+ v_~f~0.offset_248 (* .cse11 4))))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_248 (* .cse6 4)))) (.cse12 (select .cse4 (+ v_~f~0.offset_248 (* .cse0 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_248 (* .cse12 4)))) (.cse9 (select .cse4 (+ v_~f~0.offset_248 (* .cse10 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_254) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302|) (not (= (ite (and (< .cse2 v_~size~0_254) (<= 0 .cse2)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_395| 4294967294) 4294967296) (* (mod v_~n~0_234 1073741824) 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_254)) 1 0)) (= (select .cse4 (+ v_~f~0.offset_248 (* .cse3 4))) v_~x2~0_459) (not (= (ite (and (< .cse5 v_~size~0_254) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_395| 10) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_315| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_514) (< v_~x1~0_514 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_254) (<= 0 .cse8)) 1 0) 0)) (= v_~x1~0_512 (select .cse4 (+ v_~f~0.offset_248 (* .cse9 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302| 0)) (not (= (ite (and (< .cse10 v_~size~0_254) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_254) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_254) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_254) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_254)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_408| 8) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_311| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_315|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_311| (ite (and (< .cse9 v_~size~0_254) (<= 0 .cse9)) 1 0)) (not (= (ite (and (< v_~x2~0_460 v_~size~0_254) (<= 0 v_~x2~0_460)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_254) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_254) (<= 0 .cse16)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_460, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_248, #memory_int=|v_#memory_int_347|, ~n~0=v_~n~0_234, ~x1~0=v_~x1~0_514, ~f~0.offset=v_~f~0.offset_248} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_305|, ~x2~0=v_~x2~0_459, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_196|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_214|, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_248, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_202|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_408|, ~x1~0=v_~x1~0_512, ~f~0.offset=v_~f~0.offset_248, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_311|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_196|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_194|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_395|, #memory_int=|v_#memory_int_347|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_315|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_208|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_208|, ~n~0=v_~n~0_234, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_315|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_210|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [895] L59-2-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_464| v_~f~0.base_362))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_362 (* v_~x2~0_506 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_362 (* .cse3 4))))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_362 (* .cse0 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_362 (* 4 .cse1))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_362 (* 4 .cse5))))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_362 (* .cse4 4))))) (let ((.cse2 (* (mod v_~n~0_348 1073741824) 4)) (.cse7 (select .cse6 (+ (* 4 .cse8) v_~f~0.offset_362)))) (and (not (= (ite (and (< .cse0 v_~size~0_368) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_368) (<= 0 .cse1)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_544| 4) 4294967296) .cse2) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_331| 0)) (not (= (ite (and (< v_~x2~0_506 v_~size~0_368) (<= 0 v_~x2~0_506)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_368)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_368) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_368)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_542| (+ |v_thread2Thread1of1ForFork1_~i~1#1_544| 8)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_331|) (= v_~x2~0_504 (select .cse6 (+ v_~f~0.offset_362 (* .cse7 4)))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_544| 4294967296) .cse2) (not (= (ite (and (< .cse8 v_~size~0_368) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291| (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_368)) 1 0))))))))))) InVars {~x2~0=v_~x2~0_506, ~size~0=v_~size~0_368, ~f~0.base=v_~f~0.base_362, #memory_int=|v_#memory_int_464|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_544|, ~n~0=v_~n~0_348, ~f~0.offset=v_~f~0.offset_362} OutVars{~x2~0=v_~x2~0_504, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_225|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_243|, ~size~0=v_~size~0_368, ~f~0.base=v_~f~0.base_362, 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_291|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_542|, ~f~0.offset=v_~f~0.offset_362, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_331|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_225|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_223|, #memory_int=|v_#memory_int_464|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_237|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_237|, ~n~0=v_~n~0_348, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_239|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:13,839 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [831] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_347| v_~f~0.base_248))) (let ((.cse15 (select .cse4 (+ v_~f~0.offset_248 (* v_~x1~0_514 4))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_248 (* .cse15 4))))) (let ((.cse16 (select .cse4 (+ v_~f~0.offset_248 (* v_~x2~0_460 4)))) (.cse13 (select .cse4 (+ v_~f~0.offset_248 (* .cse5 4))))) (let ((.cse14 (select .cse4 (+ v_~f~0.offset_248 (* .cse13 4)))) (.cse2 (select .cse4 (+ v_~f~0.offset_248 (* .cse16 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_248 (* .cse2 4)))) (.cse7 (select .cse4 (+ v_~f~0.offset_248 (* .cse14 4))))) (let ((.cse11 (select .cse4 (+ v_~f~0.offset_248 (* 4 .cse7)))) (.cse1 (select .cse4 (+ v_~f~0.offset_248 (* .cse8 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_248 (* .cse1 4)))) (.cse6 (select .cse4 (+ v_~f~0.offset_248 (* .cse11 4))))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_248 (* .cse6 4)))) (.cse12 (select .cse4 (+ v_~f~0.offset_248 (* .cse0 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_248 (* .cse12 4)))) (.cse9 (select .cse4 (+ v_~f~0.offset_248 (* .cse10 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_254) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302|) (not (= (ite (and (< .cse2 v_~size~0_254) (<= 0 .cse2)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_395| 4294967294) 4294967296) (* (mod v_~n~0_234 1073741824) 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_254)) 1 0)) (= (select .cse4 (+ v_~f~0.offset_248 (* .cse3 4))) v_~x2~0_459) (not (= (ite (and (< .cse5 v_~size~0_254) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_395| 10) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_315| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_514) (< v_~x1~0_514 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_254) (<= 0 .cse8)) 1 0) 0)) (= v_~x1~0_512 (select .cse4 (+ v_~f~0.offset_248 (* .cse9 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302| 0)) (not (= (ite (and (< .cse10 v_~size~0_254) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_254) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_254) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_254) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_254)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_408| 8) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_311| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_315|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_311| (ite (and (< .cse9 v_~size~0_254) (<= 0 .cse9)) 1 0)) (not (= (ite (and (< v_~x2~0_460 v_~size~0_254) (<= 0 v_~x2~0_460)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_254) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_254) (<= 0 .cse16)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_460, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_248, #memory_int=|v_#memory_int_347|, ~n~0=v_~n~0_234, ~x1~0=v_~x1~0_514, ~f~0.offset=v_~f~0.offset_248} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_305|, ~x2~0=v_~x2~0_459, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_196|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_214|, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_248, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_202|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_408|, ~x1~0=v_~x1~0_512, ~f~0.offset=v_~f~0.offset_248, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_311|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_196|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_194|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_395|, #memory_int=|v_#memory_int_347|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_315|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_208|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_208|, ~n~0=v_~n~0_234, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_315|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_210|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:15,178 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [831] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_347| v_~f~0.base_248))) (let ((.cse15 (select .cse4 (+ v_~f~0.offset_248 (* v_~x1~0_514 4))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_248 (* .cse15 4))))) (let ((.cse16 (select .cse4 (+ v_~f~0.offset_248 (* v_~x2~0_460 4)))) (.cse13 (select .cse4 (+ v_~f~0.offset_248 (* .cse5 4))))) (let ((.cse14 (select .cse4 (+ v_~f~0.offset_248 (* .cse13 4)))) (.cse2 (select .cse4 (+ v_~f~0.offset_248 (* .cse16 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_248 (* .cse2 4)))) (.cse7 (select .cse4 (+ v_~f~0.offset_248 (* .cse14 4))))) (let ((.cse11 (select .cse4 (+ v_~f~0.offset_248 (* 4 .cse7)))) (.cse1 (select .cse4 (+ v_~f~0.offset_248 (* .cse8 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_248 (* .cse1 4)))) (.cse6 (select .cse4 (+ v_~f~0.offset_248 (* .cse11 4))))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_248 (* .cse6 4)))) (.cse12 (select .cse4 (+ v_~f~0.offset_248 (* .cse0 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_248 (* .cse12 4)))) (.cse9 (select .cse4 (+ v_~f~0.offset_248 (* .cse10 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_254) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302|) (not (= (ite (and (< .cse2 v_~size~0_254) (<= 0 .cse2)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_395| 4294967294) 4294967296) (* (mod v_~n~0_234 1073741824) 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_254)) 1 0)) (= (select .cse4 (+ v_~f~0.offset_248 (* .cse3 4))) v_~x2~0_459) (not (= (ite (and (< .cse5 v_~size~0_254) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_395| 10) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_315| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_514) (< v_~x1~0_514 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_254) (<= 0 .cse8)) 1 0) 0)) (= v_~x1~0_512 (select .cse4 (+ v_~f~0.offset_248 (* .cse9 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302| 0)) (not (= (ite (and (< .cse10 v_~size~0_254) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_254) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_254) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_254) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_254)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_408| 8) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_311| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_315|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_311| (ite (and (< .cse9 v_~size~0_254) (<= 0 .cse9)) 1 0)) (not (= (ite (and (< v_~x2~0_460 v_~size~0_254) (<= 0 v_~x2~0_460)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_254) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_254) (<= 0 .cse16)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_460, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_248, #memory_int=|v_#memory_int_347|, ~n~0=v_~n~0_234, ~x1~0=v_~x1~0_514, ~f~0.offset=v_~f~0.offset_248} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_305|, ~x2~0=v_~x2~0_459, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_196|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_214|, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_248, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_202|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_408|, ~x1~0=v_~x1~0_512, ~f~0.offset=v_~f~0.offset_248, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_311|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_196|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_194|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_395|, #memory_int=|v_#memory_int_347|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_315|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_208|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_208|, ~n~0=v_~n~0_234, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_315|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_210|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [893] L59-2-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_462| v_~f~0.base_360))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_360 (* v_~x2~0_501 4))))) (let ((.cse1 (select .cse3 (+ (* .cse2 4) v_~f~0.offset_360)))) (let ((.cse0 (* (mod v_~n~0_346 1073741824) 4)) (.cse4 (select .cse3 (+ v_~f~0.offset_360 (* .cse1 4))))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_539| 4294967296) .cse0) (not (= (ite (and (< .cse1 v_~size~0_366) (<= 0 .cse1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_451| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_455|) (= |v_thread1Thread1of1ForFork0_~i~0#1_641| (+ |v_thread1Thread1of1ForFork0_~i~0#1_642| 1)) (= (ite (and (<= 0 v_~x1~0_769) (< v_~x1~0_769 v_~size~0_366)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_451|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_366)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_455| 0)) (not (= (ite (and (<= 0 v_~x2~0_501) (< v_~x2~0_501 v_~size~0_366)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_642| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_289| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_329|) (= (select .cse3 (+ v_~f~0.offset_360 (* .cse4 4))) v_~x2~0_500) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_289| (ite (and (< .cse4 v_~size~0_366) (<= 0 .cse4)) 1 0)) (= (select .cse3 (+ v_~f~0.offset_360 (* v_~x1~0_769 4))) v_~x1~0_768) (= |v_thread2Thread1of1ForFork1_~i~1#1_538| (+ |v_thread2Thread1of1ForFork1_~i~1#1_539| 4)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_329| 0))))))) InVars {~x2~0=v_~x2~0_501, ~size~0=v_~size~0_366, ~f~0.base=v_~f~0.base_360, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_642|, #memory_int=|v_#memory_int_462|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_539|, ~n~0=v_~n~0_346, ~x1~0=v_~x1~0_769, ~f~0.offset=v_~f~0.offset_360} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_445|, ~x2~0=v_~x2~0_500, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_223|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_241|, ~size~0=v_~size~0_366, ~f~0.base=v_~f~0.base_360, 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_289|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_538|, ~x1~0=v_~x1~0_768, ~f~0.offset=v_~f~0.offset_360, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_329|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_451|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_223|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_221|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_641|, #memory_int=|v_#memory_int_462|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_455|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_235|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_235|, ~n~0=v_~n~0_346, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_455|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_237|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:17,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L49-2-->thread2EXIT: Formula: (let ((.cse0 (* (mod v_~n~0_132 1073741824) 4))) (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_167| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_33| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_231| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_33| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_31|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_31| 0))) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_167|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_231|, ~n~0=v_~n~0_132} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_31|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_33|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_31|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_167|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_231|, ~n~0=v_~n~0_132, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:17,304 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 08:00:17,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8165 [2022-12-06 08:00:17,306 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 654 transitions, 18817 flow [2022-12-06 08:00:17,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:17,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:17,306 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:17,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 08:00:17,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-06 08:00:17,515 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1865857616, now seen corresponding path program 1 times [2022-12-06 08:00:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:17,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143019946] [2022-12-06 08:00:17,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:17,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143019946] [2022-12-06 08:00:17,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143019946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:00:17,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262336444] [2022-12-06 08:00:17,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:17,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:17,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:00:17,631 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:00:17,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 08:00:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:18,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 08:00:18,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:00:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:18,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:00:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:18,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262336444] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:00:18,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:00:18,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 08:00:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206803119] [2022-12-06 08:00:18,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:00:18,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 08:00:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:18,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 08:00:18,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-06 08:00:18,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 116 [2022-12-06 08:00:18,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 654 transitions, 18817 flow. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:18,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:18,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 116 [2022-12-06 08:00:18,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:21,428 INFO L130 PetriNetUnfolder]: 3311/5823 cut-off events. [2022-12-06 08:00:21,428 INFO L131 PetriNetUnfolder]: For 358902/358902 co-relation queries the response was YES. [2022-12-06 08:00:21,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79611 conditions, 5823 events. 3311/5823 cut-off events. For 358902/358902 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 39938 event pairs, 879 based on Foata normal form. 4/5824 useless extension candidates. Maximal degree in co-relation 78529. Up to 3732 conditions per place. [2022-12-06 08:00:21,558 INFO L137 encePairwiseOnDemand]: 78/116 looper letters, 559 selfloop transitions, 162 changer transitions 40/761 dead transitions. [2022-12-06 08:00:21,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 761 transitions, 22962 flow [2022-12-06 08:00:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 08:00:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 08:00:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 172 transitions. [2022-12-06 08:00:21,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09885057471264368 [2022-12-06 08:00:21,561 INFO L175 Difference]: Start difference. First operand has 244 places, 654 transitions, 18817 flow. Second operand 15 states and 172 transitions. [2022-12-06 08:00:21,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 761 transitions, 22962 flow [2022-12-06 08:00:22,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 761 transitions, 22629 flow, removed 161 selfloop flow, removed 6 redundant places. [2022-12-06 08:00:22,656 INFO L231 Difference]: Finished difference. Result has 263 places, 674 transitions, 19877 flow [2022-12-06 08:00:22,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=18507, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=19877, PETRI_PLACES=263, PETRI_TRANSITIONS=674} [2022-12-06 08:00:22,657 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 242 predicate places. [2022-12-06 08:00:22,657 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:22,657 INFO L89 Accepts]: Start accepts. Operand has 263 places, 674 transitions, 19877 flow [2022-12-06 08:00:22,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:22,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:22,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 674 transitions, 19877 flow [2022-12-06 08:00:22,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 674 transitions, 19877 flow [2022-12-06 08:00:23,254 INFO L130 PetriNetUnfolder]: 804/2091 cut-off events. [2022-12-06 08:00:23,254 INFO L131 PetriNetUnfolder]: For 126619/127464 co-relation queries the response was YES. [2022-12-06 08:00:23,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29905 conditions, 2091 events. 804/2091 cut-off events. For 126619/127464 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 17116 event pairs, 38 based on Foata normal form. 0/2051 useless extension candidates. Maximal degree in co-relation 29772. Up to 1163 conditions per place. [2022-12-06 08:00:23,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 257 places, 674 transitions, 19877 flow [2022-12-06 08:00:23,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 1828 [2022-12-06 08:00:25,544 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:26,817 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 08:00:26,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4160 [2022-12-06 08:00:26,817 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 674 transitions, 19950 flow [2022-12-06 08:00:26,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:26,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:26,818 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:26,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 08:00:27,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:27,023 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:27,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1766159372, now seen corresponding path program 1 times [2022-12-06 08:00:27,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:27,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612178260] [2022-12-06 08:00:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:27,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:27,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:27,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612178260] [2022-12-06 08:00:27,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612178260] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:00:27,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906941342] [2022-12-06 08:00:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:27,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:27,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:00:27,106 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:00:27,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 08:00:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:27,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 08:00:27,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:00:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:27,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:00:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:27,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906941342] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:00:27,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:00:27,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 08:00:27,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678911179] [2022-12-06 08:00:27,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:00:27,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 08:00:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:27,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 08:00:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 08:00:27,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 117 [2022-12-06 08:00:27,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 674 transitions, 19950 flow. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:27,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:27,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 117 [2022-12-06 08:00:27,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:30,118 INFO L130 PetriNetUnfolder]: 3421/6143 cut-off events. [2022-12-06 08:00:30,119 INFO L131 PetriNetUnfolder]: For 375355/375355 co-relation queries the response was YES. [2022-12-06 08:00:30,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84652 conditions, 6143 events. 3421/6143 cut-off events. For 375355/375355 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 43312 event pairs, 957 based on Foata normal form. 6/6146 useless extension candidates. Maximal degree in co-relation 84472. Up to 4004 conditions per place. [2022-12-06 08:00:30,190 INFO L137 encePairwiseOnDemand]: 91/117 looper letters, 594 selfloop transitions, 137 changer transitions 29/760 dead transitions. [2022-12-06 08:00:30,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 760 transitions, 23434 flow [2022-12-06 08:00:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 08:00:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 08:00:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2022-12-06 08:00:30,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12975912975912976 [2022-12-06 08:00:30,191 INFO L175 Difference]: Start difference. First operand has 257 places, 674 transitions, 19950 flow. Second operand 11 states and 167 transitions. [2022-12-06 08:00:30,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 760 transitions, 23434 flow [2022-12-06 08:00:31,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 760 transitions, 22932 flow, removed 251 selfloop flow, removed 5 redundant places. [2022-12-06 08:00:31,673 INFO L231 Difference]: Finished difference. Result has 268 places, 692 transitions, 20562 flow [2022-12-06 08:00:31,674 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=19510, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20562, PETRI_PLACES=268, PETRI_TRANSITIONS=692} [2022-12-06 08:00:31,674 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 247 predicate places. [2022-12-06 08:00:31,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:31,674 INFO L89 Accepts]: Start accepts. Operand has 268 places, 692 transitions, 20562 flow [2022-12-06 08:00:31,678 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:31,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:31,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 268 places, 692 transitions, 20562 flow [2022-12-06 08:00:31,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 692 transitions, 20562 flow [2022-12-06 08:00:32,225 INFO L130 PetriNetUnfolder]: 799/2174 cut-off events. [2022-12-06 08:00:32,225 INFO L131 PetriNetUnfolder]: For 136005/136643 co-relation queries the response was YES. [2022-12-06 08:00:32,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31218 conditions, 2174 events. 799/2174 cut-off events. For 136005/136643 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 18304 event pairs, 32 based on Foata normal form. 0/2140 useless extension candidates. Maximal degree in co-relation 30282. Up to 1164 conditions per place. [2022-12-06 08:00:32,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 692 transitions, 20562 flow [2022-12-06 08:00:32,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-06 08:00:32,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [833] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_349| v_~f~0.base_250))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_250 (* v_~x2~0_465 4))))) (let ((.cse13 (select .cse4 (+ v_~f~0.offset_250 (* 4 .cse6))))) (let ((.cse12 (select .cse4 (+ v_~f~0.offset_250 (* .cse13 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_250 (* .cse12 4)))) (.cse3 (select .cse4 (+ v_~f~0.offset_250 (* v_~x1~0_520 4))))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_250 (* 4 .cse3)))) (.cse16 (select .cse4 (+ v_~f~0.offset_250 (* .cse1 4))))) (let ((.cse14 (select .cse4 (+ v_~f~0.offset_250 (* .cse16 4)))) (.cse18 (select .cse4 (+ v_~f~0.offset_250 (* .cse9 4))))) (let ((.cse17 (select .cse4 (+ v_~f~0.offset_250 (* .cse18 4)))) (.cse7 (select .cse4 (+ v_~f~0.offset_250 (* .cse14 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_250 (* .cse7 4)))) (.cse2 (select .cse4 (+ v_~f~0.offset_250 (* .cse17 4))))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_250 (* .cse2 4)))) (.cse11 (select .cse4 (+ v_~f~0.offset_250 (* .cse8 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_250 (* .cse11 4)))) (.cse19 (select .cse4 (+ v_~f~0.offset_250 (* 4 .cse10))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_250 (* 4 .cse19)))) (.cse15 (select .cse4 (+ v_~f~0.offset_250 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_256) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_256)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_315| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_319|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_319| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_256) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_264| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304|) (= (select .cse4 (+ v_~f~0.offset_250 (* .cse5 4))) v_~x1~0_518) (not (= (ite (and (< v_~x1~0_520 v_~size~0_256) (<= 0 v_~x1~0_520)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_256) (<= 0 .cse7)) 1 0) 0)) (< 8 (* (mod v_~n~0_236 1073741824) 4)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_256) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_256) (<= 0 .cse12)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_399| 9) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304| 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_465 v_~size~0_256) (<= 0 v_~x2~0_465)) 1 0) 0)) (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_256)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_315|) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_256)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_410| 12) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_264| (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_256)) 1 0)) (not (= (ite (and (< .cse16 v_~size~0_256) (<= 0 .cse16)) 1 0) 0)) (not (= (ite (and (< .cse17 v_~size~0_256) (<= 0 .cse17)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_250 (* .cse15 4))) v_~x2~0_463) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_256)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_465, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_250, #memory_int=|v_#memory_int_349|, ~n~0=v_~n~0_236, ~x1~0=v_~x1~0_520, ~f~0.offset=v_~f~0.offset_250} OutVars{~x2~0=v_~x2~0_463, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_309|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_198|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_216|, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_250, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_204|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_264|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_410|, ~x1~0=v_~x1~0_518, ~f~0.offset=v_~f~0.offset_250, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_315|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_198|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_196|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_399|, #memory_int=|v_#memory_int_349|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_210|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_319|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_210|, ~n~0=v_~n~0_236, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_212|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_319|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [909] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_480| v_~f~0.base_378))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_378 (* v_~x2~0_550 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_378 (* .cse2 4))))) (let ((.cse0 (* (mod v_~n~0_364 1073741824) 4)) (.cse3 (select .cse1 (+ v_~f~0.offset_378 (* .cse4 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_672| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_476| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_320| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_472| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_476|) (= (ite (and (<= 0 v_~x1~0_802) (< v_~x1~0_802 v_~size~0_384)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_472|) (= (select .cse1 (+ v_~f~0.offset_378 (* v_~x1~0_802 4))) v_~x1~0_801) (not (= (ite (and (< v_~x2~0_550 v_~size~0_384) (<= 0 v_~x2~0_550)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_578| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_~i~1#1_577| (+ |v_thread2Thread1of1ForFork1_~i~1#1_578| 4)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360| 0)) (not (= 0 (ite (and (< .cse2 v_~size~0_384) (<= 0 .cse2)) 1 0))) (= (select .cse1 (+ v_~f~0.offset_378 (* .cse3 4))) v_~x2~0_549) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_384)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_671| (+ |v_thread1Thread1of1ForFork0_~i~0#1_672| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_320| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_384)) 1 0))))))) InVars {~x2~0=v_~x2~0_550, ~size~0=v_~size~0_384, ~f~0.base=v_~f~0.base_378, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_672|, #memory_int=|v_#memory_int_480|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_578|, ~n~0=v_~n~0_364, ~x1~0=v_~x1~0_802, ~f~0.offset=v_~f~0.offset_378} OutVars{~x2~0=v_~x2~0_549, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_466|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_254|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_272|, ~size~0=v_~size~0_384, ~f~0.base=v_~f~0.base_378, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_260|, 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_577|, ~x1~0=v_~x1~0_801, ~f~0.offset=v_~f~0.offset_378, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_472|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_254|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_252|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_671|, #memory_int=|v_#memory_int_480|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_266|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_476|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_266|, ~n~0=v_~n~0_364, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_268|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_476|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:00:35,176 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:00:35,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3502 [2022-12-06 08:00:35,176 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 692 transitions, 20575 flow [2022-12-06 08:00:35,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:35,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:35,177 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:35,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 08:00:35,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 08:00:35,383 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:35,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1559406436, now seen corresponding path program 2 times [2022-12-06 08:00:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:35,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038743722] [2022-12-06 08:00:35,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:35,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:35,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038743722] [2022-12-06 08:00:35,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038743722] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:00:35,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083242280] [2022-12-06 08:00:35,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 08:00:35,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:35,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:00:35,491 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:00:35,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 08:00:35,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 08:00:35,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 08:00:35,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 08:00:35,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:00:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:35,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:00:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:35,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083242280] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:00:35,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:00:35,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 08:00:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445239078] [2022-12-06 08:00:35,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:00:35,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 08:00:35,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:35,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 08:00:35,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 08:00:35,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 117 [2022-12-06 08:00:35,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 692 transitions, 20575 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:35,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:35,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 117 [2022-12-06 08:00:35,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:38,167 INFO L130 PetriNetUnfolder]: 3240/5837 cut-off events. [2022-12-06 08:00:38,168 INFO L131 PetriNetUnfolder]: For 385906/385906 co-relation queries the response was YES. [2022-12-06 08:00:38,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82450 conditions, 5837 events. 3240/5837 cut-off events. For 385906/385906 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 40806 event pairs, 1302 based on Foata normal form. 24/5858 useless extension candidates. Maximal degree in co-relation 80432. Up to 5387 conditions per place. [2022-12-06 08:00:38,232 INFO L137 encePairwiseOnDemand]: 93/117 looper letters, 607 selfloop transitions, 117 changer transitions 0/724 dead transitions. [2022-12-06 08:00:38,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 724 transitions, 22538 flow [2022-12-06 08:00:38,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 08:00:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 08:00:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2022-12-06 08:00:38,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.144349477682811 [2022-12-06 08:00:38,234 INFO L175 Difference]: Start difference. First operand has 266 places, 692 transitions, 20575 flow. Second operand 9 states and 152 transitions. [2022-12-06 08:00:38,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 724 transitions, 22538 flow [2022-12-06 08:00:39,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 724 transitions, 22198 flow, removed 160 selfloop flow, removed 4 redundant places. [2022-12-06 08:00:39,560 INFO L231 Difference]: Finished difference. Result has 272 places, 689 transitions, 20446 flow [2022-12-06 08:00:39,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=20151, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=20446, PETRI_PLACES=272, PETRI_TRANSITIONS=689} [2022-12-06 08:00:39,561 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 251 predicate places. [2022-12-06 08:00:39,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:39,561 INFO L89 Accepts]: Start accepts. Operand has 272 places, 689 transitions, 20446 flow [2022-12-06 08:00:39,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:39,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:39,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 689 transitions, 20446 flow [2022-12-06 08:00:39,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 689 transitions, 20446 flow [2022-12-06 08:00:40,030 INFO L130 PetriNetUnfolder]: 797/2152 cut-off events. [2022-12-06 08:00:40,030 INFO L131 PetriNetUnfolder]: For 128379/129056 co-relation queries the response was YES. [2022-12-06 08:00:40,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30481 conditions, 2152 events. 797/2152 cut-off events. For 128379/129056 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17949 event pairs, 34 based on Foata normal form. 0/2120 useless extension candidates. Maximal degree in co-relation 29857. Up to 1125 conditions per place. [2022-12-06 08:00:40,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 689 transitions, 20446 flow [2022-12-06 08:00:40,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 1774 [2022-12-06 08:00:40,082 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:40,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:40,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:40,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:40,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:41,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:41,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:41,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:41,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:00:41,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2043 [2022-12-06 08:00:41,604 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 689 transitions, 20574 flow [2022-12-06 08:00:41,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:41,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:41,604 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:41,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 08:00:41,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 08:00:41,810 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash 947720770, now seen corresponding path program 3 times [2022-12-06 08:00:41,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:41,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757380480] [2022-12-06 08:00:41,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:41,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:41,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:41,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757380480] [2022-12-06 08:00:41,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757380480] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:00:41,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675378990] [2022-12-06 08:00:41,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 08:00:41,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:41,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:00:41,888 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:00:41,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 08:00:42,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 08:00:42,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 08:00:42,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 08:00:42,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:00:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:42,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:00:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:42,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675378990] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:00:42,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:00:42,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 08:00:42,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456751667] [2022-12-06 08:00:42,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:00:42,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 08:00:42,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:42,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 08:00:42,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 08:00:42,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 125 [2022-12-06 08:00:42,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 689 transitions, 20574 flow. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:42,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:42,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 125 [2022-12-06 08:00:42,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:45,006 INFO L130 PetriNetUnfolder]: 3209/5770 cut-off events. [2022-12-06 08:00:45,007 INFO L131 PetriNetUnfolder]: For 353233/353233 co-relation queries the response was YES. [2022-12-06 08:00:45,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80161 conditions, 5770 events. 3209/5770 cut-off events. For 353233/353233 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 40164 event pairs, 1029 based on Foata normal form. 4/5771 useless extension candidates. Maximal degree in co-relation 78844. Up to 3998 conditions per place. [2022-12-06 08:00:45,072 INFO L137 encePairwiseOnDemand]: 91/125 looper letters, 585 selfloop transitions, 121 changer transitions 6/712 dead transitions. [2022-12-06 08:00:45,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 712 transitions, 22473 flow [2022-12-06 08:00:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 08:00:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 08:00:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2022-12-06 08:00:45,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13155555555555556 [2022-12-06 08:00:45,073 INFO L175 Difference]: Start difference. First operand has 272 places, 689 transitions, 20574 flow. Second operand 9 states and 148 transitions. [2022-12-06 08:00:45,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 712 transitions, 22473 flow [2022-12-06 08:00:46,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 712 transitions, 22180 flow, removed 69 selfloop flow, removed 6 redundant places. [2022-12-06 08:00:46,154 INFO L231 Difference]: Finished difference. Result has 276 places, 687 transitions, 20492 flow [2022-12-06 08:00:46,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=20281, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=20492, PETRI_PLACES=276, PETRI_TRANSITIONS=687} [2022-12-06 08:00:46,155 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 255 predicate places. [2022-12-06 08:00:46,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:46,155 INFO L89 Accepts]: Start accepts. Operand has 276 places, 687 transitions, 20492 flow [2022-12-06 08:00:46,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:46,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:46,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 687 transitions, 20492 flow [2022-12-06 08:00:46,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 687 transitions, 20492 flow [2022-12-06 08:00:46,702 INFO L130 PetriNetUnfolder]: 793/2082 cut-off events. [2022-12-06 08:00:46,702 INFO L131 PetriNetUnfolder]: For 133025/133676 co-relation queries the response was YES. [2022-12-06 08:00:46,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30442 conditions, 2082 events. 793/2082 cut-off events. For 133025/133676 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16911 event pairs, 32 based on Foata normal form. 0/2049 useless extension candidates. Maximal degree in co-relation 30231. Up to 1119 conditions per place. [2022-12-06 08:00:46,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 687 transitions, 20492 flow [2022-12-06 08:00:46,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 1738 [2022-12-06 08:00:46,767 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:47,121 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:47,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:47,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [809] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_310| v_~f~0.base_220))) (let ((.cse7 (select .cse5 (+ v_~f~0.offset_220 (* v_~x2~0_397 4))))) (let ((.cse12 (select .cse5 (+ v_~f~0.offset_220 (* v_~x1~0_430 4)))) (.cse10 (select .cse5 (+ v_~f~0.offset_220 (* .cse7 4))))) (let ((.cse20 (select .cse5 (+ v_~f~0.offset_220 (* .cse10 4)))) (.cse18 (select .cse5 (+ v_~f~0.offset_220 (* .cse12 4))))) (let ((.cse15 (select .cse5 (+ v_~f~0.offset_220 (* .cse18 4)))) (.cse9 (select .cse5 (+ v_~f~0.offset_220 (* .cse20 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_220 (* .cse9 4)))) (.cse13 (select .cse5 (+ v_~f~0.offset_220 (* 4 .cse15))))) (let ((.cse8 (select .cse5 (+ v_~f~0.offset_220 (* .cse13 4)))) (.cse1 (select .cse5 (+ v_~f~0.offset_220 (* .cse3 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_220 (* .cse1 4)))) (.cse16 (select .cse5 (+ v_~f~0.offset_220 (* 4 .cse8))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_220 (* .cse16 4)))) (.cse19 (select .cse5 (+ v_~f~0.offset_220 (* .cse4 4))))) (let ((.cse11 (select .cse5 (+ v_~f~0.offset_220 (* .cse19 4)))) (.cse0 (select .cse5 (+ v_~f~0.offset_220 (* .cse2 4))))) (let ((.cse21 (select .cse5 (+ v_~f~0.offset_220 (* .cse0 4)))) (.cse14 (select .cse5 (+ v_~f~0.offset_220 (* .cse11 4))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_220 (* .cse14 4)))) (.cse17 (select .cse5 (+ v_~f~0.offset_220 (* .cse21 4))))) (and (not (= (ite (and (< v_~x2~0_397 v_~size~0_226) (<= 0 v_~x2~0_397)) 1 0) 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_226) (<= 0 .cse1)) 1 0) 0)) (not (= 0 (ite (and (< .cse2 v_~size~0_226) (<= 0 .cse2)) 1 0))) (not (= (ite (and (< v_~x1~0_430 v_~size~0_226) (<= 0 v_~x1~0_430)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_226)) 1 0))) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_226)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_321| 11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|) (= (select .cse5 (+ v_~f~0.offset_220 (* .cse6 4))) v_~x2~0_395) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_226) (<= 0 .cse9)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|) (= |v_thread2Thread1of1ForFork1_~i~1#1_358| 12) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260| 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_226)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260| 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_226)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| (ite (and (< .cse6 v_~size~0_226) (<= 0 .cse6)) 1 0)) (not (= (ite (and (< .cse15 v_~size~0_226) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_226) (<= 0 .cse16)) 1 0) 0)) (= (ite (and (< .cse17 v_~size~0_226) (<= 0 .cse17)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256|) (not (= (ite (and (< .cse18 v_~size~0_226) (<= 0 .cse18)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse20) (< .cse20 v_~size~0_226)) 1 0) 0)) (not (= 0 (ite (and (< .cse21 v_~size~0_226) (<= 0 .cse21)) 1 0))) (= (select .cse5 (+ v_~f~0.offset_220 (* .cse17 4))) v_~x1~0_429) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_321| 4294967293) 4294967296) (* (mod v_~n~0_206 1073741824) 4))))))))))))))) InVars {~x2~0=v_~x2~0_397, ~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_220, #memory_int=|v_#memory_int_310|, ~n~0=v_~n~0_206, ~x1~0=v_~x1~0_430, ~f~0.offset=v_~f~0.offset_220} OutVars{~x2~0=v_~x2~0_395, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_250|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_154|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_172|, ~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_220, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_160|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_358|, ~x1~0=v_~x1~0_429, ~f~0.offset=v_~f~0.offset_220, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_154|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_152|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_321|, #memory_int=|v_#memory_int_310|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_166|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_166|, ~n~0=v_~n~0_206, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_168|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_260|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [817] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_326| v_~f~0.base_230))) (let ((.cse0 (* (mod v_~n~0_216 1073741824) 4)) (.cse1 (select .cse2 (+ v_~f~0.offset_230 (* v_~x1~0_460 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_276| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_280|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_350| 4294967295) 4294967296) .cse0) (= (ite (and (< .cse1 v_~size~0_236) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_276|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_352| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_280| 0)) (not (= (ite (and (< v_~x1~0_460 v_~size~0_236) (<= 0 v_~x1~0_460)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_230 (* .cse1 4))) v_~x1~0_458) (= |v_thread1Thread1of1ForFork0_~i~0#1_350| (+ |v_thread1Thread1of1ForFork0_~i~0#1_352| 2))))) InVars {~size~0=v_~size~0_236, ~f~0.base=v_~f~0.base_230, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_352|, #memory_int=|v_#memory_int_326|, ~n~0=v_~n~0_216, ~x1~0=v_~x1~0_460, ~f~0.offset=v_~f~0.offset_230} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_270|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_276|, ~size~0=v_~size~0_236, ~f~0.base=v_~f~0.base_230, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_350|, #memory_int=|v_#memory_int_326|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_280|, ~n~0=v_~n~0_216, ~x1~0=v_~x1~0_458, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_280|, ~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-06 08:00:55,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [903] $Ultimate##0-->L49-2: Formula: (let ((.cse6 (select |v_#memory_int_472| v_~f~0.base_370))) (let ((.cse18 (select .cse6 (+ v_~f~0.offset_370 (* v_~x2~0_528 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_370 (* .cse18 4)))) (.cse19 (select .cse6 (+ v_~f~0.offset_370 (* v_~x1~0_788 4))))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_370 (* 4 .cse19)))) (.cse8 (select .cse6 (+ v_~f~0.offset_370 (* .cse0 4))))) (let ((.cse21 (select .cse6 (+ v_~f~0.offset_370 (* .cse8 4)))) (.cse14 (select .cse6 (+ v_~f~0.offset_370 (* 4 .cse1))))) (let ((.cse9 (select .cse6 (+ v_~f~0.offset_370 (* .cse14 4)))) (.cse15 (select .cse6 (+ v_~f~0.offset_370 (* .cse21 4))))) (let ((.cse16 (select .cse6 (+ v_~f~0.offset_370 (* 4 .cse15)))) (.cse5 (select .cse6 (+ v_~f~0.offset_370 (* 4 .cse9))))) (let ((.cse17 (select .cse6 (+ v_~f~0.offset_370 (* .cse5 4)))) (.cse11 (select .cse6 (+ v_~f~0.offset_370 (* .cse16 4))))) (let ((.cse12 (select .cse6 (+ v_~f~0.offset_370 (* .cse11 4)))) (.cse10 (select .cse6 (+ v_~f~0.offset_370 (* .cse17 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_370 (* .cse10 4)))) (.cse20 (select .cse6 (+ v_~f~0.offset_370 (* .cse12 4))))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_370 (* .cse20 4)))) (.cse2 (select .cse6 (+ v_~f~0.offset_370 (* .cse4 4))))) (let ((.cse13 (select .cse6 (+ v_~f~0.offset_370 (* 4 .cse2)))) (.cse7 (select .cse6 (+ v_~f~0.offset_370 (* .cse3 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_528) (< v_~x2~0_528 v_~size~0_376)) 1 0) 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_376)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_653| 11) (not (= (ite (and (< v_~x1~0_788 v_~size~0_376) (<= 0 v_~x1~0_788)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_376) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_558| 12) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_376)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_376) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_376) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_376)) 1 0) 0)) (= (select .cse6 (+ v_~f~0.offset_370 (* .cse7 4))) v_~x2~0_526) (not (= (ite (and (< .cse8 v_~size~0_376) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_376) (<= 0 .cse9)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_465| 0)) (not (= (ite (and (< .cse10 v_~size~0_376) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_376)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_376) (<= 0 .cse12)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_461| (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_376)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_461| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_465|) (not (= (ite (and (< .cse14 v_~size~0_376) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_376)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_305| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_345|) (not (= (ite (and (< .cse16 v_~size~0_376) (<= 0 .cse16)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_376)) 1 0) 0)) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_376)) 1 0) 0)) (= v_~x1~0_786 (select .cse6 (+ v_~f~0.offset_370 (* .cse13 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_305| (ite (and (< .cse7 v_~size~0_376) (<= 0 .cse7)) 1 0)) (< 8 (* (mod v_~n~0_356 1073741824) 4)) (not (= (ite (and (< .cse19 v_~size~0_376) (<= 0 .cse19)) 1 0) 0)) (not (= (ite (and (< .cse20 v_~size~0_376) (<= 0 .cse20)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_345| 0)) (not (= 0 (ite (and (<= 0 .cse21) (< .cse21 v_~size~0_376)) 1 0)))))))))))))))) InVars {~x2~0=v_~x2~0_528, ~size~0=v_~size~0_376, ~f~0.base=v_~f~0.base_370, #memory_int=|v_#memory_int_472|, ~n~0=v_~n~0_356, ~x1~0=v_~x1~0_788, ~f~0.offset=v_~f~0.offset_370} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_455|, ~x2~0=v_~x2~0_526, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_239|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_257|, ~size~0=v_~size~0_376, ~f~0.base=v_~f~0.base_370, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_245|, 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_558|, ~x1~0=v_~x1~0_786, ~f~0.offset=v_~f~0.offset_370, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_345|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_461|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_239|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_237|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_653|, #memory_int=|v_#memory_int_472|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_465|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_251|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_251|, ~n~0=v_~n~0_356, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_465|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_253|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:01:00,304 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 08:01:00,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14150 [2022-12-06 08:01:00,305 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 685 transitions, 20590 flow [2022-12-06 08:01:00,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:00,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:00,305 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:00,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:00,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:00,511 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:00,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash -779366353, now seen corresponding path program 1 times [2022-12-06 08:01:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:00,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142089319] [2022-12-06 08:01:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:00,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:00,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142089319] [2022-12-06 08:01:00,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142089319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:00,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486040005] [2022-12-06 08:01:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:00,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:00,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:00,615 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:00,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 08:01:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:00,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 08:01:00,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:00,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:00,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486040005] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:00,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:00,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 08:01:00,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822514692] [2022-12-06 08:01:00,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:00,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 08:01:00,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:00,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 08:01:00,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-06 08:01:00,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 130 [2022-12-06 08:01:00,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 685 transitions, 20590 flow. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:00,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:00,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 130 [2022-12-06 08:01:00,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:05,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:01:07,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:01:09,851 INFO L130 PetriNetUnfolder]: 3247/5773 cut-off events. [2022-12-06 08:01:09,851 INFO L131 PetriNetUnfolder]: For 398032/398032 co-relation queries the response was YES. [2022-12-06 08:01:09,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82090 conditions, 5773 events. 3247/5773 cut-off events. For 398032/398032 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 39751 event pairs, 1253 based on Foata normal form. 86/5856 useless extension candidates. Maximal degree in co-relation 81530. Up to 5183 conditions per place. [2022-12-06 08:01:09,926 INFO L137 encePairwiseOnDemand]: 100/130 looper letters, 683 selfloop transitions, 120 changer transitions 2/805 dead transitions. [2022-12-06 08:01:09,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 805 transitions, 24778 flow [2022-12-06 08:01:09,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 08:01:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 08:01:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 198 transitions. [2022-12-06 08:01:09,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08461538461538462 [2022-12-06 08:01:09,930 INFO L175 Difference]: Start difference. First operand has 270 places, 685 transitions, 20590 flow. Second operand 18 states and 198 transitions. [2022-12-06 08:01:09,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 805 transitions, 24778 flow [2022-12-06 08:01:11,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 805 transitions, 24179 flow, removed 138 selfloop flow, removed 9 redundant places. [2022-12-06 08:01:11,165 INFO L231 Difference]: Finished difference. Result has 285 places, 701 transitions, 20966 flow [2022-12-06 08:01:11,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=20061, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=20966, PETRI_PLACES=285, PETRI_TRANSITIONS=701} [2022-12-06 08:01:11,166 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 264 predicate places. [2022-12-06 08:01:11,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:11,166 INFO L89 Accepts]: Start accepts. Operand has 285 places, 701 transitions, 20966 flow [2022-12-06 08:01:11,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:11,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:11,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 701 transitions, 20966 flow [2022-12-06 08:01:11,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 701 transitions, 20966 flow [2022-12-06 08:01:11,631 INFO L130 PetriNetUnfolder]: 816/2124 cut-off events. [2022-12-06 08:01:11,631 INFO L131 PetriNetUnfolder]: For 157103/157828 co-relation queries the response was YES. [2022-12-06 08:01:11,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32022 conditions, 2124 events. 816/2124 cut-off events. For 157103/157828 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17325 event pairs, 32 based on Foata normal form. 0/2086 useless extension candidates. Maximal degree in co-relation 31388. Up to 1157 conditions per place. [2022-12-06 08:01:11,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 701 transitions, 20966 flow [2022-12-06 08:01:11,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 1780 [2022-12-06 08:01:11,688 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:01:12,819 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:01:13,021 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [899] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_468| v_~f~0.base_366))) (let ((.cse13 (select .cse0 (+ v_~f~0.offset_366 (* v_~x1~0_778 4))))) (let ((.cse17 (select .cse0 (+ v_~f~0.offset_366 (* .cse13 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_366 (* .cse17 4))))) (let ((.cse14 (select .cse0 (+ v_~f~0.offset_366 (* 4 .cse8)))) (.cse4 (select .cse0 (+ v_~f~0.offset_366 (* v_~x2~0_517 4))))) (let ((.cse16 (select .cse0 (+ v_~f~0.offset_366 (* .cse4 4)))) (.cse11 (select .cse0 (+ v_~f~0.offset_366 (* .cse14 4))))) (let ((.cse10 (select .cse0 (+ v_~f~0.offset_366 (* .cse11 4)))) (.cse9 (select .cse0 (+ v_~f~0.offset_366 (* .cse16 4))))) (let ((.cse15 (select .cse0 (+ v_~f~0.offset_366 (* .cse9 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_366 (* .cse10 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_366 (* .cse2 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_366 (* .cse15 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_366 (* .cse3 4)))) (.cse12 (select .cse0 (+ v_~f~0.offset_366 (* 4 .cse5))))) (let ((.cse1 (select .cse0 (+ (* .cse12 4) v_~f~0.offset_366))) (.cse6 (select .cse0 (+ v_~f~0.offset_366 (* .cse7 4))))) (and (= (select .cse0 (+ v_~f~0.offset_366 (* .cse1 4))) v_~x1~0_776) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_372)) 1 0) 0)) (not (= 0 (ite (and (< .cse3 v_~size~0_372) (<= 0 .cse3)) 1 0))) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_372)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_372) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455| (ite (and (< .cse1 v_~size~0_372) (<= 0 .cse1)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459|) (= |v_thread2Thread1of1ForFork1_~i~1#1_552| 8) (= (select .cse0 (+ v_~f~0.offset_366 (* .cse6 4))) v_~x2~0_516) (not (= (ite (and (< .cse7 v_~size~0_372) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_372)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299| (ite (and (< .cse6 v_~size~0_372) (<= 0 .cse6)) 1 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_647| 4294967293) 4294967296) (* (mod v_~n~0_352 1073741824) 4)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_372)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_372)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_339|) (not (= (ite (and (< .cse11 v_~size~0_372) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_372)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_372) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_372) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_372)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_778 v_~size~0_372) (<= 0 v_~x1~0_778)) 1 0) 0)) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_372)) 1 0) 0)) (not (= (ite (and (< .cse17 v_~size~0_372) (<= 0 .cse17)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_647| 11) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_339| 0)) (not (= (ite (and (< v_~x2~0_517 v_~size~0_372) (<= 0 v_~x2~0_517)) 1 0) 0)))))))))))))) InVars {~x2~0=v_~x2~0_517, ~size~0=v_~size~0_372, ~f~0.base=v_~f~0.base_366, #memory_int=|v_#memory_int_468|, ~n~0=v_~n~0_352, ~x1~0=v_~x1~0_778, ~f~0.offset=v_~f~0.offset_366} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_449|, ~x2~0=v_~x2~0_516, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_233|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_251|, ~size~0=v_~size~0_372, ~f~0.base=v_~f~0.base_366, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_239|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_552|, ~x1~0=v_~x1~0_776, ~f~0.offset=v_~f~0.offset_366, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_339|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_233|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_231|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_647|, #memory_int=|v_#memory_int_468|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_245|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_245|, ~n~0=v_~n~0_352, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_459|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_247|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:01:17,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_232| v_~f~0.base_150))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_150 (* v_~x1~0_223 4)))) (.cse2 (* (mod v_~n~0_136 1073741824) 4))) (and (= (select .cse0 (+ v_~f~0.offset_150 (* .cse1 4))) v_~x1~0_221) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_175| 4294967295) 4294967296) .cse2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_156)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124|) (= |v_thread1Thread1of1ForFork0_~i~0#1_175| (+ |v_thread1Thread1of1ForFork0_~i~0#1_177| 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128|) (not (= (ite (and (< v_~x1~0_223 v_~size~0_156) (<= 0 v_~x1~0_223)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_177| 4294967296) .cse2)))) InVars {~size~0=v_~size~0_156, ~f~0.base=v_~f~0.base_150, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_177|, #memory_int=|v_#memory_int_232|, ~n~0=v_~n~0_136, ~x1~0=v_~x1~0_223, ~f~0.offset=v_~f~0.offset_150} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124|, ~size~0=v_~size~0_156, ~f~0.base=v_~f~0.base_150, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_175|, #memory_int=|v_#memory_int_232|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128|, ~n~0=v_~n~0_136, ~x1~0=v_~x1~0_221, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_128|, ~f~0.offset=v_~f~0.offset_150} AuxVars[] 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:01:17,667 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:01:17,848 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:01:18,015 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:01:18,546 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 08:01:18,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7381 [2022-12-06 08:01:18,547 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 696 transitions, 21067 flow [2022-12-06 08:01:18,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:18,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:18,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:18,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:18,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:18,752 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:18,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1663730678, now seen corresponding path program 1 times [2022-12-06 08:01:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:18,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125849491] [2022-12-06 08:01:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:18,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:18,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125849491] [2022-12-06 08:01:18,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125849491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:01:18,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:01:18,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 08:01:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453337944] [2022-12-06 08:01:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:01:18,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 08:01:18,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:18,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 08:01:18,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 08:01:18,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 138 [2022-12-06 08:01:18,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 696 transitions, 21067 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:18,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:18,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 138 [2022-12-06 08:01:18,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:20,812 INFO L130 PetriNetUnfolder]: 3234/5726 cut-off events. [2022-12-06 08:01:20,812 INFO L131 PetriNetUnfolder]: For 462403/462403 co-relation queries the response was YES. [2022-12-06 08:01:20,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85662 conditions, 5726 events. 3234/5726 cut-off events. For 462403/462403 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 39203 event pairs, 1372 based on Foata normal form. 10/5733 useless extension candidates. Maximal degree in co-relation 84171. Up to 5638 conditions per place. [2022-12-06 08:01:20,880 INFO L137 encePairwiseOnDemand]: 116/138 looper letters, 680 selfloop transitions, 30 changer transitions 3/713 dead transitions. [2022-12-06 08:01:20,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 713 transitions, 23082 flow [2022-12-06 08:01:20,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 08:01:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 08:01:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-12-06 08:01:20,882 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.357487922705314 [2022-12-06 08:01:20,882 INFO L175 Difference]: Start difference. First operand has 277 places, 696 transitions, 21067 flow. Second operand 3 states and 148 transitions. [2022-12-06 08:01:20,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 713 transitions, 23082 flow [2022-12-06 08:01:22,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 713 transitions, 22576 flow, removed 241 selfloop flow, removed 7 redundant places. [2022-12-06 08:01:22,375 INFO L231 Difference]: Finished difference. Result has 273 places, 702 transitions, 20950 flow [2022-12-06 08:01:22,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=20577, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=20950, PETRI_PLACES=273, PETRI_TRANSITIONS=702} [2022-12-06 08:01:22,375 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 252 predicate places. [2022-12-06 08:01:22,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:22,375 INFO L89 Accepts]: Start accepts. Operand has 273 places, 702 transitions, 20950 flow [2022-12-06 08:01:22,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:22,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:22,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 702 transitions, 20950 flow [2022-12-06 08:01:22,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 702 transitions, 20950 flow [2022-12-06 08:01:22,939 INFO L130 PetriNetUnfolder]: 826/2073 cut-off events. [2022-12-06 08:01:22,939 INFO L131 PetriNetUnfolder]: For 132802/133521 co-relation queries the response was YES. [2022-12-06 08:01:22,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30785 conditions, 2073 events. 826/2073 cut-off events. For 132802/133521 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16414 event pairs, 34 based on Foata normal form. 0/2034 useless extension candidates. Maximal degree in co-relation 30072. Up to 1171 conditions per place. [2022-12-06 08:01:22,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 270 places, 702 transitions, 20950 flow [2022-12-06 08:01:22,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 1758 [2022-12-06 08:01:22,978 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:01:22,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 604 [2022-12-06 08:01:22,979 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 702 transitions, 20950 flow [2022-12-06 08:01:22,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-06 08:01:22,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:22,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:22,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 08:01:22,979 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:22,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:22,979 INFO L85 PathProgramCache]: Analyzing trace with hash -218494612, now seen corresponding path program 1 times [2022-12-06 08:01:22,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:22,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776401423] [2022-12-06 08:01:22,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:22,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:23,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:23,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776401423] [2022-12-06 08:01:23,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776401423] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:23,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849634503] [2022-12-06 08:01:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:23,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:23,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:23,056 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:23,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 08:01:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:23,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 08:01:23,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:23,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:23,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849634503] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:23,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:23,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 08:01:23,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354537651] [2022-12-06 08:01:23,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:23,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 08:01:23,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:23,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 08:01:23,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 08:01:23,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 137 [2022-12-06 08:01:23,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 702 transitions, 20950 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-06 08:01:23,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:23,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 137 [2022-12-06 08:01:23,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:25,884 INFO L130 PetriNetUnfolder]: 3564/6250 cut-off events. [2022-12-06 08:01:25,884 INFO L131 PetriNetUnfolder]: For 423335/423335 co-relation queries the response was YES. [2022-12-06 08:01:25,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89855 conditions, 6250 events. 3564/6250 cut-off events. For 423335/423335 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 43463 event pairs, 923 based on Foata normal form. 76/6323 useless extension candidates. Maximal degree in co-relation 87823. Up to 4514 conditions per place. [2022-12-06 08:01:25,961 INFO L137 encePairwiseOnDemand]: 59/137 looper letters, 586 selfloop transitions, 271 changer transitions 12/869 dead transitions. [2022-12-06 08:01:25,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 869 transitions, 27712 flow [2022-12-06 08:01:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 08:01:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 08:01:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2022-12-06 08:01:25,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14744525547445256 [2022-12-06 08:01:25,962 INFO L175 Difference]: Start difference. First operand has 270 places, 702 transitions, 20950 flow. Second operand 10 states and 202 transitions. [2022-12-06 08:01:25,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 869 transitions, 27712 flow [2022-12-06 08:01:27,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 869 transitions, 27630 flow, removed 26 selfloop flow, removed 1 redundant places. [2022-12-06 08:01:27,354 INFO L231 Difference]: Finished difference. Result has 281 places, 763 transitions, 23893 flow [2022-12-06 08:01:27,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=20874, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23893, PETRI_PLACES=281, PETRI_TRANSITIONS=763} [2022-12-06 08:01:27,354 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 260 predicate places. [2022-12-06 08:01:27,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:27,355 INFO L89 Accepts]: Start accepts. Operand has 281 places, 763 transitions, 23893 flow [2022-12-06 08:01:27,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:27,359 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:27,359 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 763 transitions, 23893 flow [2022-12-06 08:01:27,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 763 transitions, 23893 flow [2022-12-06 08:01:27,984 INFO L130 PetriNetUnfolder]: 933/2312 cut-off events. [2022-12-06 08:01:27,984 INFO L131 PetriNetUnfolder]: For 154342/155083 co-relation queries the response was YES. [2022-12-06 08:01:28,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35588 conditions, 2312 events. 933/2312 cut-off events. For 154342/155083 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 18634 event pairs, 35 based on Foata normal form. 0/2273 useless extension candidates. Maximal degree in co-relation 35031. Up to 1349 conditions per place. [2022-12-06 08:01:28,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 763 transitions, 23893 flow [2022-12-06 08:01:28,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 1902 [2022-12-06 08:01:28,047 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:01:28,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 694 [2022-12-06 08:01:28,048 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 763 transitions, 23893 flow [2022-12-06 08:01:28,048 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-06 08:01:28,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:28,048 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:28,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:28,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-06 08:01:28,253 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:28,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:28,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1187985518, now seen corresponding path program 1 times [2022-12-06 08:01:28,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:28,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824177195] [2022-12-06 08:01:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:28,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:28,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824177195] [2022-12-06 08:01:28,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824177195] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:28,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499952341] [2022-12-06 08:01:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:28,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:28,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:28,319 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:28,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 08:01:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:28,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 08:01:28,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:28,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:28,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499952341] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:28,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:28,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 08:01:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875278524] [2022-12-06 08:01:28,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:28,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 08:01:28,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:28,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 08:01:28,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-12-06 08:01:28,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 137 [2022-12-06 08:01:28,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 763 transitions, 23893 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:28,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:28,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 137 [2022-12-06 08:01:28,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:31,180 INFO L130 PetriNetUnfolder]: 3712/6502 cut-off events. [2022-12-06 08:01:31,181 INFO L131 PetriNetUnfolder]: For 447891/447891 co-relation queries the response was YES. [2022-12-06 08:01:31,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95794 conditions, 6502 events. 3712/6502 cut-off events. For 447891/447891 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 45177 event pairs, 1023 based on Foata normal form. 48/6547 useless extension candidates. Maximal degree in co-relation 94649. Up to 4751 conditions per place. [2022-12-06 08:01:31,267 INFO L137 encePairwiseOnDemand]: 67/137 looper letters, 546 selfloop transitions, 319 changer transitions 0/865 dead transitions. [2022-12-06 08:01:31,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 865 transitions, 28687 flow [2022-12-06 08:01:31,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 08:01:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 08:01:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2022-12-06 08:01:31,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15967153284671534 [2022-12-06 08:01:31,269 INFO L175 Difference]: Start difference. First operand has 281 places, 763 transitions, 23893 flow. Second operand 8 states and 175 transitions. [2022-12-06 08:01:31,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 865 transitions, 28687 flow [2022-12-06 08:01:33,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 865 transitions, 28536 flow, removed 58 selfloop flow, removed 4 redundant places. [2022-12-06 08:01:33,061 INFO L231 Difference]: Finished difference. Result has 287 places, 793 transitions, 25803 flow [2022-12-06 08:01:33,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=23784, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=25803, PETRI_PLACES=287, PETRI_TRANSITIONS=793} [2022-12-06 08:01:33,062 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 266 predicate places. [2022-12-06 08:01:33,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:33,062 INFO L89 Accepts]: Start accepts. Operand has 287 places, 793 transitions, 25803 flow [2022-12-06 08:01:33,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:33,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:33,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 287 places, 793 transitions, 25803 flow [2022-12-06 08:01:33,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 287 places, 793 transitions, 25803 flow [2022-12-06 08:01:33,714 INFO L130 PetriNetUnfolder]: 956/2375 cut-off events. [2022-12-06 08:01:33,714 INFO L131 PetriNetUnfolder]: For 166118/166912 co-relation queries the response was YES. [2022-12-06 08:01:33,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37553 conditions, 2375 events. 956/2375 cut-off events. For 166118/166912 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 19290 event pairs, 46 based on Foata normal form. 0/2337 useless extension candidates. Maximal degree in co-relation 36765. Up to 1401 conditions per place. [2022-12-06 08:01:33,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 287 places, 793 transitions, 25803 flow [2022-12-06 08:01:33,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 1986 [2022-12-06 08:01:33,762 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:01:33,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 700 [2022-12-06 08:01:33,762 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 793 transitions, 25803 flow [2022-12-06 08:01:33,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:33,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:33,763 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:33,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:33,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:33,969 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:33,969 INFO L85 PathProgramCache]: Analyzing trace with hash 523628090, now seen corresponding path program 1 times [2022-12-06 08:01:33,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:33,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401688104] [2022-12-06 08:01:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:33,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:34,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:34,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401688104] [2022-12-06 08:01:34,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401688104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:34,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408121753] [2022-12-06 08:01:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:34,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:34,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:34,067 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:34,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 08:01:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:34,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 08:01:34,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:34,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:34,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408121753] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:34,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:34,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 08:01:34,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159523830] [2022-12-06 08:01:34,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:34,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 08:01:34,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:34,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 08:01:34,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-06 08:01:34,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 137 [2022-12-06 08:01:34,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 793 transitions, 25803 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:34,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:34,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 137 [2022-12-06 08:01:34,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:37,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:01:41,918 INFO L130 PetriNetUnfolder]: 4382/7586 cut-off events. [2022-12-06 08:01:41,918 INFO L131 PetriNetUnfolder]: For 538772/538772 co-relation queries the response was YES. [2022-12-06 08:01:41,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114104 conditions, 7586 events. 4382/7586 cut-off events. For 538772/538772 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 52929 event pairs, 446 based on Foata normal form. 162/7745 useless extension candidates. Maximal degree in co-relation 111113. Up to 3761 conditions per place. [2022-12-06 08:01:42,008 INFO L137 encePairwiseOnDemand]: 32/137 looper letters, 524 selfloop transitions, 577 changer transitions 17/1118 dead transitions. [2022-12-06 08:01:42,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 1118 transitions, 37762 flow [2022-12-06 08:01:42,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 08:01:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 08:01:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 259 transitions. [2022-12-06 08:01:42,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09002433090024331 [2022-12-06 08:01:42,010 INFO L175 Difference]: Start difference. First operand has 287 places, 793 transitions, 25803 flow. Second operand 21 states and 259 transitions. [2022-12-06 08:01:42,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 1118 transitions, 37762 flow [2022-12-06 08:01:43,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 1118 transitions, 37645 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-06 08:01:43,955 INFO L231 Difference]: Finished difference. Result has 308 places, 873 transitions, 29825 flow [2022-12-06 08:01:43,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=25690, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=510, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=29825, PETRI_PLACES=308, PETRI_TRANSITIONS=873} [2022-12-06 08:01:43,955 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 287 predicate places. [2022-12-06 08:01:43,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:43,956 INFO L89 Accepts]: Start accepts. Operand has 308 places, 873 transitions, 29825 flow [2022-12-06 08:01:43,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:43,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:43,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 873 transitions, 29825 flow [2022-12-06 08:01:43,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 308 places, 873 transitions, 29825 flow [2022-12-06 08:01:44,715 INFO L130 PetriNetUnfolder]: 1114/2653 cut-off events. [2022-12-06 08:01:44,715 INFO L131 PetriNetUnfolder]: For 199392/200416 co-relation queries the response was YES. [2022-12-06 08:01:44,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44655 conditions, 2653 events. 1114/2653 cut-off events. For 199392/200416 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21082 event pairs, 48 based on Foata normal form. 0/2606 useless extension candidates. Maximal degree in co-relation 43906. Up to 1657 conditions per place. [2022-12-06 08:01:44,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 873 transitions, 29825 flow [2022-12-06 08:01:44,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 2234 [2022-12-06 08:01:44,772 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:01:44,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 817 [2022-12-06 08:01:44,773 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 873 transitions, 29825 flow [2022-12-06 08:01:44,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:44,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:44,773 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:44,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:44,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-06 08:01:44,979 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:44,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:44,979 INFO L85 PathProgramCache]: Analyzing trace with hash 285966311, now seen corresponding path program 1 times [2022-12-06 08:01:44,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:44,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260894178] [2022-12-06 08:01:44,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:44,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:45,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260894178] [2022-12-06 08:01:45,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260894178] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:45,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693536055] [2022-12-06 08:01:45,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:45,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:45,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:45,153 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:45,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 08:01:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:45,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 08:01:45,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:45,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:45,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693536055] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:45,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:45,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 08:01:45,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207283656] [2022-12-06 08:01:45,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:45,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 08:01:45,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:45,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 08:01:45,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-12-06 08:01:45,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 137 [2022-12-06 08:01:45,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 873 transitions, 29825 flow. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:45,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:45,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 137 [2022-12-06 08:01:45,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:49,521 INFO L130 PetriNetUnfolder]: 4506/7761 cut-off events. [2022-12-06 08:01:49,521 INFO L131 PetriNetUnfolder]: For 560150/560150 co-relation queries the response was YES. [2022-12-06 08:01:49,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121248 conditions, 7761 events. 4506/7761 cut-off events. For 560150/560150 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 53596 event pairs, 1115 based on Foata normal form. 72/7830 useless extension candidates. Maximal degree in co-relation 118512. Up to 5102 conditions per place. [2022-12-06 08:01:49,638 INFO L137 encePairwiseOnDemand]: 50/137 looper letters, 567 selfloop transitions, 459 changer transitions 0/1026 dead transitions. [2022-12-06 08:01:49,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 1026 transitions, 36786 flow [2022-12-06 08:01:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 08:01:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 08:01:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 207 transitions. [2022-12-06 08:01:49,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10792492179353493 [2022-12-06 08:01:49,640 INFO L175 Difference]: Start difference. First operand has 308 places, 873 transitions, 29825 flow. Second operand 14 states and 207 transitions. [2022-12-06 08:01:49,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 1026 transitions, 36786 flow [2022-12-06 08:01:51,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 1026 transitions, 35931 flow, removed 369 selfloop flow, removed 4 redundant places. [2022-12-06 08:01:52,002 INFO L231 Difference]: Finished difference. Result has 323 places, 931 transitions, 32545 flow [2022-12-06 08:01:52,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=29026, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=408, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=32545, PETRI_PLACES=323, PETRI_TRANSITIONS=931} [2022-12-06 08:01:52,003 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 302 predicate places. [2022-12-06 08:01:52,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:52,004 INFO L89 Accepts]: Start accepts. Operand has 323 places, 931 transitions, 32545 flow [2022-12-06 08:01:52,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:52,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:52,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 323 places, 931 transitions, 32545 flow [2022-12-06 08:01:52,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 323 places, 931 transitions, 32545 flow [2022-12-06 08:01:52,859 INFO L130 PetriNetUnfolder]: 1175/2792 cut-off events. [2022-12-06 08:01:52,859 INFO L131 PetriNetUnfolder]: For 215422/216595 co-relation queries the response was YES. [2022-12-06 08:01:52,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47560 conditions, 2792 events. 1175/2792 cut-off events. For 215422/216595 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 22391 event pairs, 54 based on Foata normal form. 0/2740 useless extension candidates. Maximal degree in co-relation 46777. Up to 1764 conditions per place. [2022-12-06 08:01:52,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 323 places, 931 transitions, 32545 flow [2022-12-06 08:01:52,918 INFO L188 LiptonReduction]: Number of co-enabled transitions 2394 [2022-12-06 08:01:57,090 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:01:57,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5086 [2022-12-06 08:01:57,090 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 931 transitions, 32570 flow [2022-12-06 08:01:57,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:57,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:57,090 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:57,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:57,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:57,296 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:57,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:57,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2002510793, now seen corresponding path program 1 times [2022-12-06 08:01:57,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:57,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783173443] [2022-12-06 08:01:57,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:57,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783173443] [2022-12-06 08:01:57,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783173443] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:57,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452838871] [2022-12-06 08:01:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:57,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:57,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:57,387 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:57,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 08:01:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:57,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 08:01:57,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:57,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:57,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452838871] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:57,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:57,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 08:01:57,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629591739] [2022-12-06 08:01:57,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:57,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 08:01:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 08:01:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-06 08:01:57,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 138 [2022-12-06 08:01:57,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 931 transitions, 32570 flow. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:57,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:57,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 138 [2022-12-06 08:01:57,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:03,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:02:06,816 INFO L130 PetriNetUnfolder]: 4582/7964 cut-off events. [2022-12-06 08:02:06,816 INFO L131 PetriNetUnfolder]: For 587152/587152 co-relation queries the response was YES. [2022-12-06 08:02:06,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124235 conditions, 7964 events. 4582/7964 cut-off events. For 587152/587152 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 56107 event pairs, 1395 based on Foata normal form. 28/7989 useless extension candidates. Maximal degree in co-relation 121615. Up to 5778 conditions per place. [2022-12-06 08:02:06,921 INFO L137 encePairwiseOnDemand]: 85/138 looper letters, 849 selfloop transitions, 193 changer transitions 26/1068 dead transitions. [2022-12-06 08:02:06,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 1068 transitions, 38029 flow [2022-12-06 08:02:06,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 08:02:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 08:02:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-12-06 08:02:06,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.07453416149068323 [2022-12-06 08:02:06,922 INFO L175 Difference]: Start difference. First operand has 323 places, 931 transitions, 32570 flow. Second operand 21 states and 216 transitions. [2022-12-06 08:02:06,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 1068 transitions, 38029 flow [2022-12-06 08:02:09,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 1068 transitions, 37506 flow, removed 215 selfloop flow, removed 2 redundant places. [2022-12-06 08:02:09,305 INFO L231 Difference]: Finished difference. Result has 355 places, 962 transitions, 33822 flow [2022-12-06 08:02:09,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=32056, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=751, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=33822, PETRI_PLACES=355, PETRI_TRANSITIONS=962} [2022-12-06 08:02:09,306 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 334 predicate places. [2022-12-06 08:02:09,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:09,306 INFO L89 Accepts]: Start accepts. Operand has 355 places, 962 transitions, 33822 flow [2022-12-06 08:02:09,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:09,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:09,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 355 places, 962 transitions, 33822 flow [2022-12-06 08:02:09,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 349 places, 962 transitions, 33822 flow [2022-12-06 08:02:10,184 INFO L130 PetriNetUnfolder]: 1186/2861 cut-off events. [2022-12-06 08:02:10,185 INFO L131 PetriNetUnfolder]: For 239120/240174 co-relation queries the response was YES. [2022-12-06 08:02:10,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49756 conditions, 2861 events. 1186/2861 cut-off events. For 239120/240174 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 23348 event pairs, 47 based on Foata normal form. 0/2813 useless extension candidates. Maximal degree in co-relation 49616. Up to 1776 conditions per place. [2022-12-06 08:02:10,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 349 places, 962 transitions, 33822 flow [2022-12-06 08:02:10,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 2470 [2022-12-06 08:02:10,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [940] $Ultimate##0-->L59-2: Formula: (let ((.cse11 (select |v_#memory_int_524| v_~f~0.base_422))) (let ((.cse1 (select .cse11 (+ v_~f~0.offset_422 (* v_~x2~0_644 4))))) (let ((.cse0 (select .cse11 (+ v_~f~0.offset_422 (* .cse1 4)))) (.cse10 (select .cse11 (+ v_~f~0.offset_422 (* v_~x1~0_872 4))))) (let ((.cse7 (select .cse11 (+ v_~f~0.offset_422 (* .cse10 4)))) (.cse5 (select .cse11 (+ (* .cse0 4) v_~f~0.offset_422)))) (let ((.cse4 (select .cse11 (+ (* .cse5 4) v_~f~0.offset_422))) (.cse6 (select .cse11 (+ v_~f~0.offset_422 (* .cse7 4))))) (let ((.cse13 (select .cse11 (+ (* .cse6 4) v_~f~0.offset_422))) (.cse8 (select .cse11 (+ v_~f~0.offset_422 (* 4 .cse4))))) (let ((.cse9 (select .cse11 (+ v_~f~0.offset_422 (* .cse8 4)))) (.cse12 (select .cse11 (+ v_~f~0.offset_422 (* .cse13 4))))) (let ((.cse3 (select .cse11 (+ v_~f~0.offset_422 (* .cse12 4)))) (.cse2 (select .cse11 (+ v_~f~0.offset_422 (* .cse9 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_428) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_428)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_373| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_413|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_373| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_428)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_524| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_657| 8) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_428)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_428)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_428)) 1 0) 0)) (not (= 0 (ite (and (< .cse6 v_~size~0_428) (<= 0 .cse6)) 1 0))) (not (= (ite (and (<= 0 v_~x1~0_872) (< v_~x1~0_872 v_~size~0_428)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_428) (<= 0 .cse7)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_753|) (not (= (ite (and (< .cse8 v_~size~0_428) (<= 0 .cse8)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_524|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_428)) 1 0) 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_644) (< v_~x2~0_644 v_~size~0_428)) 1 0))) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_428)) 1 0) 0)) (< 5 (* (mod v_~n~0_408 1073741824) 4)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_413| 0)) (= v_~x1~0_871 (select .cse11 (+ v_~f~0.offset_422 (* .cse3 4)))) (= v_~x2~0_642 (select .cse11 (+ v_~f~0.offset_422 (* .cse2 4)))) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_428)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_428) (<= 0 .cse13)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_644, ~size~0=v_~size~0_428, ~f~0.base=v_~f~0.base_422, #memory_int=|v_#memory_int_524|, ~n~0=v_~n~0_408, ~x1~0=v_~x1~0_872, ~f~0.offset=v_~f~0.offset_422} OutVars{~x2~0=v_~x2~0_642, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_514|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_307|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_325|, ~size~0=v_~size~0_428, ~f~0.base=v_~f~0.base_422, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_313|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_373|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_657|, ~x1~0=v_~x1~0_871, ~f~0.offset=v_~f~0.offset_422, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_413|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_307|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_305|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_753|, #memory_int=|v_#memory_int_524|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_319|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_524|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_319|, ~n~0=v_~n~0_408, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_321|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_524|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:11,306 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:11,393 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:11,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 08:02:11,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 08:02:11,611 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 08:02:11,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2306 [2022-12-06 08:02:11,612 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 962 transitions, 34019 flow [2022-12-06 08:02:11,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:11,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:11,612 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:11,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:11,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-06 08:02:11,813 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:11,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2121420979, now seen corresponding path program 2 times [2022-12-06 08:02:11,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:11,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655231344] [2022-12-06 08:02:11,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:11,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:11,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:11,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655231344] [2022-12-06 08:02:11,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655231344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:11,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477810655] [2022-12-06 08:02:11,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 08:02:11,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:11,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:11,892 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:11,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 08:02:12,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 08:02:12,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 08:02:12,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 08:02:12,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:12,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:02:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:12,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477810655] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:02:12,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:02:12,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 08:02:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004997092] [2022-12-06 08:02:12,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:02:12,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 08:02:12,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:12,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 08:02:12,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-06 08:02:12,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 143 [2022-12-06 08:02:12,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 962 transitions, 34019 flow. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:12,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:12,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 143 [2022-12-06 08:02:12,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:17,696 INFO L130 PetriNetUnfolder]: 4554/7887 cut-off events. [2022-12-06 08:02:17,697 INFO L131 PetriNetUnfolder]: For 651296/651296 co-relation queries the response was YES. [2022-12-06 08:02:17,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127334 conditions, 7887 events. 4554/7887 cut-off events. For 651296/651296 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 55070 event pairs, 1395 based on Foata normal form. 2/7886 useless extension candidates. Maximal degree in co-relation 127169. Up to 5812 conditions per place. [2022-12-06 08:02:17,830 INFO L137 encePairwiseOnDemand]: 85/143 looper letters, 845 selfloop transitions, 185 changer transitions 12/1042 dead transitions. [2022-12-06 08:02:17,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1042 transitions, 38211 flow [2022-12-06 08:02:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 08:02:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 08:02:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 182 transitions. [2022-12-06 08:02:17,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.0979020979020979 [2022-12-06 08:02:17,834 INFO L175 Difference]: Start difference. First operand has 349 places, 962 transitions, 34019 flow. Second operand 13 states and 182 transitions. [2022-12-06 08:02:17,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1042 transitions, 38211 flow [2022-12-06 08:02:20,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 1042 transitions, 37677 flow, removed 237 selfloop flow, removed 9 redundant places. [2022-12-06 08:02:20,463 INFO L231 Difference]: Finished difference. Result has 357 places, 968 transitions, 34365 flow [2022-12-06 08:02:20,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=33540, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=34365, PETRI_PLACES=357, PETRI_TRANSITIONS=968} [2022-12-06 08:02:20,466 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 336 predicate places. [2022-12-06 08:02:20,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:20,466 INFO L89 Accepts]: Start accepts. Operand has 357 places, 968 transitions, 34365 flow [2022-12-06 08:02:20,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:20,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:20,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 968 transitions, 34365 flow [2022-12-06 08:02:20,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 968 transitions, 34365 flow [2022-12-06 08:02:21,349 INFO L130 PetriNetUnfolder]: 1185/2830 cut-off events. [2022-12-06 08:02:21,349 INFO L131 PetriNetUnfolder]: For 259647/260755 co-relation queries the response was YES. [2022-12-06 08:02:21,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50524 conditions, 2830 events. 1185/2830 cut-off events. For 259647/260755 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22825 event pairs, 46 based on Foata normal form. 0/2785 useless extension candidates. Maximal degree in co-relation 49801. Up to 1762 conditions per place. [2022-12-06 08:02:21,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 353 places, 968 transitions, 34365 flow [2022-12-06 08:02:21,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 2486 [2022-12-06 08:02:21,430 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:21,523 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:21,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [833] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_349| v_~f~0.base_250))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_250 (* v_~x2~0_465 4))))) (let ((.cse13 (select .cse4 (+ v_~f~0.offset_250 (* 4 .cse6))))) (let ((.cse12 (select .cse4 (+ v_~f~0.offset_250 (* .cse13 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_250 (* .cse12 4)))) (.cse3 (select .cse4 (+ v_~f~0.offset_250 (* v_~x1~0_520 4))))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_250 (* 4 .cse3)))) (.cse16 (select .cse4 (+ v_~f~0.offset_250 (* .cse1 4))))) (let ((.cse14 (select .cse4 (+ v_~f~0.offset_250 (* .cse16 4)))) (.cse18 (select .cse4 (+ v_~f~0.offset_250 (* .cse9 4))))) (let ((.cse17 (select .cse4 (+ v_~f~0.offset_250 (* .cse18 4)))) (.cse7 (select .cse4 (+ v_~f~0.offset_250 (* .cse14 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_250 (* .cse7 4)))) (.cse2 (select .cse4 (+ v_~f~0.offset_250 (* .cse17 4))))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_250 (* .cse2 4)))) (.cse11 (select .cse4 (+ v_~f~0.offset_250 (* .cse8 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_250 (* .cse11 4)))) (.cse19 (select .cse4 (+ v_~f~0.offset_250 (* 4 .cse10))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_250 (* 4 .cse19)))) (.cse15 (select .cse4 (+ v_~f~0.offset_250 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_256) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_256)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_315| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_319|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_319| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_256) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_264| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304|) (= (select .cse4 (+ v_~f~0.offset_250 (* .cse5 4))) v_~x1~0_518) (not (= (ite (and (< v_~x1~0_520 v_~size~0_256) (<= 0 v_~x1~0_520)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_256) (<= 0 .cse7)) 1 0) 0)) (< 8 (* (mod v_~n~0_236 1073741824) 4)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_256) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_256) (<= 0 .cse12)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_399| 9) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304| 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_465 v_~size~0_256) (<= 0 v_~x2~0_465)) 1 0) 0)) (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_256)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_315|) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_256)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_410| 12) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_264| (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_256)) 1 0)) (not (= (ite (and (< .cse16 v_~size~0_256) (<= 0 .cse16)) 1 0) 0)) (not (= (ite (and (< .cse17 v_~size~0_256) (<= 0 .cse17)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_250 (* .cse15 4))) v_~x2~0_463) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_256)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_465, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_250, #memory_int=|v_#memory_int_349|, ~n~0=v_~n~0_236, ~x1~0=v_~x1~0_520, ~f~0.offset=v_~f~0.offset_250} OutVars{~x2~0=v_~x2~0_463, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_309|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_198|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_216|, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_250, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_204|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_264|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_410|, ~x1~0=v_~x1~0_518, ~f~0.offset=v_~f~0.offset_250, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_315|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_198|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_196|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_399|, #memory_int=|v_#memory_int_349|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_210|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_319|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_210|, ~n~0=v_~n~0_236, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_212|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_319|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [911] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~f~0.base_380))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_380 (* v_~x1~0_807 4)))) (.cse2 (* (mod v_~n~0_366 1073741824) 4))) (and (= v_~x1~0_805 (select .cse0 (+ v_~f~0.offset_380 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_474| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_386)) 1 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_675| 4294967295) 4294967296) .cse2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_677| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_474| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|) (not (= (ite (and (< v_~x1~0_807 v_~size~0_386) (<= 0 v_~x1~0_807)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_675| (+ |v_thread1Thread1of1ForFork0_~i~0#1_677| 2))))) InVars {~size~0=v_~size~0_386, ~f~0.base=v_~f~0.base_380, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_677|, #memory_int=|v_#memory_int_482|, ~n~0=v_~n~0_366, ~x1~0=v_~x1~0_807, ~f~0.offset=v_~f~0.offset_380} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_468|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_474|, ~size~0=v_~size~0_386, ~f~0.base=v_~f~0.base_380, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_675|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|, ~n~0=v_~n~0_366, ~x1~0=v_~x1~0_805, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_478|, ~f~0.offset=v_~f~0.offset_380} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:24,967 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [827] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_341| v_~f~0.base_242))) (let ((.cse11 (select .cse1 (+ v_~f~0.offset_242 (* v_~x2~0_445 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_242 (* .cse11 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_242 (* .cse5 4))))) (let ((.cse9 (select .cse1 (+ (* .cse10 4) v_~f~0.offset_242))) (.cse8 (select .cse1 (+ v_~f~0.offset_242 (* v_~x1~0_499 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_242 (* 4 .cse8)))) (.cse3 (select .cse1 (+ v_~f~0.offset_242 (* .cse9 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_242 (* .cse3 4)))) (.cse4 (select .cse1 (+ (* .cse0 4) v_~f~0.offset_242)))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_242 (* .cse4 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_242 (* .cse6 4))))) (and (not (= 0 (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_248)) 1 0))) (= (select .cse1 (+ (* .cse2 4) v_~f~0.offset_242)) v_~x2~0_443) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_387| 4294967295) 4294967296) (* (mod v_~n~0_228 1073741824) 4)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_248)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_248) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_292|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_248)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_248)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_242 (* .cse7 4))) v_~x1~0_498) (not (= 0 (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_248)) 1 0))) (not (= (ite (and (< .cse9 v_~size~0_248) (<= 0 .cse9)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307|) (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_248)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303|) (= |v_thread2Thread1of1ForFork1_~i~1#1_398| 8) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_292| 0)) (not (= (ite (and (<= 0 v_~x1~0_499) (< v_~x1~0_499 v_~size~0_248)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_248)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_248) (<= 0 .cse11)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_387| 5) (not (= (ite (and (<= 0 v_~x2~0_445) (< v_~x2~0_445 v_~size~0_248)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_248)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307| 0))))))))))) InVars {~x2~0=v_~x2~0_445, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_242, #memory_int=|v_#memory_int_341|, ~n~0=v_~n~0_228, ~x1~0=v_~x1~0_499, ~f~0.offset=v_~f~0.offset_242} OutVars{~x2~0=v_~x2~0_443, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_297|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_204|, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_242, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_192|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_398|, ~x1~0=v_~x1~0_498, ~f~0.offset=v_~f~0.offset_242, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_292|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_186|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_184|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_387|, #memory_int=|v_#memory_int_341|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_198|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_198|, ~n~0=v_~n~0_228, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_200|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_307|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:25,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [827] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_341| v_~f~0.base_242))) (let ((.cse11 (select .cse1 (+ v_~f~0.offset_242 (* v_~x2~0_445 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_242 (* .cse11 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_242 (* .cse5 4))))) (let ((.cse9 (select .cse1 (+ (* .cse10 4) v_~f~0.offset_242))) (.cse8 (select .cse1 (+ v_~f~0.offset_242 (* v_~x1~0_499 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_242 (* 4 .cse8)))) (.cse3 (select .cse1 (+ v_~f~0.offset_242 (* .cse9 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_242 (* .cse3 4)))) (.cse4 (select .cse1 (+ (* .cse0 4) v_~f~0.offset_242)))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_242 (* .cse4 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_242 (* .cse6 4))))) (and (not (= 0 (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_248)) 1 0))) (= (select .cse1 (+ (* .cse2 4) v_~f~0.offset_242)) v_~x2~0_443) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_387| 4294967295) 4294967296) (* (mod v_~n~0_228 1073741824) 4)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_248)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_248) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_292|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_248)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_248)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_242 (* .cse7 4))) v_~x1~0_498) (not (= 0 (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_248)) 1 0))) (not (= (ite (and (< .cse9 v_~size~0_248) (<= 0 .cse9)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307|) (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_248)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303|) (= |v_thread2Thread1of1ForFork1_~i~1#1_398| 8) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_292| 0)) (not (= (ite (and (<= 0 v_~x1~0_499) (< v_~x1~0_499 v_~size~0_248)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_248)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_248) (<= 0 .cse11)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_387| 5) (not (= (ite (and (<= 0 v_~x2~0_445) (< v_~x2~0_445 v_~size~0_248)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_248)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307| 0))))))))))) InVars {~x2~0=v_~x2~0_445, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_242, #memory_int=|v_#memory_int_341|, ~n~0=v_~n~0_228, ~x1~0=v_~x1~0_499, ~f~0.offset=v_~f~0.offset_242} OutVars{~x2~0=v_~x2~0_443, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_297|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_204|, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_242, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_192|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_398|, ~x1~0=v_~x1~0_498, ~f~0.offset=v_~f~0.offset_242, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_292|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_186|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_184|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_387|, #memory_int=|v_#memory_int_341|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_198|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_198|, ~n~0=v_~n~0_228, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_200|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_307|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:26,485 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 08:02:26,486 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6020 [2022-12-06 08:02:26,486 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 968 transitions, 34524 flow [2022-12-06 08:02:26,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:26,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:26,486 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:26,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:26,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 08:02:26,691 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:26,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:26,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1427584023, now seen corresponding path program 1 times [2022-12-06 08:02:26,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:26,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716634682] [2022-12-06 08:02:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:26,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 08:02:26,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:26,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716634682] [2022-12-06 08:02:26,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716634682] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:26,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455457616] [2022-12-06 08:02:26,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:26,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:26,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:26,763 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:26,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 08:02:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:26,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 08:02:26,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:26,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:02:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:27,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455457616] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:02:27,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:02:27,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 12 [2022-12-06 08:02:27,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403862654] [2022-12-06 08:02:27,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:02:27,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 08:02:27,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:27,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 08:02:27,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-06 08:02:27,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 146 [2022-12-06 08:02:27,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 968 transitions, 34524 flow. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:27,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:27,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 146 [2022-12-06 08:02:27,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:32,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:02:34,135 INFO L130 PetriNetUnfolder]: 4591/7981 cut-off events. [2022-12-06 08:02:34,135 INFO L131 PetriNetUnfolder]: For 755718/755718 co-relation queries the response was YES. [2022-12-06 08:02:34,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132187 conditions, 7981 events. 4591/7981 cut-off events. For 755718/755718 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 56268 event pairs, 1611 based on Foata normal form. 112/8090 useless extension candidates. Maximal degree in co-relation 129966. Up to 6946 conditions per place. [2022-12-06 08:02:34,244 INFO L137 encePairwiseOnDemand]: 87/146 looper letters, 870 selfloop transitions, 214 changer transitions 7/1091 dead transitions. [2022-12-06 08:02:34,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1091 transitions, 40070 flow [2022-12-06 08:02:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 08:02:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 08:02:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 212 transitions. [2022-12-06 08:02:34,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11169652265542676 [2022-12-06 08:02:34,245 INFO L175 Difference]: Start difference. First operand has 352 places, 968 transitions, 34524 flow. Second operand 13 states and 212 transitions. [2022-12-06 08:02:34,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1091 transitions, 40070 flow [2022-12-06 08:02:37,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 1091 transitions, 39405 flow, removed 331 selfloop flow, removed 6 redundant places. [2022-12-06 08:02:37,624 INFO L231 Difference]: Finished difference. Result has 362 places, 997 transitions, 35686 flow [2022-12-06 08:02:37,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=33645, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=35686, PETRI_PLACES=362, PETRI_TRANSITIONS=997} [2022-12-06 08:02:37,625 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 341 predicate places. [2022-12-06 08:02:37,625 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:37,625 INFO L89 Accepts]: Start accepts. Operand has 362 places, 997 transitions, 35686 flow [2022-12-06 08:02:37,647 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:37,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:37,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 362 places, 997 transitions, 35686 flow [2022-12-06 08:02:37,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 997 transitions, 35686 flow [2022-12-06 08:02:38,571 INFO L130 PetriNetUnfolder]: 1190/2888 cut-off events. [2022-12-06 08:02:38,571 INFO L131 PetriNetUnfolder]: For 255117/255962 co-relation queries the response was YES. [2022-12-06 08:02:38,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51141 conditions, 2888 events. 1190/2888 cut-off events. For 255117/255962 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 23808 event pairs, 40 based on Foata normal form. 0/2843 useless extension candidates. Maximal degree in co-relation 49987. Up to 1805 conditions per place. [2022-12-06 08:02:38,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 997 transitions, 35686 flow [2022-12-06 08:02:38,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 2536 [2022-12-06 08:02:38,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [961] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_552| v_~f~0.base_450))) (let ((.cse13 (select .cse1 (+ v_~f~0.offset_450 (* v_~x1~0_925 4)))) (.cse12 (select .cse1 (+ v_~f~0.offset_450 (* v_~x2~0_713 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_450 (* .cse12 4)))) (.cse3 (select .cse1 (+ v_~f~0.offset_450 (* .cse13 4))))) (let ((.cse11 (select .cse1 (+ v_~f~0.offset_450 (* .cse3 4)))) (.cse14 (select .cse1 (+ v_~f~0.offset_450 (* .cse5 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_450 (* .cse14 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_450 (* .cse11 4))))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_450 (* .cse4 4)))) (.cse6 (select .cse1 (+ v_~f~0.offset_450 (* .cse10 4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_450 (* .cse6 4)))) (.cse7 (select .cse1 (+ v_~f~0.offset_450 (* .cse9 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_450 (* 4 .cse7)))) (.cse2 (select .cse1 (+ v_~f~0.offset_450 (* .cse8 4))))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_456)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_558|) (< 7 (* (mod v_~n~0_436 1073741824) 4)) (= (select .cse1 (+ v_~f~0.offset_450 (* .cse2 4))) v_~x2~0_712) (not (= (ite (and (< v_~x1~0_925 v_~size~0_456) (<= 0 v_~x1~0_925)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_456) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_456) (<= 0 .cse4)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_450 (* .cse0 4))) v_~x1~0_923) (not (= (ite (and (< .cse5 v_~size~0_456) (<= 0 .cse5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_417| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_457|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_562| 0)) (not (= (ite (and (< .cse6 v_~size~0_456) (<= 0 .cse6)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_457| 0)) (= (ite (and (< .cse2 v_~size~0_456) (<= 0 .cse2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_417|) (not (= (ite (and (< .cse7 v_~size~0_456) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_456)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_456) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_713) (< v_~x2~0_713 v_~size~0_456)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_456)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_456) (<= 0 .cse11)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_558| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_562|) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_456)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_719| 8) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_456)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_456)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_823| 8)))))))))) InVars {~x2~0=v_~x2~0_713, ~size~0=v_~size~0_456, ~f~0.base=v_~f~0.base_450, #memory_int=|v_#memory_int_552|, ~n~0=v_~n~0_436, ~x1~0=v_~x1~0_925, ~f~0.offset=v_~f~0.offset_450} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_552|, ~x2~0=v_~x2~0_712, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_351|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_369|, ~size~0=v_~size~0_456, ~f~0.base=v_~f~0.base_450, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_357|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_417|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_719|, ~x1~0=v_~x1~0_923, ~f~0.offset=v_~f~0.offset_450, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_457|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_558|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_351|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_349|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_823|, #memory_int=|v_#memory_int_552|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_562|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_363|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_363|, ~n~0=v_~n~0_436, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_562|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_365|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:02:41,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:02:41,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3599 [2022-12-06 08:02:41,224 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 997 transitions, 35720 flow [2022-12-06 08:02:41,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:41,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:41,224 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:41,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:41,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 08:02:41,430 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:41,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:41,430 INFO L85 PathProgramCache]: Analyzing trace with hash -81264705, now seen corresponding path program 1 times [2022-12-06 08:02:41,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:41,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77202016] [2022-12-06 08:02:41,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:41,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:41,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77202016] [2022-12-06 08:02:41,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77202016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:41,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690084614] [2022-12-06 08:02:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:41,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:41,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:41,604 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:41,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 08:02:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:41,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 08:02:41,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 08:02:41,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:02:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 08:02:41,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690084614] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:02:41,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:02:41,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-12-06 08:02:41,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401803762] [2022-12-06 08:02:41,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:02:41,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 08:02:41,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:41,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 08:02:41,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-06 08:02:41,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 141 [2022-12-06 08:02:41,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 997 transitions, 35720 flow. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:41,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:41,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 141 [2022-12-06 08:02:41,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:45,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:02:49,349 INFO L130 PetriNetUnfolder]: 4852/8415 cut-off events. [2022-12-06 08:02:49,349 INFO L131 PetriNetUnfolder]: For 749628/749628 co-relation queries the response was YES. [2022-12-06 08:02:49,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138937 conditions, 8415 events. 4852/8415 cut-off events. For 749628/749628 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 59790 event pairs, 1062 based on Foata normal form. 32/8444 useless extension candidates. Maximal degree in co-relation 134798. Up to 5337 conditions per place. [2022-12-06 08:02:49,459 INFO L137 encePairwiseOnDemand]: 56/141 looper letters, 707 selfloop transitions, 497 changer transitions 19/1223 dead transitions. [2022-12-06 08:02:49,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 1223 transitions, 45198 flow [2022-12-06 08:02:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 08:02:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 08:02:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 257 transitions. [2022-12-06 08:02:49,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.07924761023743447 [2022-12-06 08:02:49,460 INFO L175 Difference]: Start difference. First operand has 357 places, 997 transitions, 35720 flow. Second operand 23 states and 257 transitions. [2022-12-06 08:02:49,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 1223 transitions, 45198 flow [2022-12-06 08:02:52,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 1223 transitions, 44519 flow, removed 299 selfloop flow, removed 3 redundant places. [2022-12-06 08:02:52,694 INFO L231 Difference]: Finished difference. Result has 386 places, 1056 transitions, 39079 flow [2022-12-06 08:02:52,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=35165, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=442, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=39079, PETRI_PLACES=386, PETRI_TRANSITIONS=1056} [2022-12-06 08:02:52,695 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 365 predicate places. [2022-12-06 08:02:52,695 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:52,695 INFO L89 Accepts]: Start accepts. Operand has 386 places, 1056 transitions, 39079 flow [2022-12-06 08:02:52,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:52,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:52,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 386 places, 1056 transitions, 39079 flow [2022-12-06 08:02:52,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 1056 transitions, 39079 flow [2022-12-06 08:02:53,743 INFO L130 PetriNetUnfolder]: 1251/3023 cut-off events. [2022-12-06 08:02:53,743 INFO L131 PetriNetUnfolder]: For 292928/293810 co-relation queries the response was YES. [2022-12-06 08:02:53,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55872 conditions, 3023 events. 1251/3023 cut-off events. For 292928/293810 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 25032 event pairs, 46 based on Foata normal form. 0/2977 useless extension candidates. Maximal degree in co-relation 55404. Up to 1904 conditions per place. [2022-12-06 08:02:53,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 385 places, 1056 transitions, 39079 flow [2022-12-06 08:02:53,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 2704 [2022-12-06 08:02:53,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [811] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_318| v_~f~0.base_222))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_222 (* v_~x2~0_410 4))))) (let ((.cse22 (select .cse0 (+ v_~f~0.offset_222 (* .cse7 4))))) (let ((.cse25 (select .cse0 (+ v_~f~0.offset_222 (* .cse22 4))))) (let ((.cse20 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse25))))) (let ((.cse23 (select .cse0 (+ v_~f~0.offset_222 (* .cse20 4))))) (let ((.cse13 (select .cse0 (+ v_~f~0.offset_222 (* .cse23 4)))) (.cse5 (select .cse0 (+ (* v_~x1~0_443 4) v_~f~0.offset_222)))) (let ((.cse15 (select .cse0 (+ v_~f~0.offset_222 (* .cse5 4)))) (.cse19 (select .cse0 (+ v_~f~0.offset_222 (* .cse13 4))))) (let ((.cse21 (select .cse0 (+ v_~f~0.offset_222 (* .cse19 4)))) (.cse12 (select .cse0 (+ v_~f~0.offset_222 (* .cse15 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_222 (* .cse12 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_222 (* .cse21 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_222 (* .cse6 4)))) (.cse18 (select .cse0 (+ v_~f~0.offset_222 (* .cse2 4))))) (let ((.cse24 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse18)))) (.cse14 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse11))))) (let ((.cse10 (select .cse0 (+ v_~f~0.offset_222 (* .cse14 4)))) (.cse16 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse24))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_222 (* .cse16 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_222 (* .cse10 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_222 (* .cse3 4)))) (.cse17 (select .cse0 (+ v_~f~0.offset_222 (* .cse4 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse17)))) (.cse8 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse9))))) (and (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_222)) v_~x1~0_442) (not (= (ite (and (< .cse2 v_~size~0_228) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_228)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270|) (not (= (ite (and (< .cse4 v_~size~0_228) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_228) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_228) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_410 v_~size~0_228) (<= 0 v_~x2~0_410)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_443) (< v_~x1~0_443 v_~size~0_228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_333| 11) (not (= (ite (and (< .cse7 v_~size~0_228) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_230| (ite (and (< .cse8 v_~size~0_228) (<= 0 .cse8)) 1 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_228) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266| (ite (and (< .cse1 v_~size~0_228) (<= 0 .cse1)) 1 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_228) (<= 0 .cse16)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_230| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270|) (not (= (ite (and (< .cse17 v_~size~0_228) (<= 0 .cse17)) 1 0) 0)) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (< .cse20 v_~size~0_228) (<= 0 .cse20)) 1 0) 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_368|) 4294967296) (* (mod v_~n~0_208 1073741824) 4)) (not (= (ite (and (< .cse21 v_~size~0_228) (<= 0 .cse21)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_222 (* .cse8 4))) v_~x2~0_408) (not (= (ite (and (<= 0 .cse22) (< .cse22 v_~size~0_228)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270| 0)) (not (= (ite (and (< .cse23 v_~size~0_228) (<= 0 .cse23)) 1 0) 0)) (not (= (ite (and (<= 0 .cse24) (< .cse24 v_~size~0_228)) 1 0) 0)) (= 16 |v_thread2Thread1of1ForFork1_~i~1#1_368|) (not (= (ite (and (<= 0 .cse25) (< .cse25 v_~size~0_228)) 1 0) 0))))))))))))))))))) InVars {~x2~0=v_~x2~0_410, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_222, #memory_int=|v_#memory_int_318|, ~n~0=v_~n~0_208, ~x1~0=v_~x1~0_443, ~f~0.offset=v_~f~0.offset_222} OutVars{~x2~0=v_~x2~0_408, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_260|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_164|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_182|, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_222, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_170|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_230|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_368|, ~x1~0=v_~x1~0_442, ~f~0.offset=v_~f~0.offset_222, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_164|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_162|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_333|, #memory_int=|v_#memory_int_318|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_176|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_176|, ~n~0=v_~n~0_208, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_178|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_270|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [818] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_331| v_~f~0.base_232))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_232 (* v_~x2~0_429 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_232 (* .cse1 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_232 (* 4 .cse3)))) (.cse4 (* (mod v_~n~0_218 1073741824) 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243| (ite (and (< .cse0 v_~size~0_238) (<= 0 .cse0)) 1 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_238)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_386| 4) |v_thread2Thread1of1ForFork1_~i~1#1_385|) (not (= (ite (and (< v_~x2~0_429 v_~size~0_238) (<= 0 v_~x2~0_429)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_232 (* .cse0 4))) v_~x2~0_428) (= |v_thread1Thread1of1ForFork0_~i~0#1_359| (+ |v_thread1Thread1of1ForFork0_~i~0#1_360| 1)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_238)) 1 0) 0)) (= (ite (and (<= 0 v_~x1~0_469) (< v_~x1~0_469 v_~size~0_238)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_283|) (= (select .cse2 (+ v_~f~0.offset_232 (* v_~x1~0_469 4))) v_~x1~0_468) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_283| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_360| 4294967296) .cse4) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_386| 4294967296) .cse4)))))) InVars {~x2~0=v_~x2~0_429, ~size~0=v_~size~0_238, ~f~0.base=v_~f~0.base_232, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_360|, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_386|, ~n~0=v_~n~0_218, ~x1~0=v_~x1~0_469, ~f~0.offset=v_~f~0.offset_232} OutVars{~x2~0=v_~x2~0_428, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_277|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_177|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_195|, ~size~0=v_~size~0_238, ~f~0.base=v_~f~0.base_232, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_183|, 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_385|, ~x1~0=v_~x1~0_468, ~f~0.offset=v_~f~0.offset_232, 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_283|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_177|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_175|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_359|, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_189|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_189|, ~n~0=v_~n~0_218, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_191|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_287|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:59,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:02:59,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6957 [2022-12-06 08:02:59,652 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 1056 transitions, 39081 flow [2022-12-06 08:02:59,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:59,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:59,652 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:59,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:59,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-12-06 08:02:59,858 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:59,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1544476266, now seen corresponding path program 1 times [2022-12-06 08:02:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:59,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764476585] [2022-12-06 08:02:59,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:59,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:59,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:59,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764476585] [2022-12-06 08:02:59,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764476585] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:59,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242337569] [2022-12-06 08:02:59,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:59,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:59,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:59,935 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:59,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-06 08:03:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:00,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 08:03:00,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:03:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:00,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:03:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:00,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242337569] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:03:00,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:03:00,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 08:03:00,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926325170] [2022-12-06 08:03:00,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:03:00,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 08:03:00,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:03:00,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 08:03:00,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-06 08:03:00,200 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 141 [2022-12-06 08:03:00,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 1056 transitions, 39081 flow. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:00,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:03:00,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 141 [2022-12-06 08:03:00,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:03:04,833 INFO L130 PetriNetUnfolder]: 4853/8403 cut-off events. [2022-12-06 08:03:04,833 INFO L131 PetriNetUnfolder]: For 746767/746767 co-relation queries the response was YES. [2022-12-06 08:03:04,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141457 conditions, 8403 events. 4853/8403 cut-off events. For 746767/746767 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 59572 event pairs, 1296 based on Foata normal form. 12/8412 useless extension candidates. Maximal degree in co-relation 140198. Up to 5796 conditions per place. [2022-12-06 08:03:04,957 INFO L137 encePairwiseOnDemand]: 58/141 looper letters, 715 selfloop transitions, 455 changer transitions 0/1170 dead transitions. [2022-12-06 08:03:04,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 1170 transitions, 45232 flow [2022-12-06 08:03:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 08:03:04,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 08:03:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 210 transitions. [2022-12-06 08:03:04,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09308510638297872 [2022-12-06 08:03:04,966 INFO L175 Difference]: Start difference. First operand has 385 places, 1056 transitions, 39081 flow. Second operand 16 states and 210 transitions. [2022-12-06 08:03:04,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 1170 transitions, 45232 flow [2022-12-06 08:03:08,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 1170 transitions, 44280 flow, removed 362 selfloop flow, removed 9 redundant places. [2022-12-06 08:03:08,925 INFO L231 Difference]: Finished difference. Result has 392 places, 1060 transitions, 39285 flow [2022-12-06 08:03:08,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=38159, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=451, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=39285, PETRI_PLACES=392, PETRI_TRANSITIONS=1060} [2022-12-06 08:03:08,934 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 371 predicate places. [2022-12-06 08:03:08,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:03:08,934 INFO L89 Accepts]: Start accepts. Operand has 392 places, 1060 transitions, 39285 flow [2022-12-06 08:03:08,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:03:08,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:03:08,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 392 places, 1060 transitions, 39285 flow [2022-12-06 08:03:08,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 392 places, 1060 transitions, 39285 flow [2022-12-06 08:03:09,908 INFO L130 PetriNetUnfolder]: 1259/3038 cut-off events. [2022-12-06 08:03:09,909 INFO L131 PetriNetUnfolder]: For 301101/302072 co-relation queries the response was YES. [2022-12-06 08:03:09,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55991 conditions, 3038 events. 1259/3038 cut-off events. For 301101/302072 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 25153 event pairs, 42 based on Foata normal form. 0/2989 useless extension candidates. Maximal degree in co-relation 55535. Up to 1824 conditions per place. [2022-12-06 08:03:09,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 392 places, 1060 transitions, 39285 flow [2022-12-06 08:03:09,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 2720 [2022-12-06 08:03:09,977 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:03:09,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1044 [2022-12-06 08:03:09,978 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 1060 transitions, 39285 flow [2022-12-06 08:03:09,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:09,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:03:09,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:03:09,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-06 08:03:10,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:03:10,184 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:03:10,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:03:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash 227366696, now seen corresponding path program 1 times [2022-12-06 08:03:10,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:03:10,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44987229] [2022-12-06 08:03:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:10,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:03:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:42,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:03:42,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44987229] [2022-12-06 08:03:42,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44987229] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:03:42,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472153110] [2022-12-06 08:03:42,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:42,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:03:42,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:03:42,882 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:03:42,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-06 08:03:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:43,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 08:03:43,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:03:43,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:03:43,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 99 treesize of output 266 [2022-12-06 08:03:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:44,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:03:49,175 INFO L321 Elim1Store]: treesize reduction 40, result has 96.3 percent of original size [2022-12-06 08:03:49,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 30 new quantified variables, introduced 120 case distinctions, treesize of input 131 treesize of output 1152 [2022-12-06 08:04:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:04:54,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472153110] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:04:54,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:04:54,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 18 [2022-12-06 08:04:54,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84720608] [2022-12-06 08:04:54,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:04:54,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 08:04:54,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:04:54,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 08:04:54,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-12-06 08:04:54,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 141 [2022-12-06 08:04:54,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 1060 transitions, 39285 flow. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:04:54,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:04:54,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 141 [2022-12-06 08:04:54,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:05:35,329 INFO L130 PetriNetUnfolder]: 5077/8783 cut-off events. [2022-12-06 08:05:35,330 INFO L131 PetriNetUnfolder]: For 767202/767202 co-relation queries the response was YES. [2022-12-06 08:05:35,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147402 conditions, 8783 events. 5077/8783 cut-off events. For 767202/767202 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 62506 event pairs, 433 based on Foata normal form. 1/8779 useless extension candidates. Maximal degree in co-relation 145997. Up to 8273 conditions per place. [2022-12-06 08:05:35,461 INFO L137 encePairwiseOnDemand]: 75/141 looper letters, 954 selfloop transitions, 229 changer transitions 3/1186 dead transitions. [2022-12-06 08:05:35,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 1186 transitions, 45739 flow [2022-12-06 08:05:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 08:05:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 08:05:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 218 transitions. [2022-12-06 08:05:35,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09663120567375887 [2022-12-06 08:05:35,476 INFO L175 Difference]: Start difference. First operand has 392 places, 1060 transitions, 39285 flow. Second operand 16 states and 218 transitions. [2022-12-06 08:05:35,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 1186 transitions, 45739 flow [2022-12-06 08:05:39,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 1186 transitions, 44917 flow, removed 217 selfloop flow, removed 7 redundant places. [2022-12-06 08:05:39,310 INFO L231 Difference]: Finished difference. Result has 406 places, 1148 transitions, 42752 flow [2022-12-06 08:05:39,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=38534, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=856, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=42752, PETRI_PLACES=406, PETRI_TRANSITIONS=1148} [2022-12-06 08:05:39,311 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 385 predicate places. [2022-12-06 08:05:39,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:05:39,312 INFO L89 Accepts]: Start accepts. Operand has 406 places, 1148 transitions, 42752 flow [2022-12-06 08:05:39,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:05:39,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:05:39,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 406 places, 1148 transitions, 42752 flow [2022-12-06 08:05:39,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 406 places, 1148 transitions, 42752 flow [2022-12-06 08:05:40,503 INFO L130 PetriNetUnfolder]: 1318/3184 cut-off events. [2022-12-06 08:05:40,503 INFO L131 PetriNetUnfolder]: For 313403/314344 co-relation queries the response was YES. [2022-12-06 08:05:40,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58808 conditions, 3184 events. 1318/3184 cut-off events. For 313403/314344 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 26620 event pairs, 43 based on Foata normal form. 0/3136 useless extension candidates. Maximal degree in co-relation 58289. Up to 1905 conditions per place. [2022-12-06 08:05:40,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 406 places, 1148 transitions, 42752 flow [2022-12-06 08:05:40,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 2926 [2022-12-06 08:05:42,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_215| v_~f~0.base_134))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_134 (* v_~x1~0_184 4)))) (.cse1 (* (mod v_~n~0_118 1073741824) 4))) (and (not (= (ite (and (< v_~x1~0_184 v_~size~0_140) (<= 0 v_~x1~0_184)) 1 0) 0)) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_140)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_130| 4294967295) 4294967296) .cse1) (= (select .cse2 (+ v_~f~0.offset_134 (* 4 .cse0))) v_~x1~0_182) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_132| 2) |v_thread1Thread1of1ForFork0_~i~0#1_130|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_132| 4294967296) .cse1)))) InVars {~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_134, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_132|, #memory_int=|v_#memory_int_215|, ~n~0=v_~n~0_118, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_134} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_91|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_134, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_130|, #memory_int=|v_#memory_int_215|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|, ~n~0=v_~n~0_118, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_101|, ~f~0.offset=v_~f~0.offset_134} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:05:43,307 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_215| v_~f~0.base_134))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_134 (* v_~x1~0_184 4)))) (.cse1 (* (mod v_~n~0_118 1073741824) 4))) (and (not (= (ite (and (< v_~x1~0_184 v_~size~0_140) (<= 0 v_~x1~0_184)) 1 0) 0)) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_140)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_130| 4294967295) 4294967296) .cse1) (= (select .cse2 (+ v_~f~0.offset_134 (* 4 .cse0))) v_~x1~0_182) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_132| 2) |v_thread1Thread1of1ForFork0_~i~0#1_130|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_132| 4294967296) .cse1)))) InVars {~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_134, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_132|, #memory_int=|v_#memory_int_215|, ~n~0=v_~n~0_118, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_134} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_91|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_134, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_130|, #memory_int=|v_#memory_int_215|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|, ~n~0=v_~n~0_118, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_101|, ~f~0.offset=v_~f~0.offset_134} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [851] L59-2-->L49-2: Formula: (let ((.cse0 (* (mod v_~n~0_268 1073741824) 4))) (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_81| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_81|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_358| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_354| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_358|) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_448| 4294967296) .cse0)) (= (select (select |v_#memory_int_381| v_~f~0.base_282) (+ v_~f~0.offset_282 (* v_~x1~0_590 4))) v_~x1~0_589) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_467| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_466| (+ |v_thread1Thread1of1ForFork0_~i~0#1_467| 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_354| (ite (and (< v_~x1~0_590 v_~size~0_288) (<= 0 v_~x1~0_590)) 1 0)))) InVars {~size~0=v_~size~0_288, ~f~0.base=v_~f~0.base_282, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_467|, #memory_int=|v_#memory_int_381|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_448|, ~n~0=v_~n~0_268, ~x1~0=v_~x1~0_590, ~f~0.offset=v_~f~0.offset_282} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_348|, ~size~0=v_~size~0_288, ~f~0.base=v_~f~0.base_282, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_81|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_448|, ~x1~0=v_~x1~0_589, ~f~0.offset=v_~f~0.offset_282, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_354|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_81|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_466|, #memory_int=|v_#memory_int_381|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_358|, ~n~0=v_~n~0_268, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_358|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:05:43,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [783] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_275| v_~f~0.base_188))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_188 (* v_~x2~0_331 4))))) (let ((.cse14 (select .cse0 (+ v_~f~0.offset_188 (* .cse11 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_188 (* .cse14 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_188 (* 4 .cse2))))) (let ((.cse13 (select .cse0 (+ v_~f~0.offset_188 (* .cse3 4))))) (let ((.cse12 (select .cse0 (+ v_~f~0.offset_188 (* .cse13 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_188 (* .cse12 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_188 (* .cse8 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_188 (* v_~x1~0_341 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_188 (* .cse7 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_188 (* 4 .cse6)))) (.cse10 (select .cse0 (+ v_~f~0.offset_188 (* .cse5 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_188 (* .cse10 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_188 (* .cse9 4))))) (and (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_301|) 4294967296) (* (mod v_~n~0_174 1073741824) 4)) (= v_~x1~0_339 (select .cse0 (+ v_~f~0.offset_188 (* 4 .cse1)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_301| 12) (not (= (ite (and (< .cse2 v_~size~0_194) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_331 v_~size~0_194) (<= 0 v_~x2~0_331)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_194)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_194)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_224| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_204| 0)) (not (= (ite (and (<= 0 v_~x1~0_341) (< v_~x1~0_341 v_~size~0_194)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_184| (ite (and (< .cse4 v_~size~0_194) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse5 v_~size~0_194) (<= 0 .cse5)) 1 0) 0)) (= v_~x2~0_330 (select .cse0 (+ v_~f~0.offset_188 (* 4 .cse4)))) (not (= (ite (and (< .cse6 v_~size~0_194) (<= 0 .cse6)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_264| 4) (not (= (ite (and (< .cse7 v_~size~0_194) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_194) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_194) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_194) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_194)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_194) (<= 0 .cse12)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_204|) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_194)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_184| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_224|) (not (= (ite (and (< .cse14 v_~size~0_194) (<= 0 .cse14)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_331, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_188, #memory_int=|v_#memory_int_275|, ~n~0=v_~n~0_174, ~x1~0=v_~x1~0_341, ~f~0.offset=v_~f~0.offset_188} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_194|, ~x2~0=v_~x2~0_330, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_118|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_136|, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_188, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_124|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_184|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_301|, ~x1~0=v_~x1~0_339, ~f~0.offset=v_~f~0.offset_188, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_224|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_118|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_116|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_264|, #memory_int=|v_#memory_int_275|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_204|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_130|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_130|, ~n~0=v_~n~0_174, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_204|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_132|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:05:45,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:05:45,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:05:46,143 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 08:05:46,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6831 [2022-12-06 08:05:46,143 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 1145 transitions, 42778 flow [2022-12-06 08:05:46,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:05:46,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:05:46,144 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:05:46,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-06 08:05:46,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:05:46,349 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:05:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:05:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash 449878651, now seen corresponding path program 1 times [2022-12-06 08:05:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:05:46,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274223577] [2022-12-06 08:05:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:05:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:05:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:05:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:05:46,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:05:46,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274223577] [2022-12-06 08:05:46,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274223577] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:05:46,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463001978] [2022-12-06 08:05:46,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:05:46,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:05:46,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:05:46,463 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:05:46,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-06 08:05:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:05:46,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 99 conjunts are in the unsatisfiable core [2022-12-06 08:05:46,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:05:46,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:05:46,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 08:05:46,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 08:05:46,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 08:05:47,958 INFO L321 Elim1Store]: treesize reduction 910, result has 5.3 percent of original size [2022-12-06 08:05:47,958 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 31 new quantified variables, introduced 120 case distinctions, treesize of input 345 treesize of output 150 [2022-12-06 08:05:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 08:05:48,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:05:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:05:56,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463001978] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:05:56,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:05:56,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 19 [2022-12-06 08:05:56,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603243048] [2022-12-06 08:05:56,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:05:56,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 08:05:56,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:05:56,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 08:05:56,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=285, Unknown=2, NotChecked=0, Total=342 [2022-12-06 08:05:56,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 150 [2022-12-06 08:05:56,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 1145 transitions, 42778 flow. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:05:56,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:05:56,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 150 [2022-12-06 08:05:56,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:07:12,257 WARN L233 SmtUtils]: Spent 1.24m on a formula simplification. DAG size of input: 371 DAG size of output: 331 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-12-06 08:07:58,467 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 08:07:58,467 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 08:07:59,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-06 08:07:59,673 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-06 08:07:59,708 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-06 08:07:59,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 08:07:59,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 08:07:59,709 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.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) 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:500) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:238) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 08:07:59,712 INFO L158 Benchmark]: Toolchain (without parser) took 844833.30ms. Allocated memory was 167.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 143.2MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-06 08:07:59,712 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 08:07:59,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.92ms. Allocated memory is still 167.8MB. Free memory was 143.2MB in the beginning and 131.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 08:07:59,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.77ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 08:07:59,712 INFO L158 Benchmark]: Boogie Preprocessor took 32.43ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 128.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 08:07:59,713 INFO L158 Benchmark]: RCFGBuilder took 419.86ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 110.7MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 08:07:59,713 INFO L158 Benchmark]: TraceAbstraction took 844099.62ms. Allocated memory was 167.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 110.2MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-06 08:07:59,713 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.92ms. Allocated memory is still 167.8MB. Free memory was 143.2MB in the beginning and 131.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.77ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.43ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 128.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 419.86ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 110.7MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 844099.62ms. Allocated memory was 167.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 110.2MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 161 PlacesBefore, 21 PlacesAfterwards, 170 TransitionsBefore, 17 TransitionsAfterwards, 3242 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 71 ConcurrentYvCompositions, 13 ChoiceCompositions, 153 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2093, independent: 2091, independent conditional: 2091, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2093, independent: 2091, independent conditional: 0, independent unconditional: 2091, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2093, independent: 2091, independent conditional: 0, independent unconditional: 2091, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2093, independent: 2091, independent conditional: 0, independent unconditional: 2091, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1903, independent: 1901, independent conditional: 0, independent unconditional: 1901, 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: 1903, independent: 1901, independent conditional: 0, independent unconditional: 1901, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2093, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1903, unknown conditional: 0, unknown unconditional: 1903] , Statistics on independence cache: Total cache size (in pairs): 3766, Positive cache size: 3764, Positive conditional cache size: 0, Positive unconditional cache size: 3764, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 37 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 5, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 17, Positive cache size: 17, Positive conditional cache size: 7, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 37 PlacesBefore, 36 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 11, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 37 PlacesBefore, 37 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 26, Positive conditional cache size: 16, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 45 PlacesBefore, 44 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 37, Positive conditional cache size: 27, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 37, Positive conditional cache size: 27, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 65 PlacesBefore, 64 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 9, independent: 0, independent conditional: 0, 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): 67, Positive cache size: 67, Positive conditional cache size: 57, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 75 PlacesBefore, 75 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 70, Positive conditional cache size: 60, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 70, Positive conditional cache size: 60, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 77 PlacesBefore, 77 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 12, independent: 3, independent conditional: 3, 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): 79, Positive cache size: 79, Positive conditional cache size: 69, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 90 PlacesBefore, 89 PlacesAfterwards, 95 TransitionsBefore, 94 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 8, independent: 4, independent conditional: 4, 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): 100, Positive cache size: 100, Positive conditional cache size: 90, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 107 PlacesBefore, 107 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 119, Positive conditional cache size: 109, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 110 PlacesBefore, 110 PlacesAfterwards, 139 TransitionsBefore, 139 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 122, Positive conditional cache size: 112, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 120 PlacesBefore, 120 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 7, independent: 3, independent conditional: 3, 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): 126, Positive cache size: 126, Positive conditional cache size: 116, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 126 PlacesBefore, 125 PlacesAfterwards, 159 TransitionsBefore, 158 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 129, Positive conditional cache size: 119, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 133 PlacesBefore, 132 PlacesAfterwards, 179 TransitionsBefore, 178 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 9, independent: 2, independent conditional: 2, 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): 136, Positive cache size: 136, Positive conditional cache size: 126, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 147 PlacesBefore, 147 PlacesAfterwards, 248 TransitionsBefore, 248 TransitionsAfterwards, 930 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 139, Positive conditional cache size: 129, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 142 PlacesBefore, 142 PlacesAfterwards, 245 TransitionsBefore, 245 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 144, Positive conditional cache size: 134, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 144 PlacesBefore, 144 PlacesAfterwards, 246 TransitionsBefore, 246 TransitionsAfterwards, 914 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 145, Positive conditional cache size: 135, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 144 PlacesBefore, 144 PlacesAfterwards, 249 TransitionsBefore, 249 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 145, Positive conditional cache size: 135, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 149 PlacesBefore, 149 PlacesAfterwards, 253 TransitionsBefore, 253 TransitionsAfterwards, 942 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 145, Positive conditional cache size: 135, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 152 PlacesBefore, 152 PlacesAfterwards, 265 TransitionsBefore, 265 TransitionsAfterwards, 996 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 145, Positive conditional cache size: 135, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 185 PlacesBefore, 184 PlacesAfterwards, 351 TransitionsBefore, 350 TransitionsAfterwards, 1146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 149, Positive conditional cache size: 139, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 185 PlacesBefore, 185 PlacesAfterwards, 434 TransitionsBefore, 434 TransitionsAfterwards, 1474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 202, Positive conditional cache size: 192, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 199 PlacesBefore, 199 PlacesAfterwards, 458 TransitionsBefore, 458 TransitionsAfterwards, 1566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 233, Positive conditional cache size: 223, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2s, 206 PlacesBefore, 205 PlacesAfterwards, 461 TransitionsBefore, 460 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 9, independent: 5, independent conditional: 5, 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): 266, Positive cache size: 266, Positive conditional cache size: 256, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 224 PlacesBefore, 223 PlacesAfterwards, 620 TransitionsBefore, 619 TransitionsAfterwards, 1708 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 269, Positive conditional cache size: 259, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 222 PlacesBefore, 222 PlacesAfterwards, 620 TransitionsBefore, 620 TransitionsAfterwards, 1718 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 269, Positive conditional cache size: 259, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 230 PlacesBefore, 230 PlacesAfterwards, 634 TransitionsBefore, 634 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 272, Positive conditional cache size: 262, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 244 PlacesBefore, 244 PlacesAfterwards, 654 TransitionsBefore, 654 TransitionsAfterwards, 1794 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 12, independent: 7, independent conditional: 7, 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): 303, Positive cache size: 303, Positive conditional cache size: 292, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 257 PlacesBefore, 257 PlacesAfterwards, 674 TransitionsBefore, 674 TransitionsAfterwards, 1828 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 340, Positive conditional cache size: 329, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 266 PlacesBefore, 266 PlacesAfterwards, 692 TransitionsBefore, 692 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 340, Positive conditional cache size: 329, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 272 PlacesBefore, 272 PlacesAfterwards, 689 TransitionsBefore, 689 TransitionsAfterwards, 1774 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 352, Positive conditional cache size: 341, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.6s, 273 PlacesBefore, 270 PlacesAfterwards, 687 TransitionsBefore, 685 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 13, independent: 12, independent conditional: 12, 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): 387, Positive cache size: 387, Positive conditional cache size: 376, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 282 PlacesBefore, 277 PlacesAfterwards, 701 TransitionsBefore, 696 TransitionsAfterwards, 1780 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 24, independent conditional: 24, 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): 413, Positive cache size: 413, Positive conditional cache size: 402, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 270 PlacesBefore, 270 PlacesAfterwards, 702 TransitionsBefore, 702 TransitionsAfterwards, 1758 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 413, Positive conditional cache size: 402, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 281 PlacesBefore, 281 PlacesAfterwards, 763 TransitionsBefore, 763 TransitionsAfterwards, 1902 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 413, Positive conditional cache size: 402, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 287 PlacesBefore, 287 PlacesAfterwards, 793 TransitionsBefore, 793 TransitionsAfterwards, 1986 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 413, Positive conditional cache size: 402, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 308 PlacesBefore, 308 PlacesAfterwards, 873 TransitionsBefore, 873 TransitionsAfterwards, 2234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 413, Positive conditional cache size: 402, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 323 PlacesBefore, 323 PlacesAfterwards, 931 TransitionsBefore, 931 TransitionsAfterwards, 2394 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 414, Positive conditional cache size: 403, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 349 PlacesBefore, 349 PlacesAfterwards, 962 TransitionsBefore, 962 TransitionsAfterwards, 2470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 5, independent: 3, independent conditional: 3, 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): 416, Positive cache size: 416, Positive conditional cache size: 405, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 353 PlacesBefore, 352 PlacesAfterwards, 968 TransitionsBefore, 968 TransitionsAfterwards, 2486 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 6, independent: 5, independent conditional: 5, 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): 417, Positive cache size: 417, Positive conditional cache size: 406, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 357 PlacesBefore, 357 PlacesAfterwards, 997 TransitionsBefore, 997 TransitionsAfterwards, 2536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 418, Positive cache size: 418, Positive conditional cache size: 407, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 385 PlacesBefore, 385 PlacesAfterwards, 1056 TransitionsBefore, 1056 TransitionsAfterwards, 2704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 419, Positive conditional cache size: 408, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 392 PlacesBefore, 392 PlacesAfterwards, 1060 TransitionsBefore, 1060 TransitionsAfterwards, 2720 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 419, Positive conditional cache size: 408, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 406 PlacesBefore, 403 PlacesAfterwards, 1148 TransitionsBefore, 1145 TransitionsAfterwards, 2926 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 9, independent: 5, independent conditional: 5, 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): 445, Positive cache size: 445, Positive conditional cache size: 434, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - 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