/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:29:00,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:29:00,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:29:00,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:29:00,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:29:01,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:29:01,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:29:01,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:29:01,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:29:01,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:29:01,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:29:01,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:29:01,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:29:01,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:29:01,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:29:01,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:29:01,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:29:01,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:29:01,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:29:01,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:29:01,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:29:01,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:29:01,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:29:01,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:29:01,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:29:01,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:29:01,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:29:01,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:29:01,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:29:01,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:29:01,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:29:01,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:29:01,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:29:01,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:29:01,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:29:01,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:29:01,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:29:01,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:29:01,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:29:01,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:29:01,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:29:01,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:29:01,070 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:29:01,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:29:01,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:29:01,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:29:01,072 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:29:01,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:29:01,073 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:29:01,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:29:01,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:29:01,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:29:01,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:29:01,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:29:01,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:29:01,074 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:29:01,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:29:01,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:29:01,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:29:01,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:29:01,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:29:01,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:29:01,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:29:01,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:29:01,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:29:01,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:29:01,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:29:01,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:29:01,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:29:01,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:29:01,076 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 00:29:01,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:29:01,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:29:01,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:29:01,356 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:29:01,356 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:29:01,357 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 00:29:02,314 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:29:02,512 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:29:02,512 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2022-12-06 00:29:02,517 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f96cd8a/8f45b6b1f2134abd8a697ce89dda5993/FLAG38b0d8b16 [2022-12-06 00:29:02,531 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f96cd8a/8f45b6b1f2134abd8a697ce89dda5993 [2022-12-06 00:29:02,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:29:02,534 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:29:02,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:29:02,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:29:02,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:29:02,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243613c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02, skipping insertion in model container [2022-12-06 00:29:02,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:29:02,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:29:02,667 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 00:29:02,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:29:02,676 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:29:02,690 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 00:29:02,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:29:02,700 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:29:02,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02 WrapperNode [2022-12-06 00:29:02,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:29:02,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:29:02,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:29:02,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:29:02,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,725 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 154 [2022-12-06 00:29:02,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:29:02,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:29:02,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:29:02,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:29:02,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,749 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:29:02,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:29:02,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:29:02,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:29:02,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (1/1) ... [2022-12-06 00:29:02,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:29:02,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:02,781 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 00:29:02,790 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 00:29:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:29:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:29:02,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:29:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:29:02,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:29:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:29:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:29:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:29:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:29:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:29:02,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:29:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:29:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:29:02,807 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 00:29:02,871 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:29:02,872 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:29:03,112 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:29:03,119 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:29:03,120 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 00:29:03,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:29:03 BoogieIcfgContainer [2022-12-06 00:29:03,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:29:03,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:29:03,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:29:03,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:29:03,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:29:02" (1/3) ... [2022-12-06 00:29:03,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50684d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:29:03, skipping insertion in model container [2022-12-06 00:29:03,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:29:02" (2/3) ... [2022-12-06 00:29:03,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50684d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:29:03, skipping insertion in model container [2022-12-06 00:29:03,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:29:03" (3/3) ... [2022-12-06 00:29:03,129 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2022-12-06 00:29:03,142 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:29:03,142 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:29:03,143 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:29:03,222 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:29:03,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 180 transitions, 376 flow [2022-12-06 00:29:03,327 INFO L130 PetriNetUnfolder]: 16/178 cut-off events. [2022-12-06 00:29:03,327 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:29:03,346 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 00:29:03,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 180 transitions, 376 flow [2022-12-06 00:29:03,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 170 transitions, 352 flow [2022-12-06 00:29:03,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:03,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 170 transitions, 352 flow [2022-12-06 00:29:03,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 170 transitions, 352 flow [2022-12-06 00:29:03,391 INFO L130 PetriNetUnfolder]: 16/170 cut-off events. [2022-12-06 00:29:03,391 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:29:03,392 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 00:29:03,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 170 transitions, 352 flow [2022-12-06 00:29:03,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 3242 [2022-12-06 00:29:07,861 INFO L203 LiptonReduction]: Total number of compositions: 153 [2022-12-06 00:29:07,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:29:07,877 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;@1e3f94f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:29:07,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:29:07,880 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 00:29:07,880 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:29:07,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:07,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:07,881 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 00:29:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash -862149159, now seen corresponding path program 1 times [2022-12-06 00:29:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:07,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633386619] [2022-12-06 00:29:07,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:08,183 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 00:29:08,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:08,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633386619] [2022-12-06 00:29:08,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633386619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:08,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:08,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:29:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538162033] [2022-12-06 00:29:08,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:08,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:29:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:08,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:29:08,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:29:08,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 00:29:08,204 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 00:29:08,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:08,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 00:29:08,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:08,249 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-06 00:29:08,249 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 00:29:08,249 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 00:29:08,250 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 00:29:08,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 00:29:08,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:29:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:29:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 00:29:08,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 00:29:08,260 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 00:29:08,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 00:29:08,262 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 00:29:08,263 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 00:29:08,264 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 00:29:08,266 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 00:29:08,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:08,267 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 00:29:08,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:08,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:08,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 00:29:08,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 00:29:08,273 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 00:29:08,274 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:29:08,274 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 00:29:08,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 00:29:08,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 00:29:08,876 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:08,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 611 [2022-12-06 00:29:08,877 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 00:29:08,877 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 00:29:08,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:08,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:08,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:29:08,878 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 00:29:08,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:08,878 INFO L85 PathProgramCache]: Analyzing trace with hash -552535443, now seen corresponding path program 1 times [2022-12-06 00:29:08,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:08,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114222349] [2022-12-06 00:29:08,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:08,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:08,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114222349] [2022-12-06 00:29:08,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114222349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:08,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:08,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:29:08,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87816405] [2022-12-06 00:29:08,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:08,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:29:08,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:08,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:29:08,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:29:08,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 00:29:08,993 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 00:29:08,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:08,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 00:29:08,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:09,027 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 00:29:09,027 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:29:09,028 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 00:29:09,028 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 00:29:09,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-06 00:29:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:29:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:29:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 00:29:09,029 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 00:29:09,029 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 00:29:09,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-06 00:29:09,030 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 00:29:09,030 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-06 00:29:09,030 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 00:29:09,031 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 00:29:09,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:09,031 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 00:29:09,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:09,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:09,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 00:29:09,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 00:29:09,035 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-06 00:29:09,035 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:29:09,035 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 00:29:09,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 00:29:09,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 00:29:09,036 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:09,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 00:29:09,036 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-06 00:29:09,037 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 00:29:09,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:09,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:09,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:29:09,037 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 00:29:09,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash 949209500, now seen corresponding path program 1 times [2022-12-06 00:29:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:09,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950719277] [2022-12-06 00:29:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:09,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:09,124 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 00:29:09,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:09,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950719277] [2022-12-06 00:29:09,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950719277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:09,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:09,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7277404] [2022-12-06 00:29:09,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:09,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:09,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:09,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:09,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:09,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 00:29:09,126 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 00:29:09,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:09,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 00:29:09,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:09,229 INFO L130 PetriNetUnfolder]: 85/169 cut-off events. [2022-12-06 00:29:09,230 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-06 00:29:09,230 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 00:29:09,231 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 8/42 dead transitions. [2022-12-06 00:29:09,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 42 transitions, 202 flow [2022-12-06 00:29:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:29:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:29:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 00:29:09,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 00:29:09,232 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 41 transitions. [2022-12-06 00:29:09,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 42 transitions, 202 flow [2022-12-06 00:29:09,233 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 00:29:09,234 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-06 00:29:09,234 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 00:29:09,235 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 00:29:09,235 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:09,235 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-06 00:29:09,236 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:09,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:09,236 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-06 00:29:09,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-06 00:29:09,241 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2022-12-06 00:29:09,241 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-06 00:29:09,241 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 00:29:09,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-06 00:29:09,241 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 00:29:09,391 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:09,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 00:29:09,392 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-06 00:29:09,392 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 00:29:09,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:09,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:09,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:29:09,393 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 00:29:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1910570962, now seen corresponding path program 1 times [2022-12-06 00:29:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:09,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416716078] [2022-12-06 00:29:09,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:09,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:09,455 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 00:29:09,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:09,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416716078] [2022-12-06 00:29:09,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416716078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:09,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:09,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711376272] [2022-12-06 00:29:09,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:09,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:29:09,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:09,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:29:09,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:29:09,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:29:09,457 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 00:29:09,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:09,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:29:09,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:09,511 INFO L130 PetriNetUnfolder]: 64/123 cut-off events. [2022-12-06 00:29:09,511 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-12-06 00:29:09,512 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 00:29:09,512 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 4 changer transitions 4/34 dead transitions. [2022-12-06 00:29:09,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 195 flow [2022-12-06 00:29:09,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:29:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:29:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 00:29:09,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 00:29:09,513 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 4 states and 36 transitions. [2022-12-06 00:29:09,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 195 flow [2022-12-06 00:29:09,514 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 00:29:09,515 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 92 flow [2022-12-06 00:29:09,515 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 00:29:09,516 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 00:29:09,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:09,516 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 92 flow [2022-12-06 00:29:09,516 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:09,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:09,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 92 flow [2022-12-06 00:29:09,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 92 flow [2022-12-06 00:29:09,519 INFO L130 PetriNetUnfolder]: 7/28 cut-off events. [2022-12-06 00:29:09,519 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 00:29:09,520 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 00:29:09,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 92 flow [2022-12-06 00:29:09,520 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 00:29:09,522 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:09,522 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 00:29:09,523 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 73 flow [2022-12-06 00:29:09,523 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 00:29:09,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:09,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:09,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:29:09,523 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 00:29:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1277300122, now seen corresponding path program 2 times [2022-12-06 00:29:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:09,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122298369] [2022-12-06 00:29:09,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:09,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:09,569 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 00:29:09,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:09,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122298369] [2022-12-06 00:29:09,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122298369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:09,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:09,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:09,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137920012] [2022-12-06 00:29:09,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:09,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:29:09,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:09,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:29:09,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:29:09,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 00:29:09,571 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 00:29:09,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:09,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 00:29:09,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:09,646 INFO L130 PetriNetUnfolder]: 53/107 cut-off events. [2022-12-06 00:29:09,647 INFO L131 PetriNetUnfolder]: For 157/157 co-relation queries the response was YES. [2022-12-06 00:29:09,647 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 00:29:09,647 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 27 selfloop transitions, 3 changer transitions 2/32 dead transitions. [2022-12-06 00:29:09,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 181 flow [2022-12-06 00:29:09,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:29:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:29:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 00:29:09,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 00:29:09,648 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 73 flow. Second operand 4 states and 33 transitions. [2022-12-06 00:29:09,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 181 flow [2022-12-06 00:29:09,649 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 00:29:09,650 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 80 flow [2022-12-06 00:29:09,650 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 00:29:09,650 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 00:29:09,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:09,651 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 80 flow [2022-12-06 00:29:09,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:09,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:09,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 80 flow [2022-12-06 00:29:09,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 80 flow [2022-12-06 00:29:09,654 INFO L130 PetriNetUnfolder]: 5/28 cut-off events. [2022-12-06 00:29:09,654 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 00:29:09,654 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 00:29:09,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 80 flow [2022-12-06 00:29:09,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 00:29:09,655 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:09,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 00:29:09,656 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 80 flow [2022-12-06 00:29:09,656 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 00:29:09,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:09,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:09,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:29:09,656 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 00:29:09,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:09,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2031968726, now seen corresponding path program 3 times [2022-12-06 00:29:09,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:09,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069821596] [2022-12-06 00:29:09,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:09,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:09,712 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 00:29:09,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:09,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069821596] [2022-12-06 00:29:09,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069821596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:09,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:09,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:09,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848547489] [2022-12-06 00:29:09,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:09,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:29:09,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:09,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:29:09,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:29:09,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 00:29:09,714 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 00:29:09,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:09,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 00:29:09,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:09,746 INFO L130 PetriNetUnfolder]: 39/79 cut-off events. [2022-12-06 00:29:09,747 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-06 00:29:09,747 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 00:29:09,747 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 2/26 dead transitions. [2022-12-06 00:29:09,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 156 flow [2022-12-06 00:29:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:29:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:29:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 00:29:09,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2022-12-06 00:29:09,748 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 80 flow. Second operand 4 states and 27 transitions. [2022-12-06 00:29:09,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 156 flow [2022-12-06 00:29:09,749 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 00:29:09,749 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 66 flow [2022-12-06 00:29:09,750 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 00:29:09,750 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 00:29:09,750 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:09,750 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 66 flow [2022-12-06 00:29:09,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:09,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:09,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 66 flow [2022-12-06 00:29:09,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 66 flow [2022-12-06 00:29:09,753 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2022-12-06 00:29:09,753 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:29:09,753 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 00:29:09,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 66 flow [2022-12-06 00:29:09,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 00:29:09,775 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 00:29:09,821 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:09,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 00:29:09,822 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 62 flow [2022-12-06 00:29:09,822 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 00:29:09,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:09,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:09,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:29:09,822 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 00:29:09,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1157667799, now seen corresponding path program 1 times [2022-12-06 00:29:09,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:09,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726531872] [2022-12-06 00:29:09,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:09,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:09,891 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 00:29:09,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:09,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726531872] [2022-12-06 00:29:09,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726531872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:09,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:09,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:29:09,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791961207] [2022-12-06 00:29:09,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:09,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:29:09,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:09,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:29:09,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:29:09,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 00:29:09,892 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 00:29:09,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:09,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 00:29:09,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:09,925 INFO L130 PetriNetUnfolder]: 36/68 cut-off events. [2022-12-06 00:29:09,925 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 00:29:09,926 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 00:29:09,926 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 20 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2022-12-06 00:29:09,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 128 flow [2022-12-06 00:29:09,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:29:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:29:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-12-06 00:29:09,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-06 00:29:09,927 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 62 flow. Second operand 3 states and 21 transitions. [2022-12-06 00:29:09,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 128 flow [2022-12-06 00:29:09,927 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 00:29:09,928 INFO L231 Difference]: Finished difference. Result has 23 places, 18 transitions, 67 flow [2022-12-06 00:29:09,928 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 00:29:09,928 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-06 00:29:09,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:09,928 INFO L89 Accepts]: Start accepts. Operand has 23 places, 18 transitions, 67 flow [2022-12-06 00:29:09,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:09,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:09,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 18 transitions, 67 flow [2022-12-06 00:29:09,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 67 flow [2022-12-06 00:29:09,931 INFO L130 PetriNetUnfolder]: 6/23 cut-off events. [2022-12-06 00:29:09,932 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 00:29:09,932 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 00:29:09,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 67 flow [2022-12-06 00:29:09,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 00:29:09,932 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:09,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 00:29:09,933 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 18 transitions, 67 flow [2022-12-06 00:29:09,933 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 00:29:09,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:09,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:09,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:29:09,933 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 00:29:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:09,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2039327826, now seen corresponding path program 1 times [2022-12-06 00:29:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:09,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736448687] [2022-12-06 00:29:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:10,125 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 00:29:10,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:10,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736448687] [2022-12-06 00:29:10,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736448687] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:10,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173393617] [2022-12-06 00:29:10,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:10,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:10,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:10,140 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 00:29:10,155 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 00:29:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:10,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 00:29:10,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:10,388 INFO L321 Elim1Store]: treesize reduction 42, result has 14.3 percent of original size [2022-12-06 00:29:10,389 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 00:29:10,424 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 00:29:10,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:10,634 INFO L321 Elim1Store]: treesize reduction 10, result has 93.6 percent of original size [2022-12-06 00:29:10,634 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 00:29:11,131 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 00:29:11,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173393617] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:11,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:11,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 00:29:11,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354865333] [2022-12-06 00:29:11,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:11,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:29:11,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:11,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:29:11,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:29:11,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 00:29:11,132 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 00:29:11,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:11,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 00:29:11,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:11,654 INFO L130 PetriNetUnfolder]: 101/184 cut-off events. [2022-12-06 00:29:11,654 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-06 00:29:11,654 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 00:29:11,655 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 23 selfloop transitions, 11 changer transitions 30/64 dead transitions. [2022-12-06 00:29:11,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 387 flow [2022-12-06 00:29:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:29:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:29:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 61 transitions. [2022-12-06 00:29:11,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27232142857142855 [2022-12-06 00:29:11,656 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 67 flow. Second operand 14 states and 61 transitions. [2022-12-06 00:29:11,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 387 flow [2022-12-06 00:29:11,657 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 00:29:11,658 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 160 flow [2022-12-06 00:29:11,658 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 00:29:11,658 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 00:29:11,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:11,658 INFO L89 Accepts]: Start accepts. Operand has 43 places, 26 transitions, 160 flow [2022-12-06 00:29:11,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:11,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:11,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 26 transitions, 160 flow [2022-12-06 00:29:11,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 160 flow [2022-12-06 00:29:11,687 INFO L130 PetriNetUnfolder]: 10/35 cut-off events. [2022-12-06 00:29:11,687 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 00:29:11,687 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 00:29:11,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 160 flow [2022-12-06 00:29:11,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 00:29:11,821 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 00:29:13,445 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 00:29:13,716 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 00:29:14,068 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:29:14,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2411 [2022-12-06 00:29:14,069 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 184 flow [2022-12-06 00:29:14,069 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 00:29:14,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:14,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:14,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:14,270 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 00:29:14,270 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 00:29:14,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1871161492, now seen corresponding path program 1 times [2022-12-06 00:29:14,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:14,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311711593] [2022-12-06 00:29:14,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:14,367 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 00:29:14,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:14,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311711593] [2022-12-06 00:29:14,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311711593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:14,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480956433] [2022-12-06 00:29:14,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:14,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:14,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:14,369 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 00:29:14,371 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 00:29:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:14,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:29:14,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:14,533 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 00:29:14,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:14,552 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 00:29:14,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480956433] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:14,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:14,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 00:29:14,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838967721] [2022-12-06 00:29:14,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:14,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:29:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:14,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:29:14,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:29:14,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 00:29:14,554 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 00:29:14,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:14,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 00:29:14,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:14,658 INFO L130 PetriNetUnfolder]: 65/115 cut-off events. [2022-12-06 00:29:14,658 INFO L131 PetriNetUnfolder]: For 288/288 co-relation queries the response was YES. [2022-12-06 00:29:14,658 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 00:29:14,659 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 30 selfloop transitions, 8 changer transitions 2/40 dead transitions. [2022-12-06 00:29:14,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 380 flow [2022-12-06 00:29:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:29:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:29:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-06 00:29:14,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2022-12-06 00:29:14,662 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 184 flow. Second operand 6 states and 39 transitions. [2022-12-06 00:29:14,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 380 flow [2022-12-06 00:29:14,664 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 00:29:14,665 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 146 flow [2022-12-06 00:29:14,665 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 00:29:14,665 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 00:29:14,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:14,666 INFO L89 Accepts]: Start accepts. Operand has 35 places, 24 transitions, 146 flow [2022-12-06 00:29:14,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:14,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:14,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 146 flow [2022-12-06 00:29:14,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 146 flow [2022-12-06 00:29:14,672 INFO L130 PetriNetUnfolder]: 15/44 cut-off events. [2022-12-06 00:29:14,672 INFO L131 PetriNetUnfolder]: For 26/29 co-relation queries the response was YES. [2022-12-06 00:29:14,672 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 00:29:14,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 146 flow [2022-12-06 00:29:14,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 00:29:15,090 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:15,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 425 [2022-12-06 00:29:15,090 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 149 flow [2022-12-06 00:29:15,091 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 00:29:15,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:15,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:15,099 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 00:29:15,291 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 00:29:15,291 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 00:29:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash -781138648, now seen corresponding path program 1 times [2022-12-06 00:29:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:15,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362813662] [2022-12-06 00:29:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:16,961 INFO 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 00:29:16,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:16,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362813662] [2022-12-06 00:29:16,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362813662] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:16,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866588380] [2022-12-06 00:29:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:16,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:16,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:16,963 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 00:29:16,995 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 00:29:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:17,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 00:29:17,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:17,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:17,111 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 00:29:17,146 INFO 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 00:29:17,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:17,466 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 00:29:17,466 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 00:29:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:18,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866588380] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:18,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:18,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 2] total 9 [2022-12-06 00:29:18,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759828657] [2022-12-06 00:29:18,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:18,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:29:18,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:18,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:29:18,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:29:18,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:29:18,256 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 00:29:18,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:18,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:29:18,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:18,438 INFO L130 PetriNetUnfolder]: 92/165 cut-off events. [2022-12-06 00:29:18,439 INFO L131 PetriNetUnfolder]: For 300/300 co-relation queries the response was YES. [2022-12-06 00:29:18,439 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 00:29:18,440 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 28 selfloop transitions, 18 changer transitions 4/50 dead transitions. [2022-12-06 00:29:18,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 407 flow [2022-12-06 00:29:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:29:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:29:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-06 00:29:18,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3233082706766917 [2022-12-06 00:29:18,441 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 149 flow. Second operand 7 states and 43 transitions. [2022-12-06 00:29:18,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 407 flow [2022-12-06 00:29:18,442 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 00:29:18,442 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 262 flow [2022-12-06 00:29:18,442 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 00:29:18,443 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-06 00:29:18,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:18,443 INFO L89 Accepts]: Start accepts. Operand has 37 places, 37 transitions, 262 flow [2022-12-06 00:29:18,443 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:18,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:18,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 37 transitions, 262 flow [2022-12-06 00:29:18,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 37 transitions, 262 flow [2022-12-06 00:29:18,450 INFO L130 PetriNetUnfolder]: 21/66 cut-off events. [2022-12-06 00:29:18,450 INFO L131 PetriNetUnfolder]: For 72/76 co-relation queries the response was YES. [2022-12-06 00:29:18,450 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 00:29:18,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 37 transitions, 262 flow [2022-12-06 00:29:18,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 00:29:20,166 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 00:29:20,439 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:20,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2000 [2022-12-06 00:29:20,443 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 260 flow [2022-12-06 00:29:20,443 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 00:29:20,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:20,444 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:20,451 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 00:29:20,644 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 00:29:20,644 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 00:29:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 97247192, now seen corresponding path program 1 times [2022-12-06 00:29:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:20,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628302592] [2022-12-06 00:29:20,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:20,728 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 00:29:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:20,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628302592] [2022-12-06 00:29:20,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628302592] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:20,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082596364] [2022-12-06 00:29:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:20,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:20,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:20,730 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 00:29:20,732 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 00:29:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:20,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:29:20,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:20,811 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 00:29:20,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:20,920 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 00:29:20,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082596364] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:20,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:20,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-06 00:29:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457511145] [2022-12-06 00:29:20,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:20,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:29:20,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:20,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:29:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:29:20,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 00:29:20,922 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 00:29:20,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:20,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 00:29:20,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:21,036 INFO L130 PetriNetUnfolder]: 90/162 cut-off events. [2022-12-06 00:29:21,037 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2022-12-06 00:29:21,037 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 00:29:21,038 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 35 selfloop transitions, 1 changer transitions 9/45 dead transitions. [2022-12-06 00:29:21,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 377 flow [2022-12-06 00:29:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:29:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:29:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-06 00:29:21,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3047619047619048 [2022-12-06 00:29:21,040 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 260 flow. Second operand 5 states and 32 transitions. [2022-12-06 00:29:21,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 377 flow [2022-12-06 00:29:21,040 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 00:29:21,042 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 200 flow [2022-12-06 00:29:21,042 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 00:29:21,042 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2022-12-06 00:29:21,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:21,043 INFO L89 Accepts]: Start accepts. Operand has 39 places, 32 transitions, 200 flow [2022-12-06 00:29:21,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:21,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:21,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 200 flow [2022-12-06 00:29:21,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 200 flow [2022-12-06 00:29:21,048 INFO L130 PetriNetUnfolder]: 18/52 cut-off events. [2022-12-06 00:29:21,049 INFO L131 PetriNetUnfolder]: For 60/64 co-relation queries the response was YES. [2022-12-06 00:29:21,049 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 00:29:21,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 32 transitions, 200 flow [2022-12-06 00:29:21,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 00:29:21,064 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 00:29:22,258 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 00:29:23,160 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:23,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2119 [2022-12-06 00:29:23,161 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 216 flow [2022-12-06 00:29:23,161 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 00:29:23,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:23,161 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:23,172 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 00:29:23,361 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 00:29:23,362 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 00:29:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:23,362 INFO L85 PathProgramCache]: Analyzing trace with hash -127990386, now seen corresponding path program 1 times [2022-12-06 00:29:23,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:23,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51649374] [2022-12-06 00:29:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:23,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:24,543 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 00:29:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:24,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51649374] [2022-12-06 00:29:24,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51649374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:24,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981578843] [2022-12-06 00:29:24,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:24,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:24,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:24,560 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 00:29:24,561 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 00:29:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:24,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 00:29:24,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:24,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:24,755 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 00:29:24,787 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 00:29:24,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:25,112 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 00:29:25,113 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 00:29:26,101 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 00:29:26,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981578843] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:26,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:26,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 00:29:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051520775] [2022-12-06 00:29:26,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:26,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:29:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:26,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:29:26,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:29:26,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:29:26,102 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 00:29:26,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:26,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:29:26,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:26,494 INFO L130 PetriNetUnfolder]: 145/255 cut-off events. [2022-12-06 00:29:26,494 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-12-06 00:29:26,495 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 00:29:26,496 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 42 selfloop transitions, 23 changer transitions 2/67 dead transitions. [2022-12-06 00:29:26,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 526 flow [2022-12-06 00:29:26,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:29:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:29:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-12-06 00:29:26,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29292929292929293 [2022-12-06 00:29:26,497 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 216 flow. Second operand 9 states and 58 transitions. [2022-12-06 00:29:26,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 526 flow [2022-12-06 00:29:26,498 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 00:29:26,499 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 359 flow [2022-12-06 00:29:26,499 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 00:29:26,499 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-06 00:29:26,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:26,499 INFO L89 Accepts]: Start accepts. Operand has 46 places, 43 transitions, 359 flow [2022-12-06 00:29:26,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:26,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:26,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 43 transitions, 359 flow [2022-12-06 00:29:26,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 43 transitions, 359 flow [2022-12-06 00:29:26,508 INFO L130 PetriNetUnfolder]: 25/76 cut-off events. [2022-12-06 00:29:26,508 INFO L131 PetriNetUnfolder]: For 133/138 co-relation queries the response was YES. [2022-12-06 00:29:26,508 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 00:29:26,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 43 transitions, 359 flow [2022-12-06 00:29:26,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 00:29:26,685 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 00:29:26,844 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:26,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 346 [2022-12-06 00:29:26,845 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 359 flow [2022-12-06 00:29:26,845 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 00:29:26,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:26,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:26,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 00:29:27,046 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 00:29:27,046 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 00:29:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1600915337, now seen corresponding path program 1 times [2022-12-06 00:29:27,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:27,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100172706] [2022-12-06 00:29:27,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:27,134 INFO 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 00:29:27,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:27,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100172706] [2022-12-06 00:29:27,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100172706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:27,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68685909] [2022-12-06 00:29:27,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:27,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:27,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:27,147 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 00:29:27,148 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 00:29:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:27,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:29:27,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:27,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:27,308 INFO 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 00:29:27,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68685909] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:27,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:27,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-06 00:29:27,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019535288] [2022-12-06 00:29:27,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:27,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:29:27,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:27,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:29:27,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:29:27,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 00:29:27,311 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 00:29:27,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:27,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 00:29:27,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:27,448 INFO L130 PetriNetUnfolder]: 171/291 cut-off events. [2022-12-06 00:29:27,448 INFO L131 PetriNetUnfolder]: For 768/768 co-relation queries the response was YES. [2022-12-06 00:29:27,448 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 00:29:27,450 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 44 selfloop transitions, 28 changer transitions 0/72 dead transitions. [2022-12-06 00:29:27,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 719 flow [2022-12-06 00:29:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:29:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:29:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-12-06 00:29:27,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2022-12-06 00:29:27,450 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 359 flow. Second operand 8 states and 52 transitions. [2022-12-06 00:29:27,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 719 flow [2022-12-06 00:29:27,453 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 00:29:27,453 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 485 flow [2022-12-06 00:29:27,454 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 00:29:27,454 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 00:29:27,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:27,454 INFO L89 Accepts]: Start accepts. Operand has 53 places, 51 transitions, 485 flow [2022-12-06 00:29:27,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:27,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:27,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions, 485 flow [2022-12-06 00:29:27,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions, 485 flow [2022-12-06 00:29:27,464 INFO L130 PetriNetUnfolder]: 32/90 cut-off events. [2022-12-06 00:29:27,464 INFO L131 PetriNetUnfolder]: For 254/262 co-relation queries the response was YES. [2022-12-06 00:29:27,464 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 00:29:27,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 51 transitions, 485 flow [2022-12-06 00:29:27,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 00:29:27,465 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:27,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 00:29:27,466 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 485 flow [2022-12-06 00:29:27,466 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 00:29:27,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:27,466 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:27,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:27,670 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 00:29:27,670 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 00:29:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1384627034, now seen corresponding path program 1 times [2022-12-06 00:29:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:27,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611231269] [2022-12-06 00:29:27,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:27,742 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 00:29:27,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:27,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611231269] [2022-12-06 00:29:27,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611231269] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:27,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768875081] [2022-12-06 00:29:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:27,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:27,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:27,757 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 00:29:27,786 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 00:29:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:27,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 00:29:27,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:27,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:27,953 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 00:29:27,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768875081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:27,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:27,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 00:29:27,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850945737] [2022-12-06 00:29:27,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:27,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:29:27,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:27,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:29:27,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:29:27,955 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 00:29:27,955 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 00:29:27,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:27,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 00:29:27,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:28,345 INFO L130 PetriNetUnfolder]: 228/393 cut-off events. [2022-12-06 00:29:28,345 INFO L131 PetriNetUnfolder]: For 1625/1625 co-relation queries the response was YES. [2022-12-06 00:29:28,346 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 00:29:28,347 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 61 selfloop transitions, 35 changer transitions 2/98 dead transitions. [2022-12-06 00:29:28,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 982 flow [2022-12-06 00:29:28,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:29:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:29:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-12-06 00:29:28,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2465277777777778 [2022-12-06 00:29:28,348 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 485 flow. Second operand 12 states and 71 transitions. [2022-12-06 00:29:28,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 982 flow [2022-12-06 00:29:28,352 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 00:29:28,353 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 623 flow [2022-12-06 00:29:28,353 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 00:29:28,354 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 44 predicate places. [2022-12-06 00:29:28,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:28,354 INFO L89 Accepts]: Start accepts. Operand has 65 places, 60 transitions, 623 flow [2022-12-06 00:29:28,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:28,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:28,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 60 transitions, 623 flow [2022-12-06 00:29:28,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 60 transitions, 623 flow [2022-12-06 00:29:28,369 INFO L130 PetriNetUnfolder]: 41/122 cut-off events. [2022-12-06 00:29:28,369 INFO L131 PetriNetUnfolder]: For 361/372 co-relation queries the response was YES. [2022-12-06 00:29:28,369 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 00:29:28,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 60 transitions, 623 flow [2022-12-06 00:29:28,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-06 00:29:28,374 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 00:29:28,853 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:29:28,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 500 [2022-12-06 00:29:28,854 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 635 flow [2022-12-06 00:29:28,854 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 00:29:28,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:28,854 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:28,859 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 00:29:29,059 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 00:29:29,059 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 00:29:29,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1481718263, now seen corresponding path program 1 times [2022-12-06 00:29:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:29,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934060555] [2022-12-06 00:29:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:29,171 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 00:29:29,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:29,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934060555] [2022-12-06 00:29:29,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934060555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:29,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885941766] [2022-12-06 00:29:29,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:29,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:29,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:29,186 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 00:29:29,197 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 00:29:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:29,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:29:29,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:29,342 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 00:29:29,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:29,382 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 00:29:29,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885941766] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:29,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:29,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 00:29:29,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591520752] [2022-12-06 00:29:29,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:29,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:29:29,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:29,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:29:29,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:29:29,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 00:29:29,383 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 00:29:29,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:29,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 00:29:29,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:29,640 INFO L130 PetriNetUnfolder]: 263/454 cut-off events. [2022-12-06 00:29:29,641 INFO L131 PetriNetUnfolder]: For 1861/1861 co-relation queries the response was YES. [2022-12-06 00:29:29,641 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 00:29:29,643 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 59 selfloop transitions, 40 changer transitions 0/99 dead transitions. [2022-12-06 00:29:29,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 1111 flow [2022-12-06 00:29:29,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:29:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:29:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 68 transitions. [2022-12-06 00:29:29,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22077922077922077 [2022-12-06 00:29:29,644 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 635 flow. Second operand 11 states and 68 transitions. [2022-12-06 00:29:29,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 1111 flow [2022-12-06 00:29:29,648 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 00:29:29,649 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 778 flow [2022-12-06 00:29:29,649 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 00:29:29,650 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 54 predicate places. [2022-12-06 00:29:29,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:29,650 INFO L89 Accepts]: Start accepts. Operand has 75 places, 68 transitions, 778 flow [2022-12-06 00:29:29,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:29,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:29,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 68 transitions, 778 flow [2022-12-06 00:29:29,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 68 transitions, 778 flow [2022-12-06 00:29:29,666 INFO L130 PetriNetUnfolder]: 50/139 cut-off events. [2022-12-06 00:29:29,667 INFO L131 PetriNetUnfolder]: For 546/560 co-relation queries the response was YES. [2022-12-06 00:29:29,667 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 00:29:29,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 68 transitions, 778 flow [2022-12-06 00:29:29,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 00:29:29,668 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 00:29:30,771 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:30,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1123 [2022-12-06 00:29:30,773 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 802 flow [2022-12-06 00:29:30,773 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 00:29:30,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:30,773 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:30,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:30,978 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 00:29:30,979 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 00:29:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2145938201, now seen corresponding path program 1 times [2022-12-06 00:29:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:30,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430394362] [2022-12-06 00:29:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:30,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:31,045 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 00:29:31,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:31,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430394362] [2022-12-06 00:29:31,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430394362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:31,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:31,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:31,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914937753] [2022-12-06 00:29:31,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:31,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:29:31,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:31,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:29:31,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:29:31,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:29:31,047 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 00:29:31,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:31,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:29:31,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:31,185 INFO L130 PetriNetUnfolder]: 256/454 cut-off events. [2022-12-06 00:29:31,185 INFO L131 PetriNetUnfolder]: For 2284/2284 co-relation queries the response was YES. [2022-12-06 00:29:31,185 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 00:29:31,187 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 66 selfloop transitions, 10 changer transitions 3/79 dead transitions. [2022-12-06 00:29:31,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 79 transitions, 1041 flow [2022-12-06 00:29:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:29:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:29:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 00:29:31,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 00:29:31,188 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 802 flow. Second operand 4 states and 42 transitions. [2022-12-06 00:29:31,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 79 transitions, 1041 flow [2022-12-06 00:29:31,193 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 00:29:31,194 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 692 flow [2022-12-06 00:29:31,194 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 00:29:31,195 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 53 predicate places. [2022-12-06 00:29:31,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:31,195 INFO L89 Accepts]: Start accepts. Operand has 74 places, 66 transitions, 692 flow [2022-12-06 00:29:31,196 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:31,196 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:31,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 66 transitions, 692 flow [2022-12-06 00:29:31,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 66 transitions, 692 flow [2022-12-06 00:29:31,209 INFO L130 PetriNetUnfolder]: 47/133 cut-off events. [2022-12-06 00:29:31,209 INFO L131 PetriNetUnfolder]: For 514/529 co-relation queries the response was YES. [2022-12-06 00:29:31,209 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 00:29:31,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 66 transitions, 692 flow [2022-12-06 00:29:31,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:29:31,210 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:31,211 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 00:29:31,211 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 692 flow [2022-12-06 00:29:31,211 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 00:29:31,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:31,211 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:31,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 00:29:31,211 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 00:29:31,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:31,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1563093600, now seen corresponding path program 1 times [2022-12-06 00:29:31,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:31,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010609780] [2022-12-06 00:29:31,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:31,279 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 00:29:31,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:31,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010609780] [2022-12-06 00:29:31,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010609780] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:31,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449042100] [2022-12-06 00:29:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:31,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:31,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:31,281 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 00:29:31,315 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 00:29:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:31,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:29:31,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:31,422 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 00:29:31,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:31,455 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 00:29:31,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449042100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:31,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:31,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 00:29:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007382164] [2022-12-06 00:29:31,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:31,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:29:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:31,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:29:31,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:29:31,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 00:29:31,458 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 00:29:31,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:31,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 00:29:31,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:31,774 INFO L130 PetriNetUnfolder]: 300/531 cut-off events. [2022-12-06 00:29:31,774 INFO L131 PetriNetUnfolder]: For 2392/2392 co-relation queries the response was YES. [2022-12-06 00:29:31,775 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 00:29:31,777 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 78 selfloop transitions, 20 changer transitions 8/106 dead transitions. [2022-12-06 00:29:31,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 106 transitions, 1184 flow [2022-12-06 00:29:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:29:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:29:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-12-06 00:29:31,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23412698412698413 [2022-12-06 00:29:31,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 00:29:31,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 106 transitions, 1184 flow [2022-12-06 00:29:31,782 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 00:29:31,786 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 795 flow [2022-12-06 00:29:31,786 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 00:29:31,786 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 59 predicate places. [2022-12-06 00:29:31,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:31,786 INFO L89 Accepts]: Start accepts. Operand has 80 places, 73 transitions, 795 flow [2022-12-06 00:29:31,787 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:31,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:31,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 73 transitions, 795 flow [2022-12-06 00:29:31,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 73 transitions, 795 flow [2022-12-06 00:29:31,802 INFO L130 PetriNetUnfolder]: 55/155 cut-off events. [2022-12-06 00:29:31,802 INFO L131 PetriNetUnfolder]: For 847/895 co-relation queries the response was YES. [2022-12-06 00:29:31,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 00:29:31,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 73 transitions, 795 flow [2022-12-06 00:29:31,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 00:29:31,815 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 00:29:31,970 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 00:29:32,131 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 00:29:32,188 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 00:29:32,359 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:32,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 574 [2022-12-06 00:29:32,360 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 879 flow [2022-12-06 00:29:32,360 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 00:29:32,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:32,360 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:32,379 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 00:29:32,561 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 00:29:32,561 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 00:29:32,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:32,561 INFO L85 PathProgramCache]: Analyzing trace with hash -719104254, now seen corresponding path program 1 times [2022-12-06 00:29:32,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:32,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690659989] [2022-12-06 00:29:32,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:32,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:34,226 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 00:29:34,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:34,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690659989] [2022-12-06 00:29:34,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690659989] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:34,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690673194] [2022-12-06 00:29:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:34,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:34,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:34,232 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 00:29:34,234 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 00:29:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:34,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 00:29:34,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:34,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:34,415 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 00:29:34,441 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 00:29:34,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:34,811 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 00:29:34,811 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 00:29:35,626 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 00:29:35,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690673194] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:35,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:35,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2022-12-06 00:29:35,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182134259] [2022-12-06 00:29:35,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:35,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:29:35,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:35,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:29:35,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:29:35,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:29:35,628 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 00:29:35,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:35,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:29:35,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:36,860 INFO L130 PetriNetUnfolder]: 387/691 cut-off events. [2022-12-06 00:29:36,860 INFO L131 PetriNetUnfolder]: For 4697/4697 co-relation queries the response was YES. [2022-12-06 00:29:36,862 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 00:29:36,864 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 77 selfloop transitions, 49 changer transitions 18/144 dead transitions. [2022-12-06 00:29:36,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 144 transitions, 1799 flow [2022-12-06 00:29:36,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:29:36,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:29:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2022-12-06 00:29:36,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2304147465437788 [2022-12-06 00:29:36,865 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 879 flow. Second operand 14 states and 100 transitions. [2022-12-06 00:29:36,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 144 transitions, 1799 flow [2022-12-06 00:29:36,875 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 00:29:36,879 INFO L231 Difference]: Finished difference. Result has 90 places, 95 transitions, 1246 flow [2022-12-06 00:29:36,879 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 00:29:36,879 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 69 predicate places. [2022-12-06 00:29:36,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:36,879 INFO L89 Accepts]: Start accepts. Operand has 90 places, 95 transitions, 1246 flow [2022-12-06 00:29:36,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:36,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:36,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 95 transitions, 1246 flow [2022-12-06 00:29:36,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 95 transitions, 1246 flow [2022-12-06 00:29:36,904 INFO L130 PetriNetUnfolder]: 67/212 cut-off events. [2022-12-06 00:29:36,904 INFO L131 PetriNetUnfolder]: For 1597/1667 co-relation queries the response was YES. [2022-12-06 00:29:36,904 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 00:29:36,905 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 95 transitions, 1246 flow [2022-12-06 00:29:36,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 00:29:37,033 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 00:29:37,262 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 00:29:37,937 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 00:29:38,406 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 00:29:38,641 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:29:38,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1763 [2022-12-06 00:29:38,642 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 1314 flow [2022-12-06 00:29:38,642 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 00:29:38,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:38,642 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:38,648 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 00:29:38,848 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 00:29:38,849 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 00:29:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1906459602, now seen corresponding path program 1 times [2022-12-06 00:29:38,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:38,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152321270] [2022-12-06 00:29:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:38,970 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 00:29:38,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:38,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152321270] [2022-12-06 00:29:38,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152321270] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:38,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071296600] [2022-12-06 00:29:38,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:38,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:38,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:38,987 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 00:29:38,988 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 00:29:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:39,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 00:29:39,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:39,149 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 00:29:39,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:39,215 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 00:29:39,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071296600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:39,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:39,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 00:29:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702972565] [2022-12-06 00:29:39,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:39,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:29:39,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:39,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:29:39,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:29:39,216 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:29:39,216 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 00:29:39,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:39,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:29:39,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:41,710 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 00:29:42,072 INFO L130 PetriNetUnfolder]: 686/1187 cut-off events. [2022-12-06 00:29:42,072 INFO L131 PetriNetUnfolder]: For 11195/11195 co-relation queries the response was YES. [2022-12-06 00:29:42,074 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 00:29:42,080 INFO L137 encePairwiseOnDemand]: 15/39 looper letters, 133 selfloop transitions, 91 changer transitions 6/230 dead transitions. [2022-12-06 00:29:42,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 230 transitions, 3420 flow [2022-12-06 00:29:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 00:29:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 00:29:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 143 transitions. [2022-12-06 00:29:42,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19298245614035087 [2022-12-06 00:29:42,085 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 1314 flow. Second operand 19 states and 143 transitions. [2022-12-06 00:29:42,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 230 transitions, 3420 flow [2022-12-06 00:29:42,104 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 00:29:42,107 INFO L231 Difference]: Finished difference. Result has 110 places, 132 transitions, 2043 flow [2022-12-06 00:29:42,107 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 00:29:42,107 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 00:29:42,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:42,108 INFO L89 Accepts]: Start accepts. Operand has 110 places, 132 transitions, 2043 flow [2022-12-06 00:29:42,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:42,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:42,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 132 transitions, 2043 flow [2022-12-06 00:29:42,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 132 transitions, 2043 flow [2022-12-06 00:29:42,140 INFO L130 PetriNetUnfolder]: 114/314 cut-off events. [2022-12-06 00:29:42,140 INFO L131 PetriNetUnfolder]: For 2975/3111 co-relation queries the response was YES. [2022-12-06 00:29:42,140 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 00:29:42,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 132 transitions, 2043 flow [2022-12-06 00:29:42,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-06 00:29:42,961 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:42,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 855 [2022-12-06 00:29:42,962 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 132 transitions, 2047 flow [2022-12-06 00:29:42,962 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 00:29:42,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:42,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:42,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:43,163 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 00:29:43,163 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 00:29:43,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:43,164 INFO L85 PathProgramCache]: Analyzing trace with hash -5261297, now seen corresponding path program 1 times [2022-12-06 00:29:43,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:43,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059647327] [2022-12-06 00:29:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:43,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:44,226 INFO 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 00:29:44,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:44,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059647327] [2022-12-06 00:29:44,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059647327] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:44,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128210660] [2022-12-06 00:29:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:44,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:44,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:44,228 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 00:29:44,230 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 00:29:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:44,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 00:29:44,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:44,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:44,366 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 00:29:44,403 INFO 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 00:29:44,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:44,704 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 00:29:44,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 00:29:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:45,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128210660] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:45,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:45,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-06 00:29:45,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214996526] [2022-12-06 00:29:45,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:45,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:29:45,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:45,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:29:45,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:29:45,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 00:29:45,525 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 00:29:45,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:45,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 00:29:45,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:45,939 INFO L130 PetriNetUnfolder]: 723/1234 cut-off events. [2022-12-06 00:29:45,939 INFO L131 PetriNetUnfolder]: For 13002/13002 co-relation queries the response was YES. [2022-12-06 00:29:45,942 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 00:29:45,949 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 123 selfloop transitions, 27 changer transitions 1/151 dead transitions. [2022-12-06 00:29:45,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 151 transitions, 2522 flow [2022-12-06 00:29:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:29:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:29:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 00:29:45,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24561403508771928 [2022-12-06 00:29:45,950 INFO L175 Difference]: Start difference. First operand has 107 places, 132 transitions, 2047 flow. Second operand 6 states and 56 transitions. [2022-12-06 00:29:45,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 151 transitions, 2522 flow [2022-12-06 00:29:45,985 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 00:29:45,987 INFO L231 Difference]: Finished difference. Result has 110 places, 139 transitions, 1896 flow [2022-12-06 00:29:45,987 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 00:29:45,988 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 00:29:45,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:45,988 INFO L89 Accepts]: Start accepts. Operand has 110 places, 139 transitions, 1896 flow [2022-12-06 00:29:45,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:45,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:45,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 139 transitions, 1896 flow [2022-12-06 00:29:45,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 139 transitions, 1896 flow [2022-12-06 00:29:46,023 INFO L130 PetriNetUnfolder]: 118/330 cut-off events. [2022-12-06 00:29:46,023 INFO L131 PetriNetUnfolder]: For 3051/3188 co-relation queries the response was YES. [2022-12-06 00:29:46,024 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 00:29:46,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 139 transitions, 1896 flow [2022-12-06 00:29:46,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-06 00:29:46,621 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 00:29:47,030 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:47,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1043 [2022-12-06 00:29:47,031 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 139 transitions, 1916 flow [2022-12-06 00:29:47,031 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 00:29:47,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:47,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:47,037 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 00:29:47,232 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 00:29:47,232 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 00:29:47,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:47,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1660388292, now seen corresponding path program 1 times [2022-12-06 00:29:47,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:47,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732147232] [2022-12-06 00:29:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:47,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:47,299 INFO 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 00:29:47,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:47,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732147232] [2022-12-06 00:29:47,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732147232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:47,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685874103] [2022-12-06 00:29:47,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:47,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:47,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:47,316 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 00:29:47,332 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 00:29:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:47,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 00:29:47,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:47,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:47,429 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 00:29:47,431 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 00:29:47,452 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 00:29:47,725 INFO L321 Elim1Store]: treesize reduction 185, result has 17.8 percent of original size [2022-12-06 00:29:47,725 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 00:29:47,760 INFO 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 00:29:47,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:50,237 INFO 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 00:29:50,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685874103] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:50,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:50,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 00:29:50,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653057131] [2022-12-06 00:29:50,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:50,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:29:50,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:50,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:29:50,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=117, Unknown=2, NotChecked=0, Total=156 [2022-12-06 00:29:50,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:29:50,240 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 00:29:50,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:50,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:29:50,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:30:17,143 WARN L233 SmtUtils]: Spent 26.78s 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 00:30:47,987 WARN L233 SmtUtils]: Spent 30.72s 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 00:30:50,106 INFO L130 PetriNetUnfolder]: 757/1292 cut-off events. [2022-12-06 00:30:50,106 INFO L131 PetriNetUnfolder]: For 13295/13295 co-relation queries the response was YES. [2022-12-06 00:30:50,109 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 00:30:50,115 INFO L137 encePairwiseOnDemand]: 16/40 looper letters, 126 selfloop transitions, 48 changer transitions 4/178 dead transitions. [2022-12-06 00:30:50,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 178 transitions, 2595 flow [2022-12-06 00:30:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:30:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:30:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 84 transitions. [2022-12-06 00:30:50,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.175 [2022-12-06 00:30:50,116 INFO L175 Difference]: Start difference. First operand has 110 places, 139 transitions, 1916 flow. Second operand 12 states and 84 transitions. [2022-12-06 00:30:50,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 178 transitions, 2595 flow [2022-12-06 00:30:50,153 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 00:30:50,156 INFO L231 Difference]: Finished difference. Result has 122 places, 147 transitions, 2106 flow [2022-12-06 00:30:50,156 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 00:30:50,157 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 101 predicate places. [2022-12-06 00:30:50,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:30:50,157 INFO L89 Accepts]: Start accepts. Operand has 122 places, 147 transitions, 2106 flow [2022-12-06 00:30:50,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:30:50,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:30:50,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 147 transitions, 2106 flow [2022-12-06 00:30:50,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 147 transitions, 2106 flow [2022-12-06 00:30:50,194 INFO L130 PetriNetUnfolder]: 127/346 cut-off events. [2022-12-06 00:30:50,194 INFO L131 PetriNetUnfolder]: For 3917/4063 co-relation queries the response was YES. [2022-12-06 00:30:50,195 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 00:30:50,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 147 transitions, 2106 flow [2022-12-06 00:30:50,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-06 00:30:52,184 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 00:30:53,582 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:30:53,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3426 [2022-12-06 00:30:53,583 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 147 transitions, 2174 flow [2022-12-06 00:30:53,583 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 00:30:53,583 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:30:53,583 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:30:53,589 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 00:30:53,788 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 00:30:53,788 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 00:30:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:30:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash -324503891, now seen corresponding path program 1 times [2022-12-06 00:30:53,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:30:53,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784458621] [2022-12-06 00:30:53,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:30:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:55,088 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 00:30:55,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:30:55,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784458621] [2022-12-06 00:30:55,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784458621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:30:55,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831631814] [2022-12-06 00:30:55,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:55,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:55,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:30:55,090 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 00:30:55,097 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 00:30:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:55,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 00:30:55,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:30:55,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:30:55,245 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 00:30:55,293 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 00:30:55,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:30:55,554 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 00:30:55,554 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 00:30:56,569 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 00:30:56,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831631814] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:30:56,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:30:56,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 11 [2022-12-06 00:30:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010628562] [2022-12-06 00:30:56,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:30:56,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:30:56,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:30:56,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:30:56,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-06 00:30:56,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:30:56,570 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 00:30:56,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:30:56,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:30:56,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:30:57,861 INFO L130 PetriNetUnfolder]: 827/1416 cut-off events. [2022-12-06 00:30:57,861 INFO L131 PetriNetUnfolder]: For 17207/17207 co-relation queries the response was YES. [2022-12-06 00:30:57,865 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 00:30:57,876 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 110 selfloop transitions, 69 changer transitions 7/186 dead transitions. [2022-12-06 00:30:57,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 186 transitions, 2977 flow [2022-12-06 00:30:57,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:30:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:30:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-12-06 00:30:57,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1937984496124031 [2022-12-06 00:30:57,877 INFO L175 Difference]: Start difference. First operand has 120 places, 147 transitions, 2174 flow. Second operand 9 states and 75 transitions. [2022-12-06 00:30:57,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 186 transitions, 2977 flow [2022-12-06 00:30:57,918 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 00:30:57,923 INFO L231 Difference]: Finished difference. Result has 127 places, 159 transitions, 2445 flow [2022-12-06 00:30:57,923 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 00:30:57,923 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 106 predicate places. [2022-12-06 00:30:57,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:30:57,923 INFO L89 Accepts]: Start accepts. Operand has 127 places, 159 transitions, 2445 flow [2022-12-06 00:30:57,924 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:30:57,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:30:57,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 159 transitions, 2445 flow [2022-12-06 00:30:57,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 159 transitions, 2445 flow [2022-12-06 00:30:57,962 INFO L130 PetriNetUnfolder]: 136/376 cut-off events. [2022-12-06 00:30:57,963 INFO L131 PetriNetUnfolder]: For 5479/5636 co-relation queries the response was YES. [2022-12-06 00:30:57,964 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 00:30:57,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 159 transitions, 2445 flow [2022-12-06 00:30:57,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-06 00:30:57,972 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 00:30:58,219 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 00:30:59,385 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:30:59,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1463 [2022-12-06 00:30:59,386 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 158 transitions, 2444 flow [2022-12-06 00:30:59,386 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 00:30:59,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:30:59,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:30:59,391 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 00:30:59,586 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 00:30:59,587 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 00:30:59,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:30:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1263582363, now seen corresponding path program 1 times [2022-12-06 00:30:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:30:59,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645613213] [2022-12-06 00:30:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:30:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:59,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:30:59,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645613213] [2022-12-06 00:30:59,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645613213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:30:59,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256864779] [2022-12-06 00:30:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:59,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:59,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:30:59,663 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 00:30:59,665 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 00:30:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:59,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:30:59,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:30:59,813 INFO 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 00:30:59,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:30:59,852 INFO 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 00:30:59,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256864779] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:30:59,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:30:59,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 00:30:59,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767123293] [2022-12-06 00:30:59,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:30:59,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:30:59,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:30:59,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:30:59,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:30:59,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:30:59,853 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 00:30:59,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:30:59,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:30:59,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:00,365 INFO L130 PetriNetUnfolder]: 996/1703 cut-off events. [2022-12-06 00:31:00,365 INFO L131 PetriNetUnfolder]: For 24487/24487 co-relation queries the response was YES. [2022-12-06 00:31:00,369 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 00:31:00,375 INFO L137 encePairwiseOnDemand]: 33/43 looper letters, 200 selfloop transitions, 31 changer transitions 4/235 dead transitions. [2022-12-06 00:31:00,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 235 transitions, 3854 flow [2022-12-06 00:31:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:31:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:31:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-12-06 00:31:00,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21188630490956073 [2022-12-06 00:31:00,376 INFO L175 Difference]: Start difference. First operand has 125 places, 158 transitions, 2444 flow. Second operand 9 states and 82 transitions. [2022-12-06 00:31:00,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 235 transitions, 3854 flow [2022-12-06 00:31:00,458 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 00:31:00,462 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 2805 flow [2022-12-06 00:31:00,462 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 00:31:00,464 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 112 predicate places. [2022-12-06 00:31:00,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:00,464 INFO L89 Accepts]: Start accepts. Operand has 133 places, 179 transitions, 2805 flow [2022-12-06 00:31:00,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:00,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:00,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 179 transitions, 2805 flow [2022-12-06 00:31:00,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 179 transitions, 2805 flow [2022-12-06 00:31:00,515 INFO L130 PetriNetUnfolder]: 169/470 cut-off events. [2022-12-06 00:31:00,516 INFO L131 PetriNetUnfolder]: For 6940/7101 co-relation queries the response was YES. [2022-12-06 00:31:00,517 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 00:31:00,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 179 transitions, 2805 flow [2022-12-06 00:31:00,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-06 00:31:00,545 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 00:31:02,643 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 00:31:03,081 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 00:31:04,407 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:31:04,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3945 [2022-12-06 00:31:04,409 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 178 transitions, 2858 flow [2022-12-06 00:31:04,410 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 00:31:04,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:04,410 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:04,416 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 00:31:04,616 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 00:31:04,616 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 00:31:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1772704836, now seen corresponding path program 1 times [2022-12-06 00:31:04,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:04,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699220453] [2022-12-06 00:31:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:04,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:07,372 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 00:31:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:07,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699220453] [2022-12-06 00:31:07,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699220453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:07,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407106923] [2022-12-06 00:31:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:07,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:07,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:07,374 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 00:31:07,376 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 00:31:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:07,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-06 00:31:07,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:07,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:31:07,504 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 00:31:07,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:31:07,547 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 00:31:07,996 INFO L321 Elim1Store]: treesize reduction 185, result has 17.8 percent of original size [2022-12-06 00:31:07,997 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 00:31:08,045 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 00:31:08,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:11,441 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 00:31:11,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407106923] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:11,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:11,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 17 [2022-12-06 00:31:11,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742123964] [2022-12-06 00:31:11,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:11,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:31:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:11,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:31:11,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=273, Unknown=1, NotChecked=0, Total=342 [2022-12-06 00:31:11,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:31:11,443 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 00:31:11,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:11,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:31:11,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:16,671 INFO L130 PetriNetUnfolder]: 1423/2463 cut-off events. [2022-12-06 00:31:16,671 INFO L131 PetriNetUnfolder]: For 40244/40244 co-relation queries the response was YES. [2022-12-06 00:31:16,679 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 00:31:16,686 INFO L137 encePairwiseOnDemand]: 15/47 looper letters, 132 selfloop transitions, 162 changer transitions 23/317 dead transitions. [2022-12-06 00:31:16,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 317 transitions, 5371 flow [2022-12-06 00:31:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:31:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:31:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 113 transitions. [2022-12-06 00:31:16,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20035460992907803 [2022-12-06 00:31:16,688 INFO L175 Difference]: Start difference. First operand has 132 places, 178 transitions, 2858 flow. Second operand 12 states and 113 transitions. [2022-12-06 00:31:16,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 317 transitions, 5371 flow [2022-12-06 00:31:16,799 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 00:31:16,803 INFO L231 Difference]: Finished difference. Result has 148 places, 248 transitions, 4287 flow [2022-12-06 00:31:16,803 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 00:31:16,803 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 127 predicate places. [2022-12-06 00:31:16,803 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:16,803 INFO L89 Accepts]: Start accepts. Operand has 148 places, 248 transitions, 4287 flow [2022-12-06 00:31:16,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:16,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:16,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 248 transitions, 4287 flow [2022-12-06 00:31:16,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 248 transitions, 4287 flow [2022-12-06 00:31:16,878 INFO L130 PetriNetUnfolder]: 225/671 cut-off events. [2022-12-06 00:31:16,878 INFO L131 PetriNetUnfolder]: For 11677/11936 co-relation queries the response was YES. [2022-12-06 00:31:16,881 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 00:31:16,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 248 transitions, 4287 flow [2022-12-06 00:31:16,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 930 [2022-12-06 00:31:18,743 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 00:31:19,579 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 00:31:20,101 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 00:31:20,706 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:31:20,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3904 [2022-12-06 00:31:20,707 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 248 transitions, 4360 flow [2022-12-06 00:31:20,707 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 00:31:20,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:20,707 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:20,712 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 00:31:20,912 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 00:31:20,927 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 00:31:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1420432038, now seen corresponding path program 1 times [2022-12-06 00:31:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:20,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312808272] [2022-12-06 00:31:20,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:20,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:20,943 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 00:31:20,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:20,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312808272] [2022-12-06 00:31:20,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312808272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:31:20,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:31:20,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:31:20,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23202792] [2022-12-06 00:31:20,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:31:20,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 00:31:20,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:20,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 00:31:20,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 00:31:20,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:31:20,944 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 00:31:20,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:20,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:31:20,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:21,356 INFO L130 PetriNetUnfolder]: 1411/2445 cut-off events. [2022-12-06 00:31:21,356 INFO L131 PetriNetUnfolder]: For 42768/42768 co-relation queries the response was YES. [2022-12-06 00:31:21,364 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 00:31:21,373 INFO L137 encePairwiseOnDemand]: 50/51 looper letters, 245 selfloop transitions, 0 changer transitions 1/246 dead transitions. [2022-12-06 00:31:21,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 246 transitions, 4803 flow [2022-12-06 00:31:21,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 00:31:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 00:31:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-12-06 00:31:21,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 00:31:21,374 INFO L175 Difference]: Start difference. First operand has 147 places, 248 transitions, 4360 flow. Second operand 2 states and 51 transitions. [2022-12-06 00:31:21,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 246 transitions, 4803 flow [2022-12-06 00:31:21,501 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 00:31:21,504 INFO L231 Difference]: Finished difference. Result has 144 places, 245 transitions, 4129 flow [2022-12-06 00:31:21,505 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 00:31:21,505 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 123 predicate places. [2022-12-06 00:31:21,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:21,505 INFO L89 Accepts]: Start accepts. Operand has 144 places, 245 transitions, 4129 flow [2022-12-06 00:31:21,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:21,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:21,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 245 transitions, 4129 flow [2022-12-06 00:31:21,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 245 transitions, 4129 flow [2022-12-06 00:31:21,589 INFO L130 PetriNetUnfolder]: 225/665 cut-off events. [2022-12-06 00:31:21,589 INFO L131 PetriNetUnfolder]: For 11389/11646 co-relation queries the response was YES. [2022-12-06 00:31:21,591 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 00:31:21,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 245 transitions, 4129 flow [2022-12-06 00:31:21,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 920 [2022-12-06 00:31:22,898 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 00:31:23,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:23,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2345 [2022-12-06 00:31:23,850 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 245 transitions, 4153 flow [2022-12-06 00:31:23,850 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 00:31:23,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:23,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:23,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 00:31:23,850 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 00:31:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:23,850 INFO L85 PathProgramCache]: Analyzing trace with hash 339381868, now seen corresponding path program 1 times [2022-12-06 00:31:23,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:23,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725186172] [2022-12-06 00:31:23,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:23,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:23,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 00:31:23,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725186172] [2022-12-06 00:31:23,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725186172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:23,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334456201] [2022-12-06 00:31:23,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:23,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:23,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:23,981 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 00:31:23,983 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 00:31:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:24,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:31:24,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:24,241 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 00:31:24,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:31:24,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334456201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:31:24,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:31:24,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-12-06 00:31:24,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875287765] [2022-12-06 00:31:24,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:31:24,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:31:24,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:24,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:31:24,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:31:24,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:31:24,242 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 00:31:24,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:24,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:31:24,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:24,739 INFO L130 PetriNetUnfolder]: 1409/2443 cut-off events. [2022-12-06 00:31:24,739 INFO L131 PetriNetUnfolder]: For 41970/41970 co-relation queries the response was YES. [2022-12-06 00:31:24,747 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 00:31:24,753 INFO L137 encePairwiseOnDemand]: 47/51 looper letters, 244 selfloop transitions, 3 changer transitions 5/252 dead transitions. [2022-12-06 00:31:24,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 252 transitions, 4715 flow [2022-12-06 00:31:24,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:31:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:31:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 00:31:24,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28921568627450983 [2022-12-06 00:31:24,768 INFO L175 Difference]: Start difference. First operand has 142 places, 245 transitions, 4153 flow. Second operand 4 states and 59 transitions. [2022-12-06 00:31:24,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 252 transitions, 4715 flow [2022-12-06 00:31:24,898 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 00:31:24,902 INFO L231 Difference]: Finished difference. Result has 146 places, 246 transitions, 4173 flow [2022-12-06 00:31:24,902 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 00:31:24,903 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 125 predicate places. [2022-12-06 00:31:24,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:24,903 INFO L89 Accepts]: Start accepts. Operand has 146 places, 246 transitions, 4173 flow [2022-12-06 00:31:24,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:24,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:24,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 246 transitions, 4173 flow [2022-12-06 00:31:24,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 246 transitions, 4173 flow [2022-12-06 00:31:24,984 INFO L130 PetriNetUnfolder]: 227/669 cut-off events. [2022-12-06 00:31:24,984 INFO L131 PetriNetUnfolder]: For 11704/11955 co-relation queries the response was YES. [2022-12-06 00:31:24,987 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 00:31:24,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 246 transitions, 4173 flow [2022-12-06 00:31:24,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 914 [2022-12-06 00:31:25,007 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 00:31:28,361 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:28,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3459 [2022-12-06 00:31:28,362 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 246 transitions, 4189 flow [2022-12-06 00:31:28,362 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 00:31:28,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:28,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:28,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 00:31:28,562 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 00:31:28,563 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 00:31:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2102858552, now seen corresponding path program 1 times [2022-12-06 00:31:28,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:28,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997097079] [2022-12-06 00:31:28,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:28,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:28,619 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 00:31:28,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:28,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997097079] [2022-12-06 00:31:28,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997097079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:31:28,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:31:28,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:31:28,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871010911] [2022-12-06 00:31:28,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:31:28,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:31:28,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:28,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:31:28,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:31:28,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 00:31:28,620 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 00:31:28,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:28,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 00:31:28,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:29,059 INFO L130 PetriNetUnfolder]: 1424/2460 cut-off events. [2022-12-06 00:31:29,059 INFO L131 PetriNetUnfolder]: For 43688/43688 co-relation queries the response was YES. [2022-12-06 00:31:29,068 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 00:31:29,075 INFO L137 encePairwiseOnDemand]: 44/52 looper letters, 244 selfloop transitions, 13 changer transitions 1/258 dead transitions. [2022-12-06 00:31:29,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 258 transitions, 4894 flow [2022-12-06 00:31:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:31:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:31:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-06 00:31:29,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-06 00:31:29,075 INFO L175 Difference]: Start difference. First operand has 144 places, 246 transitions, 4189 flow. Second operand 3 states and 57 transitions. [2022-12-06 00:31:29,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 258 transitions, 4894 flow [2022-12-06 00:31:29,215 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 00:31:29,218 INFO L231 Difference]: Finished difference. Result has 145 places, 249 transitions, 4259 flow [2022-12-06 00:31:29,218 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 00:31:29,219 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 124 predicate places. [2022-12-06 00:31:29,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:29,219 INFO L89 Accepts]: Start accepts. Operand has 145 places, 249 transitions, 4259 flow [2022-12-06 00:31:29,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:29,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:29,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 249 transitions, 4259 flow [2022-12-06 00:31:29,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 249 transitions, 4259 flow [2022-12-06 00:31:29,306 INFO L130 PetriNetUnfolder]: 230/677 cut-off events. [2022-12-06 00:31:29,306 INFO L131 PetriNetUnfolder]: For 12055/12306 co-relation queries the response was YES. [2022-12-06 00:31:29,308 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 00:31:29,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 249 transitions, 4259 flow [2022-12-06 00:31:29,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 926 [2022-12-06 00:31:29,313 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:31:29,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 00:31:29,314 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 249 transitions, 4259 flow [2022-12-06 00:31:29,314 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 00:31:29,314 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:29,314 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:29,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 00:31:29,314 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 00:31:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:29,315 INFO L85 PathProgramCache]: Analyzing trace with hash 652083889, now seen corresponding path program 1 times [2022-12-06 00:31:29,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:29,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259249379] [2022-12-06 00:31:29,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:29,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:33,531 INFO 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 00:31:33,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:33,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259249379] [2022-12-06 00:31:33,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259249379] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:33,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927138391] [2022-12-06 00:31:33,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:33,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:33,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:33,533 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 00:31:33,533 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 00:31:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:33,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 00:31:33,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:33,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:31:33,666 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 00:31:33,680 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 00:31:33,708 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 00:31:34,397 INFO L321 Elim1Store]: treesize reduction 477, result has 9.8 percent of original size [2022-12-06 00:31:34,398 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 00:31:34,447 INFO 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 00:31:34,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:37,793 INFO 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 00:31:37,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927138391] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:37,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:37,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 00:31:37,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131728338] [2022-12-06 00:31:37,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:37,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:31:37,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:31:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=126, Unknown=1, NotChecked=0, Total=182 [2022-12-06 00:31:37,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:31:37,795 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 00:31:37,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:37,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:31:37,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:42,403 INFO L130 PetriNetUnfolder]: 1493/2582 cut-off events. [2022-12-06 00:31:42,404 INFO L131 PetriNetUnfolder]: For 45238/45238 co-relation queries the response was YES. [2022-12-06 00:31:42,412 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 00:31:42,420 INFO L137 encePairwiseOnDemand]: 20/51 looper letters, 207 selfloop transitions, 60 changer transitions 5/272 dead transitions. [2022-12-06 00:31:42,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 272 transitions, 5082 flow [2022-12-06 00:31:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:31:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:31:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 00:31:42,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21568627450980393 [2022-12-06 00:31:42,421 INFO L175 Difference]: Start difference. First operand has 144 places, 249 transitions, 4259 flow. Second operand 6 states and 66 transitions. [2022-12-06 00:31:42,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 272 transitions, 5082 flow [2022-12-06 00:31:42,600 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 00:31:42,604 INFO L231 Difference]: Finished difference. Result has 149 places, 253 transitions, 4492 flow [2022-12-06 00:31:42,604 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 00:31:42,604 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 128 predicate places. [2022-12-06 00:31:42,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:42,604 INFO L89 Accepts]: Start accepts. Operand has 149 places, 253 transitions, 4492 flow [2022-12-06 00:31:42,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:42,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:42,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 253 transitions, 4492 flow [2022-12-06 00:31:42,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 253 transitions, 4492 flow [2022-12-06 00:31:42,713 INFO L130 PetriNetUnfolder]: 238/705 cut-off events. [2022-12-06 00:31:42,713 INFO L131 PetriNetUnfolder]: For 13212/13472 co-relation queries the response was YES. [2022-12-06 00:31:42,716 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 00:31:42,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 253 transitions, 4492 flow [2022-12-06 00:31:42,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 942 [2022-12-06 00:31:42,721 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:31:42,722 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-06 00:31:42,722 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 253 transitions, 4492 flow [2022-12-06 00:31:42,722 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 00:31:42,722 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:42,722 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:42,728 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 00:31:42,928 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 00:31:42,928 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 00:31:42,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash 101167995, now seen corresponding path program 1 times [2022-12-06 00:31:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:42,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681782646] [2022-12-06 00:31:42,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:42,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:50,331 INFO 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 00:31:50,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:50,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681782646] [2022-12-06 00:31:50,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681782646] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:50,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847396410] [2022-12-06 00:31:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:50,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:50,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:50,333 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 00:31:50,338 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 00:31:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:50,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-06 00:31:50,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:50,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:31:50,485 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 00:31:50,488 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 00:31:50,518 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 00:31:51,138 INFO L321 Elim1Store]: treesize reduction 477, result has 9.8 percent of original size [2022-12-06 00:31:51,139 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 00:31:51,192 INFO 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 00:31:51,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:56,090 INFO 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 00:31:56,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847396410] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:56,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:56,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 00:31:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313016455] [2022-12-06 00:31:56,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:56,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:31:56,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:56,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:31:56,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=129, Unknown=1, NotChecked=0, Total=182 [2022-12-06 00:31:56,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:31:56,092 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 00:31:56,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:56,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:31:56,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:03,634 INFO L130 PetriNetUnfolder]: 1564/2708 cut-off events. [2022-12-06 00:32:03,634 INFO L131 PetriNetUnfolder]: For 49370/49370 co-relation queries the response was YES. [2022-12-06 00:32:03,644 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 00:32:03,654 INFO L137 encePairwiseOnDemand]: 19/51 looper letters, 205 selfloop transitions, 76 changer transitions 2/283 dead transitions. [2022-12-06 00:32:03,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 283 transitions, 5493 flow [2022-12-06 00:32:03,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:32:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:32:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-06 00:32:03,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22549019607843138 [2022-12-06 00:32:03,657 INFO L175 Difference]: Start difference. First operand has 149 places, 253 transitions, 4492 flow. Second operand 6 states and 69 transitions. [2022-12-06 00:32:03,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 283 transitions, 5493 flow [2022-12-06 00:32:03,844 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 00:32:03,848 INFO L231 Difference]: Finished difference. Result has 152 places, 265 transitions, 4900 flow [2022-12-06 00:32:03,849 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 00:32:03,851 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 131 predicate places. [2022-12-06 00:32:03,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:03,851 INFO L89 Accepts]: Start accepts. Operand has 152 places, 265 transitions, 4900 flow [2022-12-06 00:32:03,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:03,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:03,853 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 265 transitions, 4900 flow [2022-12-06 00:32:03,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 265 transitions, 4900 flow [2022-12-06 00:32:03,945 INFO L130 PetriNetUnfolder]: 250/733 cut-off events. [2022-12-06 00:32:03,945 INFO L131 PetriNetUnfolder]: For 15133/15406 co-relation queries the response was YES. [2022-12-06 00:32:03,948 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 00:32:03,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 265 transitions, 4900 flow [2022-12-06 00:32:03,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 996 [2022-12-06 00:32:03,954 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:32:03,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 00:32:03,955 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 265 transitions, 4900 flow [2022-12-06 00:32:03,955 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 00:32:03,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:03,955 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:03,963 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 00:32:04,162 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 00:32:04,163 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 00:32:04,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash -131812946, now seen corresponding path program 2 times [2022-12-06 00:32:04,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:04,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791286119] [2022-12-06 00:32:04,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:04,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:04,264 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 00:32:04,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:04,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791286119] [2022-12-06 00:32:04,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791286119] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:04,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808080211] [2022-12-06 00:32:04,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:32:04,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:04,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:04,266 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 00:32:04,267 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 00:32:04,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:32:04,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:32:04,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:32:04,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:04,488 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 00:32:04,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:04,554 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 00:32:04,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808080211] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:04,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:04,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 00:32:04,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971277434] [2022-12-06 00:32:04,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:04,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:32:04,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:04,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:32:04,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:32:04,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:32:04,557 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 00:32:04,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:04,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:32:04,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:07,303 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 00:32:08,142 INFO L130 PetriNetUnfolder]: 1944/3380 cut-off events. [2022-12-06 00:32:08,142 INFO L131 PetriNetUnfolder]: For 69290/69290 co-relation queries the response was YES. [2022-12-06 00:32:08,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28880 conditions, 3380 events. 1944/3380 cut-off events. For 69290/69290 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21119 event pairs, 197 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 00:32:08,164 INFO L137 encePairwiseOnDemand]: 13/51 looper letters, 238 selfloop transitions, 235 changer transitions 52/525 dead transitions. [2022-12-06 00:32:08,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 525 transitions, 9956 flow [2022-12-06 00:32:08,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 00:32:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 00:32:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 191 transitions. [2022-12-06 00:32:08,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13870733478576616 [2022-12-06 00:32:08,166 INFO L175 Difference]: Start difference. First operand has 152 places, 265 transitions, 4900 flow. Second operand 27 states and 191 transitions. [2022-12-06 00:32:08,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 525 transitions, 9956 flow [2022-12-06 00:32:08,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 525 transitions, 9812 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-06 00:32:08,386 INFO L231 Difference]: Finished difference. Result has 186 places, 351 transitions, 7256 flow [2022-12-06 00:32:08,386 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=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=7256, PETRI_PLACES=186, PETRI_TRANSITIONS=351} [2022-12-06 00:32:08,387 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 165 predicate places. [2022-12-06 00:32:08,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:08,387 INFO L89 Accepts]: Start accepts. Operand has 186 places, 351 transitions, 7256 flow [2022-12-06 00:32:08,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:08,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:08,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 351 transitions, 7256 flow [2022-12-06 00:32:08,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 351 transitions, 7256 flow [2022-12-06 00:32:08,538 INFO L130 PetriNetUnfolder]: 340/957 cut-off events. [2022-12-06 00:32:08,538 INFO L131 PetriNetUnfolder]: For 32283/32919 co-relation queries the response was YES. [2022-12-06 00:32:08,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9528 conditions, 957 events. 340/957 cut-off events. For 32283/32919 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6906 event pairs, 10 based on Foata normal form. 0/946 useless extension candidates. Maximal degree in co-relation 9158. Up to 515 conditions per place. [2022-12-06 00:32:08,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 351 transitions, 7256 flow [2022-12-06 00:32:08,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 1146 [2022-12-06 00:32:11,942 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 00:32:12,142 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:32:12,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3756 [2022-12-06 00:32:12,143 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 350 transitions, 7263 flow [2022-12-06 00:32:12,143 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 00:32:12,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:12,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:12,150 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 00:32:12,343 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 00:32:12,343 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 00:32:12,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash -80322943, now seen corresponding path program 1 times [2022-12-06 00:32:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:12,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326749715] [2022-12-06 00:32:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:12,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:12,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326749715] [2022-12-06 00:32:12,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326749715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:12,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125683868] [2022-12-06 00:32:12,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:12,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:12,406 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 00:32:12,415 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 00:32:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:12,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:32:12,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:12,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:12,548 INFO 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 00:32:12,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125683868] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:12,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:12,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 00:32:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637984310] [2022-12-06 00:32:12,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:12,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:32:12,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:12,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:32:12,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:32:12,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 00:32:12,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 350 transitions, 7263 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 00:32:12,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:12,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 00:32:12,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:13,873 INFO L130 PetriNetUnfolder]: 2375/4098 cut-off events. [2022-12-06 00:32:13,873 INFO L131 PetriNetUnfolder]: For 141043/141043 co-relation queries the response was YES. [2022-12-06 00:32:13,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43794 conditions, 4098 events. 2375/4098 cut-off events. For 141043/141043 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 25775 event pairs, 602 based on Foata normal form. 2/4097 useless extension candidates. Maximal degree in co-relation 42294. Up to 2620 conditions per place. [2022-12-06 00:32:13,906 INFO L137 encePairwiseOnDemand]: 29/53 looper letters, 286 selfloop transitions, 182 changer transitions 1/469 dead transitions. [2022-12-06 00:32:13,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 469 transitions, 10396 flow [2022-12-06 00:32:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:32:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:32:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 00:32:13,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23180592991913745 [2022-12-06 00:32:13,932 INFO L175 Difference]: Start difference. First operand has 183 places, 350 transitions, 7263 flow. Second operand 7 states and 86 transitions. [2022-12-06 00:32:13,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 469 transitions, 10396 flow [2022-12-06 00:32:14,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 469 transitions, 9208 flow, removed 542 selfloop flow, removed 6 redundant places. [2022-12-06 00:32:14,346 INFO L231 Difference]: Finished difference. Result has 185 places, 434 transitions, 8460 flow [2022-12-06 00:32:14,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=6199, 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=8460, PETRI_PLACES=185, PETRI_TRANSITIONS=434} [2022-12-06 00:32:14,347 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2022-12-06 00:32:14,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:14,347 INFO L89 Accepts]: Start accepts. Operand has 185 places, 434 transitions, 8460 flow [2022-12-06 00:32:14,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:14,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:14,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 434 transitions, 8460 flow [2022-12-06 00:32:14,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 434 transitions, 8460 flow [2022-12-06 00:32:14,525 INFO L130 PetriNetUnfolder]: 422/1174 cut-off events. [2022-12-06 00:32:14,525 INFO L131 PetriNetUnfolder]: For 48196/49328 co-relation queries the response was YES. [2022-12-06 00:32:14,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12193 conditions, 1174 events. 422/1174 cut-off events. For 48196/49328 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8731 event pairs, 10 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 11317. Up to 588 conditions per place. [2022-12-06 00:32:14,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 434 transitions, 8460 flow [2022-12-06 00:32:14,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 1474 [2022-12-06 00:32:14,671 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 00:32:14,992 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:32:14,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 647 [2022-12-06 00:32:14,994 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 434 transitions, 8478 flow [2022-12-06 00:32:14,994 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 00:32:14,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:14,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:15,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 00:32:15,199 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 00:32:15,200 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 00:32:15,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash -650431766, now seen corresponding path program 1 times [2022-12-06 00:32:15,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:15,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706749954] [2022-12-06 00:32:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:15,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:15,288 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 00:32:15,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:15,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706749954] [2022-12-06 00:32:15,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706749954] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:15,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094315917] [2022-12-06 00:32:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:15,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:15,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:15,309 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 00:32:15,310 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 00:32:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:15,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 88 conjunts are in the unsatisfiable core [2022-12-06 00:32:15,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:15,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:32:15,460 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 00:32:15,462 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 00:32:15,493 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 00:32:17,895 INFO L321 Elim1Store]: treesize reduction 1496, result has 4.0 percent of original size [2022-12-06 00:32:17,895 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 00:32:17,936 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 00:32:17,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:27,287 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 00:32:27,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094315917] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:27,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:27,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 00:32:27,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540411377] [2022-12-06 00:32:27,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:27,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:32:27,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:27,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:32:27,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=168, Unknown=2, NotChecked=0, Total=210 [2022-12-06 00:32:27,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 00:32:27,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 434 transitions, 8478 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 00:32:27,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:27,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 00:32:27,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:45,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:33:08,927 INFO L130 PetriNetUnfolder]: 2633/4564 cut-off events. [2022-12-06 00:33:08,927 INFO L131 PetriNetUnfolder]: For 162052/162052 co-relation queries the response was YES. [2022-12-06 00:33:08,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48179 conditions, 4564 events. 2633/4564 cut-off events. For 162052/162052 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 29119 event pairs, 258 based on Foata normal form. 13/4574 useless extension candidates. Maximal degree in co-relation 45405. Up to 1927 conditions per place. [2022-12-06 00:33:08,963 INFO L137 encePairwiseOnDemand]: 19/55 looper letters, 222 selfloop transitions, 290 changer transitions 34/546 dead transitions. [2022-12-06 00:33:08,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 546 transitions, 11541 flow [2022-12-06 00:33:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:33:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:33:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 138 transitions. [2022-12-06 00:33:08,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14759358288770053 [2022-12-06 00:33:08,964 INFO L175 Difference]: Start difference. First operand has 185 places, 434 transitions, 8478 flow. Second operand 17 states and 138 transitions. [2022-12-06 00:33:08,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 546 transitions, 11541 flow [2022-12-06 00:33:09,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 546 transitions, 11389 flow, removed 74 selfloop flow, removed 1 redundant places. [2022-12-06 00:33:09,404 INFO L231 Difference]: Finished difference. Result has 203 places, 458 transitions, 9809 flow [2022-12-06 00:33:09,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=8344, 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=9809, PETRI_PLACES=203, PETRI_TRANSITIONS=458} [2022-12-06 00:33:09,404 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 182 predicate places. [2022-12-06 00:33:09,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:33:09,405 INFO L89 Accepts]: Start accepts. Operand has 203 places, 458 transitions, 9809 flow [2022-12-06 00:33:09,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:33:09,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:33:09,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 458 transitions, 9809 flow [2022-12-06 00:33:09,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 458 transitions, 9809 flow [2022-12-06 00:33:09,607 INFO L130 PetriNetUnfolder]: 454/1282 cut-off events. [2022-12-06 00:33:09,607 INFO L131 PetriNetUnfolder]: For 56149/57341 co-relation queries the response was YES. [2022-12-06 00:33:09,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14272 conditions, 1282 events. 454/1282 cut-off events. For 56149/57341 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9781 event pairs, 9 based on Foata normal form. 1/1267 useless extension candidates. Maximal degree in co-relation 13340. Up to 645 conditions per place. [2022-12-06 00:33:09,622 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 458 transitions, 9809 flow [2022-12-06 00:33:09,622 INFO L188 LiptonReduction]: Number of co-enabled transitions 1566 [2022-12-06 00:33:09,636 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 00:33:09,973 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 00:33:14,364 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:33:14,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4960 [2022-12-06 00:33:14,365 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 458 transitions, 9834 flow [2022-12-06 00:33:14,365 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 00:33:14,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:33:14,365 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:33:14,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 00:33:14,570 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 00:33:14,570 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 00:33:14,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:33:14,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1416216302, now seen corresponding path program 1 times [2022-12-06 00:33:14,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:33:14,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425839225] [2022-12-06 00:33:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:33:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:33:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:33:14,710 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 00:33:14,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:33:14,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425839225] [2022-12-06 00:33:14,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425839225] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:33:14,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612513584] [2022-12-06 00:33:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:33:14,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:33:14,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:33:14,711 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 00:33:14,713 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 00:33:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:33:14,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:33:14,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:33:14,848 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 00:33:14,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:33:14,874 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 00:33:14,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612513584] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:33:14,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:33:14,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-12-06 00:33:14,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630900563] [2022-12-06 00:33:14,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:33:14,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:33:14,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:33:14,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:33:14,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:33:14,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 00:33:14,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 458 transitions, 9834 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 00:33:14,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:33:14,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 00:33:14,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:33:16,198 INFO L130 PetriNetUnfolder]: 2548/4406 cut-off events. [2022-12-06 00:33:16,199 INFO L131 PetriNetUnfolder]: For 176149/176149 co-relation queries the response was YES. [2022-12-06 00:33:16,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49184 conditions, 4406 events. 2548/4406 cut-off events. For 176149/176149 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 27627 event pairs, 1175 based on Foata normal form. 30/4433 useless extension candidates. Maximal degree in co-relation 46119. Up to 4085 conditions per place. [2022-12-06 00:33:16,233 INFO L137 encePairwiseOnDemand]: 36/57 looper letters, 393 selfloop transitions, 105 changer transitions 1/499 dead transitions. [2022-12-06 00:33:16,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 499 transitions, 11368 flow [2022-12-06 00:33:16,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:33:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:33:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-12-06 00:33:16,235 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13630229419703105 [2022-12-06 00:33:16,235 INFO L175 Difference]: Start difference. First operand has 199 places, 458 transitions, 9834 flow. Second operand 13 states and 101 transitions. [2022-12-06 00:33:16,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 499 transitions, 11368 flow [2022-12-06 00:33:16,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 499 transitions, 11059 flow, removed 87 selfloop flow, removed 7 redundant places. [2022-12-06 00:33:16,732 INFO L231 Difference]: Finished difference. Result has 207 places, 461 transitions, 9940 flow [2022-12-06 00:33:16,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=9547, 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=9940, PETRI_PLACES=207, PETRI_TRANSITIONS=461} [2022-12-06 00:33:16,734 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 186 predicate places. [2022-12-06 00:33:16,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:33:16,734 INFO L89 Accepts]: Start accepts. Operand has 207 places, 461 transitions, 9940 flow [2022-12-06 00:33:16,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:33:16,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:33:16,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 461 transitions, 9940 flow [2022-12-06 00:33:16,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 461 transitions, 9940 flow [2022-12-06 00:33:16,970 INFO L130 PetriNetUnfolder]: 449/1271 cut-off events. [2022-12-06 00:33:16,970 INFO L131 PetriNetUnfolder]: For 54689/55832 co-relation queries the response was YES. [2022-12-06 00:33:16,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14285 conditions, 1271 events. 449/1271 cut-off events. For 54689/55832 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9704 event pairs, 9 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 13300. Up to 645 conditions per place. [2022-12-06 00:33:16,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 461 transitions, 9940 flow [2022-12-06 00:33:16,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 1578 [2022-12-06 00:33:17,126 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 00:33:19,702 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 00:33:20,733 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 00:33:21,967 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 00:33:23,712 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 00:33:25,613 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:33:25,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8880 [2022-12-06 00:33:25,614 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 460 transitions, 10040 flow [2022-12-06 00:33:25,614 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 00:33:25,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:33:25,614 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:33:25,619 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 00:33:25,814 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 00:33:25,815 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 00:33:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:33:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1229519749, now seen corresponding path program 1 times [2022-12-06 00:33:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:33:25,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938012586] [2022-12-06 00:33:25,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:33:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:33:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:33:25,952 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 00:33:25,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:33:25,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938012586] [2022-12-06 00:33:25,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938012586] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:33:25,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305434070] [2022-12-06 00:33:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:33:25,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:33:25,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:33:25,954 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 00:33:25,972 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 00:33:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:33:26,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:33:26,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:33:26,121 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 00:33:26,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:33:26,180 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 00:33:26,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305434070] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:33:26,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:33:26,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-12-06 00:33:26,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359098649] [2022-12-06 00:33:26,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:33:26,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:33:26,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:33:26,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:33:26,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:33:26,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 00:33:26,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 460 transitions, 10040 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 00:33:26,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:33:26,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 00:33:26,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:33:28,863 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 00:33:30,568 INFO L130 PetriNetUnfolder]: 2898/5050 cut-off events. [2022-12-06 00:33:30,568 INFO L131 PetriNetUnfolder]: For 212670/212670 co-relation queries the response was YES. [2022-12-06 00:33:30,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58344 conditions, 5050 events. 2898/5050 cut-off events. For 212670/212670 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 33282 event pairs, 631 based on Foata normal form. 84/5131 useless extension candidates. Maximal degree in co-relation 54601. Up to 2899 conditions per place. [2022-12-06 00:33:30,610 INFO L137 encePairwiseOnDemand]: 20/63 looper letters, 351 selfloop transitions, 355 changer transitions 4/710 dead transitions. [2022-12-06 00:33:30,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 710 transitions, 17599 flow [2022-12-06 00:33:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 00:33:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 00:33:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 133 transitions. [2022-12-06 00:33:30,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11728395061728394 [2022-12-06 00:33:30,620 INFO L175 Difference]: Start difference. First operand has 205 places, 460 transitions, 10040 flow. Second operand 18 states and 133 transitions. [2022-12-06 00:33:30,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 710 transitions, 17599 flow [2022-12-06 00:33:31,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 710 transitions, 17281 flow, removed 113 selfloop flow, removed 2 redundant places. [2022-12-06 00:33:31,257 INFO L231 Difference]: Finished difference. Result has 227 places, 620 transitions, 14868 flow [2022-12-06 00:33:31,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=9741, 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=14868, PETRI_PLACES=227, PETRI_TRANSITIONS=620} [2022-12-06 00:33:31,257 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 206 predicate places. [2022-12-06 00:33:31,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:33:31,257 INFO L89 Accepts]: Start accepts. Operand has 227 places, 620 transitions, 14868 flow [2022-12-06 00:33:31,260 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:33:31,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:33:31,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 620 transitions, 14868 flow [2022-12-06 00:33:31,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 620 transitions, 14868 flow [2022-12-06 00:33:31,586 INFO L130 PetriNetUnfolder]: 702/1785 cut-off events. [2022-12-06 00:33:31,586 INFO L131 PetriNetUnfolder]: For 86764/87426 co-relation queries the response was YES. [2022-12-06 00:33:31,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22871 conditions, 1785 events. 702/1785 cut-off events. For 86764/87426 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 13775 event pairs, 24 based on Foata normal form. 5/1753 useless extension candidates. Maximal degree in co-relation 22087. Up to 988 conditions per place. [2022-12-06 00:33:31,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 620 transitions, 14868 flow [2022-12-06 00:33:31,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 1708 [2022-12-06 00:33:31,632 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 00:33:31,726 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 00:33:31,816 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 00:33:31,911 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 00:33:32,005 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 00:33:32,100 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 00:33:32,192 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 00:33:32,280 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 00:33:32,356 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 00:33:32,431 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 00:33:32,558 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 00:33:32,649 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 00:33:32,740 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 00:33:32,831 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 00:33:32,925 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 00:33:33,019 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 00:33:33,119 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 00:33:33,211 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 00:33:33,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 00:33:33,399 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 00:33:33,494 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 00:33:33,587 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 00:33:33,682 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 00:33:33,779 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 00:33:33,868 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 00:33:33,965 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 00:33:34,054 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 00:33:34,143 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 00:33:34,233 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 00:33:34,321 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 00:33:34,411 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 00:33:34,500 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 00:33:34,593 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 00:33:34,683 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 00:33:34,772 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 00:33:34,860 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 00:33:34,952 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 00:33:35,043 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 00:33:35,134 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 00:33:35,224 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 00:33:35,317 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 00:33:35,408 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 00:33:35,502 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 00:33:35,596 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 00:33:35,688 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 00:33:35,777 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 00:33:35,868 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 00:33:36,021 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 00:33:36,112 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 00:33:37,363 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:33:37,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6106 [2022-12-06 00:33:37,364 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 619 transitions, 16508 flow [2022-12-06 00:33:37,364 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 00:33:37,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:33:37,364 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:33:37,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-06 00:33:37,564 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 00:33:37,564 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 00:33:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:33:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash -518979359, now seen corresponding path program 1 times [2022-12-06 00:33:37,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:33:37,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912577601] [2022-12-06 00:33:37,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:33:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:33:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:33:37,638 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 00:33:37,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:33:37,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912577601] [2022-12-06 00:33:37,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912577601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:33:37,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957460829] [2022-12-06 00:33:37,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:33:37,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:33:37,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:33:37,640 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 00:33:37,641 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 00:33:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:33:37,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:33:37,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:33:37,834 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 00:33:37,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:33:37,859 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 00:33:37,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957460829] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:33:37,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:33:37,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 00:33:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892039839] [2022-12-06 00:33:37,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:33:37,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:33:37,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:33:37,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:33:37,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:33:37,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-06 00:33:37,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 619 transitions, 16508 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 00:33:37,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:33:37,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-06 00:33:37,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:33:39,579 INFO L130 PetriNetUnfolder]: 2807/4814 cut-off events. [2022-12-06 00:33:39,580 INFO L131 PetriNetUnfolder]: For 255965/255965 co-relation queries the response was YES. [2022-12-06 00:33:39,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61455 conditions, 4814 events. 2807/4814 cut-off events. For 255965/255965 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 30644 event pairs, 992 based on Foata normal form. 16/4827 useless extension candidates. Maximal degree in co-relation 59307. Up to 4144 conditions per place. [2022-12-06 00:33:39,705 INFO L137 encePairwiseOnDemand]: 80/110 looper letters, 549 selfloop transitions, 114 changer transitions 5/668 dead transitions. [2022-12-06 00:33:39,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 668 transitions, 18671 flow [2022-12-06 00:33:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:33:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:33:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2022-12-06 00:33:39,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2106060606060606 [2022-12-06 00:33:39,707 INFO L175 Difference]: Start difference. First operand has 223 places, 619 transitions, 16508 flow. Second operand 6 states and 139 transitions. [2022-12-06 00:33:39,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 668 transitions, 18671 flow [2022-12-06 00:33:40,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 668 transitions, 17622 flow, removed 310 selfloop flow, removed 9 redundant places. [2022-12-06 00:33:40,563 INFO L231 Difference]: Finished difference. Result has 222 places, 620 transitions, 15887 flow [2022-12-06 00:33:40,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=15485, 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=15887, PETRI_PLACES=222, PETRI_TRANSITIONS=620} [2022-12-06 00:33:40,563 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 201 predicate places. [2022-12-06 00:33:40,563 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:33:40,563 INFO L89 Accepts]: Start accepts. Operand has 222 places, 620 transitions, 15887 flow [2022-12-06 00:33:40,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:33:40,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:33:40,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 620 transitions, 15887 flow [2022-12-06 00:33:40,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 620 transitions, 15887 flow [2022-12-06 00:33:40,924 INFO L130 PetriNetUnfolder]: 693/1708 cut-off events. [2022-12-06 00:33:40,924 INFO L131 PetriNetUnfolder]: For 83912/84589 co-relation queries the response was YES. [2022-12-06 00:33:40,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22235 conditions, 1708 events. 693/1708 cut-off events. For 83912/84589 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12728 event pairs, 26 based on Foata normal form. 5/1677 useless extension candidates. Maximal degree in co-relation 20814. Up to 982 conditions per place. [2022-12-06 00:33:40,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 620 transitions, 15887 flow [2022-12-06 00:33:40,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 1718 [2022-12-06 00:33:40,956 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:33:40,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 394 [2022-12-06 00:33:40,957 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 620 transitions, 15887 flow [2022-12-06 00:33:40,957 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 00:33:40,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:33:40,957 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:33:40,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-06 00:33:41,162 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 00:33:41,162 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 00:33:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:33:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1360766859, now seen corresponding path program 1 times [2022-12-06 00:33:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:33:41,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818117036] [2022-12-06 00:33:41,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:33:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:33:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:33:47,301 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 00:33:47,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:33:47,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818117036] [2022-12-06 00:33:47,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818117036] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:33:47,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469927549] [2022-12-06 00:33:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:33:47,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:33:47,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:33:47,303 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 00:33:47,306 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 00:33:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:33:47,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 103 conjunts are in the unsatisfiable core [2022-12-06 00:33:47,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:33:47,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:33:47,492 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 00:33:47,495 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 00:33:47,525 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 00:33:49,531 INFO L321 Elim1Store]: treesize reduction 897, result has 6.7 percent of original size [2022-12-06 00:33:49,532 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 00:33:49,585 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 00:33:49,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:34:02,906 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 00:34:02,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469927549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:34:02,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:34:02,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 18 [2022-12-06 00:34:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400812091] [2022-12-06 00:34:02,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:34:02,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:34:02,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:34:02,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:34:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=296, Unknown=2, NotChecked=0, Total=380 [2022-12-06 00:34:02,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-06 00:34:02,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 620 transitions, 15887 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 00:34:02,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:34:02,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-06 00:34:02,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:28,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:34:58,264 INFO L130 PetriNetUnfolder]: 2910/4999 cut-off events. [2022-12-06 00:34:58,264 INFO L131 PetriNetUnfolder]: For 248848/248848 co-relation queries the response was YES. [2022-12-06 00:34:58,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63220 conditions, 4999 events. 2910/4999 cut-off events. For 248848/248848 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 32068 event pairs, 214 based on Foata normal form. 3/4999 useless extension candidates. Maximal degree in co-relation 59164. Up to 2451 conditions per place. [2022-12-06 00:34:58,306 INFO L137 encePairwiseOnDemand]: 32/110 looper letters, 298 selfloop transitions, 372 changer transitions 11/681 dead transitions. [2022-12-06 00:34:58,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 681 transitions, 18504 flow [2022-12-06 00:34:58,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:34:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:34:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2022-12-06 00:34:58,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16363636363636364 [2022-12-06 00:34:58,308 INFO L175 Difference]: Start difference. First operand has 222 places, 620 transitions, 15887 flow. Second operand 8 states and 144 transitions. [2022-12-06 00:34:58,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 681 transitions, 18504 flow [2022-12-06 00:34:59,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 681 transitions, 18335 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-06 00:34:59,146 INFO L231 Difference]: Finished difference. Result has 230 places, 634 transitions, 17629 flow [2022-12-06 00:34:59,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=15718, 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=17629, PETRI_PLACES=230, PETRI_TRANSITIONS=634} [2022-12-06 00:34:59,147 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 209 predicate places. [2022-12-06 00:34:59,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:59,147 INFO L89 Accepts]: Start accepts. Operand has 230 places, 634 transitions, 17629 flow [2022-12-06 00:34:59,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:59,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:59,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 634 transitions, 17629 flow [2022-12-06 00:34:59,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 634 transitions, 17629 flow [2022-12-06 00:34:59,549 INFO L130 PetriNetUnfolder]: 719/1785 cut-off events. [2022-12-06 00:34:59,549 INFO L131 PetriNetUnfolder]: For 94798/95446 co-relation queries the response was YES. [2022-12-06 00:34:59,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24237 conditions, 1785 events. 719/1785 cut-off events. For 94798/95446 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13543 event pairs, 28 based on Foata normal form. 4/1754 useless extension candidates. Maximal degree in co-relation 22698. Up to 1019 conditions per place. [2022-12-06 00:34:59,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 634 transitions, 17629 flow [2022-12-06 00:34:59,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 1756 [2022-12-06 00:34:59,594 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 00:35:00,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:35:00,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1236 [2022-12-06 00:35:00,383 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 634 transitions, 17655 flow [2022-12-06 00:35:00,383 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 00:35:00,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:35:00,383 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:35:00,389 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 00:35:00,583 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 00:35:00,583 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 00:35:00,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:35:00,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2041254401, now seen corresponding path program 1 times [2022-12-06 00:35:00,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:35:00,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868878558] [2022-12-06 00:35:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:35:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:35:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:35:00,662 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 00:35:00,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:35:00,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868878558] [2022-12-06 00:35:00,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868878558] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:35:00,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707888523] [2022-12-06 00:35:00,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:35:00,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:35:00,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:35:00,664 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 00:35:00,665 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 00:35:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:35:00,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 00:35:00,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:35:00,808 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 00:35:00,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:35:01,968 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 00:35:01,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707888523] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:35:01,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:35:01,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 00:35:01,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42288894] [2022-12-06 00:35:01,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:35:01,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:35:01,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:35:01,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:35:01,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:35:01,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 112 [2022-12-06 00:35:01,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 634 transitions, 17655 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 00:35:01,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:35:01,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 112 [2022-12-06 00:35:01,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:35:04,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:35:12,708 INFO L130 PetriNetUnfolder]: 3243/5677 cut-off events. [2022-12-06 00:35:12,709 INFO L131 PetriNetUnfolder]: For 316158/316158 co-relation queries the response was YES. [2022-12-06 00:35:12,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74186 conditions, 5677 events. 3243/5677 cut-off events. For 316158/316158 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 38363 event pairs, 760 based on Foata normal form. 6/5680 useless extension candidates. Maximal degree in co-relation 69875. Up to 3321 conditions per place. [2022-12-06 00:35:12,759 INFO L137 encePairwiseOnDemand]: 76/112 looper letters, 623 selfloop transitions, 154 changer transitions 40/817 dead transitions. [2022-12-06 00:35:12,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 817 transitions, 23449 flow [2022-12-06 00:35:12,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:35:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:35:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 179 transitions. [2022-12-06 00:35:12,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09988839285714286 [2022-12-06 00:35:12,760 INFO L175 Difference]: Start difference. First operand has 230 places, 634 transitions, 17655 flow. Second operand 16 states and 179 transitions. [2022-12-06 00:35:12,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 817 transitions, 23449 flow [2022-12-06 00:35:13,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 817 transitions, 23352 flow, removed 26 selfloop flow, removed 3 redundant places. [2022-12-06 00:35:13,718 INFO L231 Difference]: Finished difference. Result has 250 places, 671 transitions, 19153 flow [2022-12-06 00:35:13,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=17558, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=19153, PETRI_PLACES=250, PETRI_TRANSITIONS=671} [2022-12-06 00:35:13,719 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 229 predicate places. [2022-12-06 00:35:13,719 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:35:13,719 INFO L89 Accepts]: Start accepts. Operand has 250 places, 671 transitions, 19153 flow [2022-12-06 00:35:13,723 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:35:13,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:35:13,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 671 transitions, 19153 flow [2022-12-06 00:35:13,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 671 transitions, 19153 flow [2022-12-06 00:35:14,169 INFO L130 PetriNetUnfolder]: 769/1991 cut-off events. [2022-12-06 00:35:14,169 INFO L131 PetriNetUnfolder]: For 119410/120366 co-relation queries the response was YES. [2022-12-06 00:35:14,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28065 conditions, 1991 events. 769/1991 cut-off events. For 119410/120366 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15993 event pairs, 25 based on Foata normal form. 4/1957 useless extension candidates. Maximal degree in co-relation 27576. Up to 1113 conditions per place. [2022-12-06 00:35:14,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 671 transitions, 19153 flow [2022-12-06 00:35:14,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 1828 [2022-12-06 00:35:14,480 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 00:35:14,699 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 00:35:14,886 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 00:35:15,076 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 00:35:15,265 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 00:35:15,441 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 00:35:15,628 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 00:35:15,857 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 [894] L59-2-->L59-2: Formula: (let ((.cse8 (select |v_#memory_int_462| v_~f~0.base_360))) (let ((.cse7 (select .cse8 (+ v_~f~0.offset_360 (* v_~x2~0_502 4))))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_360 (* .cse7 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_360 (* .cse3 4))))) (let ((.cse5 (select .cse8 (+ v_~f~0.offset_360 (* 4 .cse2))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_360 (* .cse5 4))))) (let ((.cse6 (select .cse8 (+ v_~f~0.offset_360 (* .cse4 4))))) (let ((.cse0 (* (mod v_~n~0_346 1073741824) 4)) (.cse1 (select .cse8 (+ v_~f~0.offset_360 (* .cse6 4))))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_540| 4294967296) .cse0) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_540| 4) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_289| (ite (and (< .cse1 v_~size~0_366) (<= 0 .cse1)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_366)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_502 v_~size~0_366) (<= 0 v_~x2~0_502)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_366)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_366)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_366)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_540| 8) |v_thread2Thread1of1ForFork1_~i~1#1_538|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_289| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_329|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_366)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_366)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_329| 0)) (= v_~x2~0_500 (select .cse8 (+ v_~f~0.offset_360 (* .cse1 4))))))))))))) InVars {~x2~0=v_~x2~0_502, ~size~0=v_~size~0_366, ~f~0.base=v_~f~0.base_360, #memory_int=|v_#memory_int_462|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_540|, ~n~0=v_~n~0_346, ~f~0.offset=v_~f~0.offset_360} OutVars{~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|, ~f~0.offset=v_~f~0.offset_360, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_329|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_223|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_221|, #memory_int=|v_#memory_int_462|, 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, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_237|} 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 00:35:18,640 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-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_464| v_~f~0.base_362))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_362 (* v_~x2~0_507 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_362 (* .cse4 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_362 (* .cse0 4)))) (.cse3 (* (mod v_~n~0_348 1073741824) 4))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_333| 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)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_368)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_455| 0)) (= (select .cse1 (+ v_~f~0.offset_362 (* .cse2 4))) v_~x2~0_506) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_545| 4) |v_thread2Thread1of1ForFork1_~i~1#1_544|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_642| 4294967296) .cse3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_333|) (not (= (ite (and (<= 0 v_~x2~0_507) (< v_~x2~0_507 v_~size~0_368)) 1 0) 0)) (= (ite (and (< v_~x1~0_769 v_~size~0_368) (<= 0 v_~x1~0_769)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_451|) (not (= (ite (and (< .cse4 v_~size~0_368) (<= 0 .cse4)) 1 0) 0)) (= v_~x1~0_768 (select .cse1 (+ v_~f~0.offset_362 (* v_~x1~0_769 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_368)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_545| 4294967296) .cse3)))))) InVars {~x2~0=v_~x2~0_507, ~size~0=v_~size~0_368, ~f~0.base=v_~f~0.base_362, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_642|, #memory_int=|v_#memory_int_464|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_545|, ~n~0=v_~n~0_348, ~x1~0=v_~x1~0_769, ~f~0.offset=v_~f~0.offset_362} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_445|, ~x2~0=v_~x2~0_506, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_227|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_245|, ~size~0=v_~size~0_368, ~f~0.base=v_~f~0.base_362, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_233|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_544|, ~x1~0=v_~x1~0_768, ~f~0.offset=v_~f~0.offset_362, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_333|, 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_227|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_225|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_641|, #memory_int=|v_#memory_int_464|, 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_239|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_239|, ~n~0=v_~n~0_348, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_455|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_241|} 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 00:35:21,962 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 00:35:23,793 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:35:23,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10075 [2022-12-06 00:35:23,794 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 671 transitions, 19325 flow [2022-12-06 00:35:23,794 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 00:35:23,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:35:23,794 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:35:23,800 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 00:35:24,000 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 00:35:24,000 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 00:35:24,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:35:24,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1865857616, now seen corresponding path program 1 times [2022-12-06 00:35:24,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:35:24,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649997430] [2022-12-06 00:35:24,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:35:24,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:35:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:35:24,093 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 00:35:24,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:35:24,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649997430] [2022-12-06 00:35:24,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649997430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:35:24,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119393243] [2022-12-06 00:35:24,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:35:24,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:35:24,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:35:24,109 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 00:35:24,163 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 00:35:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:35:24,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 00:35:24,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:35:24,535 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 00:35:24,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:35:24,587 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 00:35:24,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119393243] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:35:24,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:35:24,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 00:35:24,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341849633] [2022-12-06 00:35:24,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:35:24,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:35:24,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:35:24,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:35:24,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:35:24,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 121 [2022-12-06 00:35:24,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 671 transitions, 19325 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 00:35:24,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:35:24,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 121 [2022-12-06 00:35:24,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:35:28,152 INFO L130 PetriNetUnfolder]: 3249/5754 cut-off events. [2022-12-06 00:35:28,152 INFO L131 PetriNetUnfolder]: For 359774/359774 co-relation queries the response was YES. [2022-12-06 00:35:28,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78650 conditions, 5754 events. 3249/5754 cut-off events. For 359774/359774 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 39816 event pairs, 888 based on Foata normal form. 4/5755 useless extension candidates. Maximal degree in co-relation 77253. Up to 3747 conditions per place. [2022-12-06 00:35:28,207 INFO L137 encePairwiseOnDemand]: 77/121 looper letters, 570 selfloop transitions, 163 changer transitions 33/766 dead transitions. [2022-12-06 00:35:28,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 766 transitions, 23104 flow [2022-12-06 00:35:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 00:35:28,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 00:35:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 178 transitions. [2022-12-06 00:35:28,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09807162534435261 [2022-12-06 00:35:28,208 INFO L175 Difference]: Start difference. First operand has 246 places, 671 transitions, 19325 flow. Second operand 15 states and 178 transitions. [2022-12-06 00:35:28,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 766 transitions, 23104 flow [2022-12-06 00:35:29,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 766 transitions, 22659 flow, removed 217 selfloop flow, removed 5 redundant places. [2022-12-06 00:35:29,576 INFO L231 Difference]: Finished difference. Result has 266 places, 689 transitions, 20198 flow [2022-12-06 00:35:29,576 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=18979, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=20198, PETRI_PLACES=266, PETRI_TRANSITIONS=689} [2022-12-06 00:35:29,577 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 245 predicate places. [2022-12-06 00:35:29,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:35:29,577 INFO L89 Accepts]: Start accepts. Operand has 266 places, 689 transitions, 20198 flow [2022-12-06 00:35:29,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:35:29,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:35:29,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 689 transitions, 20198 flow [2022-12-06 00:35:29,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 689 transitions, 20198 flow [2022-12-06 00:35:30,079 INFO L130 PetriNetUnfolder]: 792/2055 cut-off events. [2022-12-06 00:35:30,079 INFO L131 PetriNetUnfolder]: For 121130/121967 co-relation queries the response was YES. [2022-12-06 00:35:30,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29133 conditions, 2055 events. 792/2055 cut-off events. For 121130/121967 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 16719 event pairs, 29 based on Foata normal form. 1/2016 useless extension candidates. Maximal degree in co-relation 28997. Up to 1137 conditions per place. [2022-12-06 00:35:30,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 689 transitions, 20198 flow [2022-12-06 00:35:30,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 1856 [2022-12-06 00:35:31,199 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 00:35:34,206 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:35:34,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4630 [2022-12-06 00:35:34,207 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 689 transitions, 20271 flow [2022-12-06 00:35:34,207 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 00:35:34,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:35:34,207 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:35:34,216 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 00:35:34,413 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 00:35:34,414 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 00:35:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:35:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1225138352, now seen corresponding path program 1 times [2022-12-06 00:35:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:35:34,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223513365] [2022-12-06 00:35:34,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:35:34,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:35:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:35:34,550 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 00:35:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:35:34,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223513365] [2022-12-06 00:35:34,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223513365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:35:34,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246371854] [2022-12-06 00:35:34,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:35:34,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:35:34,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:35:34,552 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 00:35:34,554 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 00:35:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:35:34,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:35:34,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:35:34,731 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 00:35:34,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:35:34,827 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 00:35:34,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246371854] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:35:34,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:35:34,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 00:35:34,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941055619] [2022-12-06 00:35:34,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:35:34,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:35:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:35:34,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:35:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-06 00:35:34,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 123 [2022-12-06 00:35:34,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 689 transitions, 20271 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 00:35:34,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:35:34,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 123 [2022-12-06 00:35:34,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:35:38,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 00:35:40,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 00:35:42,261 INFO L130 PetriNetUnfolder]: 3284/5769 cut-off events. [2022-12-06 00:35:42,261 INFO L131 PetriNetUnfolder]: For 358919/358919 co-relation queries the response was YES. [2022-12-06 00:35:42,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78869 conditions, 5769 events. 3284/5769 cut-off events. For 358919/358919 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 39404 event pairs, 1207 based on Foata normal form. 82/5848 useless extension candidates. Maximal degree in co-relation 78685. Up to 5158 conditions per place. [2022-12-06 00:35:42,313 INFO L137 encePairwiseOnDemand]: 98/123 looper letters, 691 selfloop transitions, 118 changer transitions 5/814 dead transitions. [2022-12-06 00:35:42,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 814 transitions, 24526 flow [2022-12-06 00:35:42,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 00:35:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 00:35:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 187 transitions. [2022-12-06 00:35:42,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08446251129177959 [2022-12-06 00:35:42,315 INFO L175 Difference]: Start difference. First operand has 259 places, 689 transitions, 20271 flow. Second operand 18 states and 187 transitions. [2022-12-06 00:35:42,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 814 transitions, 24526 flow [2022-12-06 00:35:43,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 814 transitions, 24106 flow, removed 210 selfloop flow, removed 5 redundant places. [2022-12-06 00:35:43,432 INFO L231 Difference]: Finished difference. Result has 280 places, 711 transitions, 20874 flow [2022-12-06 00:35:43,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=19875, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=20874, PETRI_PLACES=280, PETRI_TRANSITIONS=711} [2022-12-06 00:35:43,434 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 259 predicate places. [2022-12-06 00:35:43,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:35:43,434 INFO L89 Accepts]: Start accepts. Operand has 280 places, 711 transitions, 20874 flow [2022-12-06 00:35:43,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:35:43,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:35:43,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 711 transitions, 20874 flow [2022-12-06 00:35:43,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 279 places, 711 transitions, 20874 flow [2022-12-06 00:35:44,063 INFO L130 PetriNetUnfolder]: 816/2112 cut-off events. [2022-12-06 00:35:44,063 INFO L131 PetriNetUnfolder]: For 141384/142320 co-relation queries the response was YES. [2022-12-06 00:35:44,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30662 conditions, 2112 events. 816/2112 cut-off events. For 141384/142320 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 17266 event pairs, 26 based on Foata normal form. 0/2072 useless extension candidates. Maximal degree in co-relation 30406. Up to 1162 conditions per place. [2022-12-06 00:35:44,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 279 places, 711 transitions, 20874 flow [2022-12-06 00:35:44,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 1888 [2022-12-06 00:35:44,115 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 00:35:45,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [907] $Ultimate##0-->L49-2: Formula: (let ((.cse14 (select |v_#memory_int_482| v_~f~0.base_380))) (let ((.cse7 (select .cse14 (+ v_~f~0.offset_380 (* v_~x1~0_784 4))))) (let ((.cse11 (select .cse14 (+ v_~f~0.offset_380 (* 4 .cse7))))) (let ((.cse5 (select .cse14 (+ v_~f~0.offset_380 (* 4 .cse11))))) (let ((.cse10 (select .cse14 (+ v_~f~0.offset_380 (* .cse5 4)))) (.cse12 (select .cse14 (+ v_~f~0.offset_380 (* v_~x2~0_547 4))))) (let ((.cse2 (select .cse14 (+ v_~f~0.offset_380 (* .cse12 4)))) (.cse15 (select .cse14 (+ v_~f~0.offset_380 (* .cse10 4))))) (let ((.cse13 (select .cse14 (+ v_~f~0.offset_380 (* 4 .cse15)))) (.cse4 (select .cse14 (+ v_~f~0.offset_380 (* .cse2 4))))) (let ((.cse6 (select .cse14 (+ v_~f~0.offset_380 (* .cse4 4)))) (.cse8 (select .cse14 (+ v_~f~0.offset_380 (* .cse13 4))))) (let ((.cse16 (select .cse14 (+ v_~f~0.offset_380 (* 4 .cse8)))) (.cse3 (select .cse14 (+ (* .cse6 4) v_~f~0.offset_380)))) (let ((.cse17 (select .cse14 (+ v_~f~0.offset_380 (* .cse3 4)))) (.cse9 (select .cse14 (+ v_~f~0.offset_380 (* .cse16 4))))) (let ((.cse0 (select .cse14 (+ v_~f~0.offset_380 (* .cse9 4)))) (.cse1 (select .cse14 (+ v_~f~0.offset_380 (* .cse17 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459| (ite (and (< .cse0 v_~size~0_386) (<= 0 .cse0)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_315| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_386)) 1 0)) (not (= (ite (and (< .cse2 v_~size~0_386) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_386)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_386) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_386) (<= 0 .cse5)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_386)) 1 0))) (not (= (ite (and (< .cse7 v_~size~0_386) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_386)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_784 v_~size~0_386) (<= 0 v_~x1~0_784)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_547 v_~size~0_386) (<= 0 v_~x2~0_547)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_386)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_386) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_386)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_386)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_663| 4294967293) 4294967296) (* (mod v_~n~0_366 1073741824) 4)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_463| 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_386)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_463|) (= v_~x1~0_782 (select .cse14 (+ v_~f~0.offset_380 (* .cse0 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_315| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_355|) (not (= (ite (and (< .cse15 v_~size~0_386) (<= 0 .cse15)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_580| 8) (not (= (ite (and (< .cse16 v_~size~0_386) (<= 0 .cse16)) 1 0) 0)) (= v_~x2~0_546 (select .cse14 (+ v_~f~0.offset_380 (* .cse1 4)))) (not (= (ite (and (< .cse17 v_~size~0_386) (<= 0 .cse17)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_663| 11) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_355| 0)))))))))))))) InVars {~x2~0=v_~x2~0_547, ~size~0=v_~size~0_386, ~f~0.base=v_~f~0.base_380, #memory_int=|v_#memory_int_482|, ~n~0=v_~n~0_366, ~x1~0=v_~x1~0_784, ~f~0.offset=v_~f~0.offset_380} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_453|, ~x2~0=v_~x2~0_546, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_249|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_267|, ~size~0=v_~size~0_386, ~f~0.base=v_~f~0.base_380, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_255|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_315|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_580|, ~x1~0=v_~x1~0_782, ~f~0.offset=v_~f~0.offset_380, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_355|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_249|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_247|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_663|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_463|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_261|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_261|, ~n~0=v_~n~0_366, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_463|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_263|} 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 00:35:48,728 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 00:35:48,917 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 [912] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_488| v_~f~0.base_386))) (let ((.cse3 (select .cse1 (+ (* v_~x2~0_564 4) v_~f~0.offset_386)))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_386 (* 4 .cse3))))) (let ((.cse2 (* (mod v_~n~0_372 1073741824) 4)) (.cse0 (select .cse1 (+ v_~f~0.offset_386 (* 4 .cse4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| (ite (and (< .cse0 v_~size~0_392) (<= 0 .cse0)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_476| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366| 0)) (= v_~x1~0_801 (select .cse1 (+ v_~f~0.offset_386 (* v_~x1~0_802 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_472| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_476|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_592| 4294967296) .cse2) (not (= (ite (and (< .cse3 v_~size~0_392) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_679| (+ |v_thread1Thread1of1ForFork0_~i~0#1_680| 1)) (not (= (ite (and (< v_~x2~0_564 v_~size~0_392) (<= 0 v_~x2~0_564)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_592| 4) |v_thread2Thread1of1ForFork1_~i~1#1_591|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_680| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|) (= (select .cse1 (+ v_~f~0.offset_386 (* .cse0 4))) v_~x2~0_563) (not (= (ite (and (< .cse4 v_~size~0_392) (<= 0 .cse4)) 1 0) 0)) (= (ite (and (< v_~x1~0_802 v_~size~0_392) (<= 0 v_~x1~0_802)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_472|)))))) InVars {~x2~0=v_~x2~0_564, ~size~0=v_~size~0_392, ~f~0.base=v_~f~0.base_386, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_680|, #memory_int=|v_#memory_int_488|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_592|, ~n~0=v_~n~0_372, ~x1~0=v_~x1~0_802, ~f~0.offset=v_~f~0.offset_386} OutVars{~x2~0=v_~x2~0_563, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_466|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_260|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_278|, ~size~0=v_~size~0_392, ~f~0.base=v_~f~0.base_386, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_266|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_591|, ~x1~0=v_~x1~0_801, ~f~0.offset=v_~f~0.offset_386, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|, 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_260|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_258|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_679|, #memory_int=|v_#memory_int_488|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_272|, 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_272|, ~n~0=v_~n~0_372, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_274|, 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 00:35:54,243 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 00:35:54,525 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 00:35:54,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11092 [2022-12-06 00:35:54,526 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 706 transitions, 20920 flow [2022-12-06 00:35:54,526 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 00:35:54,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:35:54,526 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:35:54,533 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 00:35:54,731 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 00:35:54,731 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 00:35:54,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:35:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1721967698, now seen corresponding path program 1 times [2022-12-06 00:35:54,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:35:54,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351850576] [2022-12-06 00:35:54,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:35:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:35:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:35:54,805 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 00:35:54,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:35:54,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351850576] [2022-12-06 00:35:54,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351850576] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:35:54,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029126708] [2022-12-06 00:35:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:35:54,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:35:54,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:35:54,806 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 00:35:54,808 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 00:35:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:35:54,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:35:54,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:35:55,015 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 00:35:55,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:35:55,060 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 00:35:55,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029126708] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:35:55,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:35:55,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 00:35:55,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502596084] [2022-12-06 00:35:55,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:35:55,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:35:55,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:35:55,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:35:55,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:35:55,062 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 131 [2022-12-06 00:35:55,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 706 transitions, 20920 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 00:35:55,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:35:55,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 131 [2022-12-06 00:35:55,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:35:57,672 INFO L130 PetriNetUnfolder]: 3643/6346 cut-off events. [2022-12-06 00:35:57,672 INFO L131 PetriNetUnfolder]: For 449613/449613 co-relation queries the response was YES. [2022-12-06 00:35:57,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91716 conditions, 6346 events. 3643/6346 cut-off events. For 449613/449613 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 43768 event pairs, 899 based on Foata normal form. 128/6471 useless extension candidates. Maximal degree in co-relation 91203. Up to 4378 conditions per place. [2022-12-06 00:35:57,736 INFO L137 encePairwiseOnDemand]: 51/131 looper letters, 542 selfloop transitions, 341 changer transitions 2/885 dead transitions. [2022-12-06 00:35:57,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 885 transitions, 28488 flow [2022-12-06 00:35:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:35:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:35:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2022-12-06 00:35:57,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14198473282442747 [2022-12-06 00:35:57,737 INFO L175 Difference]: Start difference. First operand has 274 places, 706 transitions, 20920 flow. Second operand 10 states and 186 transitions. [2022-12-06 00:35:57,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 885 transitions, 28488 flow [2022-12-06 00:35:59,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 885 transitions, 27942 flow, removed 266 selfloop flow, removed 6 redundant places. [2022-12-06 00:35:59,725 INFO L231 Difference]: Finished difference. Result has 282 places, 801 transitions, 24919 flow [2022-12-06 00:35:59,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=20440, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=24919, PETRI_PLACES=282, PETRI_TRANSITIONS=801} [2022-12-06 00:35:59,725 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 261 predicate places. [2022-12-06 00:35:59,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:35:59,726 INFO L89 Accepts]: Start accepts. Operand has 282 places, 801 transitions, 24919 flow [2022-12-06 00:35:59,729 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:35:59,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:35:59,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 282 places, 801 transitions, 24919 flow [2022-12-06 00:35:59,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 801 transitions, 24919 flow [2022-12-06 00:36:00,296 INFO L130 PetriNetUnfolder]: 929/2318 cut-off events. [2022-12-06 00:36:00,296 INFO L131 PetriNetUnfolder]: For 154792/155757 co-relation queries the response was YES. [2022-12-06 00:36:00,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35343 conditions, 2318 events. 929/2318 cut-off events. For 154792/155757 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18927 event pairs, 29 based on Foata normal form. 0/2276 useless extension candidates. Maximal degree in co-relation 34476. Up to 1362 conditions per place. [2022-12-06 00:36:00,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 801 transitions, 24919 flow [2022-12-06 00:36:00,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 2108 [2022-12-06 00:36:00,337 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:36:00,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 613 [2022-12-06 00:36:00,338 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 801 transitions, 24919 flow [2022-12-06 00:36:00,338 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 00:36:00,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:36:00,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:36:00,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-06 00:36:00,543 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 00:36:00,543 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 00:36:00,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:36:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2114001731, now seen corresponding path program 1 times [2022-12-06 00:36:00,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:36:00,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680304628] [2022-12-06 00:36:00,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:36:00,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:36:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:36:00,617 INFO 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 00:36:00,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:36:00,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680304628] [2022-12-06 00:36:00,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680304628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:36:00,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933462177] [2022-12-06 00:36:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:36:00,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:36:00,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:36:00,619 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 00:36:00,619 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 00:36:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:36:00,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:36:00,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:36:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:36:00,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:36:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:36:00,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933462177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:36:00,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:36:00,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 00:36:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480529825] [2022-12-06 00:36:00,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:36:00,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:36:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:36:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:36:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:36:00,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 130 [2022-12-06 00:36:00,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 801 transitions, 24919 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 00:36:00,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:36:00,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 130 [2022-12-06 00:36:00,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:36:03,669 INFO L130 PetriNetUnfolder]: 3848/6698 cut-off events. [2022-12-06 00:36:03,669 INFO L131 PetriNetUnfolder]: For 462075/462075 co-relation queries the response was YES. [2022-12-06 00:36:03,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97451 conditions, 6698 events. 3848/6698 cut-off events. For 462075/462075 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 46752 event pairs, 1037 based on Foata normal form. 38/6733 useless extension candidates. Maximal degree in co-relation 95180. Up to 5075 conditions per place. [2022-12-06 00:36:03,738 INFO L137 encePairwiseOnDemand]: 56/130 looper letters, 668 selfloop transitions, 261 changer transitions 12/941 dead transitions. [2022-12-06 00:36:03,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 941 transitions, 30971 flow [2022-12-06 00:36:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:36:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:36:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2022-12-06 00:36:03,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1476923076923077 [2022-12-06 00:36:03,739 INFO L175 Difference]: Start difference. First operand has 280 places, 801 transitions, 24919 flow. Second operand 10 states and 192 transitions. [2022-12-06 00:36:03,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 941 transitions, 30971 flow [2022-12-06 00:36:05,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 941 transitions, 30733 flow, removed 118 selfloop flow, removed 2 redundant places. [2022-12-06 00:36:05,420 INFO L231 Difference]: Finished difference. Result has 290 places, 838 transitions, 26953 flow [2022-12-06 00:36:05,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=24689, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=26953, PETRI_PLACES=290, PETRI_TRANSITIONS=838} [2022-12-06 00:36:05,429 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 269 predicate places. [2022-12-06 00:36:05,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:36:05,430 INFO L89 Accepts]: Start accepts. Operand has 290 places, 838 transitions, 26953 flow [2022-12-06 00:36:05,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:36:05,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:36:05,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 838 transitions, 26953 flow [2022-12-06 00:36:05,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 838 transitions, 26953 flow [2022-12-06 00:36:06,100 INFO L130 PetriNetUnfolder]: 997/2471 cut-off events. [2022-12-06 00:36:06,100 INFO L131 PetriNetUnfolder]: For 168970/169949 co-relation queries the response was YES. [2022-12-06 00:36:06,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38474 conditions, 2471 events. 997/2471 cut-off events. For 168970/169949 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20260 event pairs, 30 based on Foata normal form. 0/2430 useless extension candidates. Maximal degree in co-relation 37921. Up to 1475 conditions per place. [2022-12-06 00:36:06,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 290 places, 838 transitions, 26953 flow [2022-12-06 00:36:06,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 2198 [2022-12-06 00:36:06,150 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:36:06,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 722 [2022-12-06 00:36:06,151 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 838 transitions, 26953 flow [2022-12-06 00:36:06,151 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 00:36:06,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:36:06,151 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:36:06,160 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 00:36:06,356 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 00:36:06,356 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 00:36:06,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:36:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash 813038034, now seen corresponding path program 1 times [2022-12-06 00:36:06,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:36:06,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512263070] [2022-12-06 00:36:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:36:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:36:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:36:06,423 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 00:36:06,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:36:06,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512263070] [2022-12-06 00:36:06,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512263070] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:36:06,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124193163] [2022-12-06 00:36:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:36:06,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:36:06,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:36:06,425 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 00:36:06,426 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 00:36:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:36:06,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:36:06,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:36:06,590 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 00:36:06,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:36:06,628 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 00:36:06,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124193163] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:36:06,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:36:06,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 00:36:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306239522] [2022-12-06 00:36:06,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:36:06,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:36:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:36:06,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:36:06,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:36:06,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 130 [2022-12-06 00:36:06,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 838 transitions, 26953 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 00:36:06,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:36:06,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 130 [2022-12-06 00:36:06,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:36:10,001 INFO L130 PetriNetUnfolder]: 3864/6770 cut-off events. [2022-12-06 00:36:10,001 INFO L131 PetriNetUnfolder]: For 472271/472271 co-relation queries the response was YES. [2022-12-06 00:36:10,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99781 conditions, 6770 events. 3864/6770 cut-off events. For 472271/472271 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 47639 event pairs, 1199 based on Foata normal form. 20/6787 useless extension candidates. Maximal degree in co-relation 98587. Up to 5020 conditions per place. [2022-12-06 00:36:10,071 INFO L137 encePairwiseOnDemand]: 92/130 looper letters, 742 selfloop transitions, 146 changer transitions 26/914 dead transitions. [2022-12-06 00:36:10,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 914 transitions, 30598 flow [2022-12-06 00:36:10,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:36:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:36:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 174 transitions. [2022-12-06 00:36:10,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10295857988165681 [2022-12-06 00:36:10,077 INFO L175 Difference]: Start difference. First operand has 290 places, 838 transitions, 26953 flow. Second operand 13 states and 174 transitions. [2022-12-06 00:36:10,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 914 transitions, 30598 flow [2022-12-06 00:36:11,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 914 transitions, 30539 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-06 00:36:11,658 INFO L231 Difference]: Finished difference. Result has 310 places, 857 transitions, 28081 flow [2022-12-06 00:36:11,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=26910, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=28081, PETRI_PLACES=310, PETRI_TRANSITIONS=857} [2022-12-06 00:36:11,659 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 289 predicate places. [2022-12-06 00:36:11,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:36:11,659 INFO L89 Accepts]: Start accepts. Operand has 310 places, 857 transitions, 28081 flow [2022-12-06 00:36:11,664 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:36:11,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:36:11,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 310 places, 857 transitions, 28081 flow [2022-12-06 00:36:11,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 306 places, 857 transitions, 28081 flow [2022-12-06 00:36:12,344 INFO L130 PetriNetUnfolder]: 980/2467 cut-off events. [2022-12-06 00:36:12,344 INFO L131 PetriNetUnfolder]: For 184676/185718 co-relation queries the response was YES. [2022-12-06 00:36:12,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39418 conditions, 2467 events. 980/2467 cut-off events. For 184676/185718 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 20515 event pairs, 35 based on Foata normal form. 0/2425 useless extension candidates. Maximal degree in co-relation 39288. Up to 1458 conditions per place. [2022-12-06 00:36:12,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 306 places, 857 transitions, 28081 flow [2022-12-06 00:36:12,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 2248 [2022-12-06 00:36:12,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [929] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_508| v_~f~0.base_406))) (let ((.cse11 (select .cse5 (+ v_~f~0.offset_406 (* v_~x2~0_613 4))))) (let ((.cse12 (select .cse5 (+ v_~f~0.offset_406 (* .cse11 4)))) (.cse4 (select .cse5 (+ v_~f~0.offset_406 (* v_~x1~0_835 4))))) (let ((.cse10 (select .cse5 (+ v_~f~0.offset_406 (* .cse4 4)))) (.cse1 (select .cse5 (+ v_~f~0.offset_406 (* .cse12 4))))) (let ((.cse9 (select .cse5 (+ v_~f~0.offset_406 (* .cse1 4)))) (.cse0 (select .cse5 (+ v_~f~0.offset_406 (* .cse10 4))))) (let ((.cse13 (select .cse5 (+ v_~f~0.offset_406 (* .cse0 4)))) (.cse8 (select .cse5 (+ v_~f~0.offset_406 (* .cse9 4))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_406 (* .cse8 4)))) (.cse3 (select .cse5 (+ v_~f~0.offset_406 (* 4 .cse13))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_406 (* .cse3 4)))) (.cse7 (select .cse5 (+ v_~f~0.offset_406 (* .cse2 4))))) (and (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_713|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_396| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_497|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_497| 0)) (not (= (ite (and (< .cse0 v_~size~0_412) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_412)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_412)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_412) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_632| 8) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_412)) 1 0) 0)) (= v_~x1~0_834 (select .cse5 (+ v_~f~0.offset_406 (* 4 .cse6)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_356| (ite (and (< .cse7 v_~size~0_412) (<= 0 .cse7)) 1 0)) (not (= (ite (and (< .cse8 v_~size~0_412) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_356| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_396|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_412)) 1 0) 0)) (< 4 (* (mod v_~n~0_392 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493| (ite (and (< .cse6 v_~size~0_412) (<= 0 .cse6)) 1 0)) (not (= (ite (and (< v_~x2~0_613 v_~size~0_412) (<= 0 v_~x2~0_613)) 1 0) 0)) (not (= 0 (ite (and (< .cse10 v_~size~0_412) (<= 0 .cse10)) 1 0))) (not (= (ite (and (< .cse11 v_~size~0_412) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_835) (< v_~x1~0_835 v_~size~0_412)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_412) (<= 0 .cse12)) 1 0) 0)) (= v_~x2~0_611 (select .cse5 (+ v_~f~0.offset_406 (* .cse7 4)))) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_412)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_613, ~size~0=v_~size~0_412, ~f~0.base=v_~f~0.base_406, #memory_int=|v_#memory_int_508|, ~n~0=v_~n~0_392, ~x1~0=v_~x1~0_835, ~f~0.offset=v_~f~0.offset_406} OutVars{~x2~0=v_~x2~0_611, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_487|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_290|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_308|, ~size~0=v_~size~0_412, ~f~0.base=v_~f~0.base_406, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_296|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_356|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_632|, ~x1~0=v_~x1~0_834, ~f~0.offset=v_~f~0.offset_406, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_396|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_290|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_288|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_713|, #memory_int=|v_#memory_int_508|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_302|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_497|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_302|, ~n~0=v_~n~0_392, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_304|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_497|} 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 00:36:13,461 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 00:36:15,883 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:36:15,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4225 [2022-12-06 00:36:15,884 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 856 transitions, 28078 flow [2022-12-06 00:36:15,884 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 00:36:15,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:36:15,884 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:36:15,889 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 00:36:16,089 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 00:36:16,089 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 00:36:16,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:36:16,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1546434605, now seen corresponding path program 1 times [2022-12-06 00:36:16,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:36:16,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327653272] [2022-12-06 00:36:16,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:36:16,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:36:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:36:16,171 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 00:36:16,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:36:16,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327653272] [2022-12-06 00:36:16,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327653272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:36:16,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45910574] [2022-12-06 00:36:16,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:36:16,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:36:16,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:36:16,174 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 00:36:16,174 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 00:36:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:36:16,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:36:16,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:36:16,344 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 00:36:16,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:36:16,383 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 00:36:16,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45910574] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:36:16,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:36:16,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 00:36:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491330724] [2022-12-06 00:36:16,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:36:16,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:36:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:36:16,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:36:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:36:16,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 130 [2022-12-06 00:36:16,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 856 transitions, 28078 flow. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 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 00:36:16,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:36:16,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 130 [2022-12-06 00:36:16,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:36:20,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 00:36:23,370 INFO L130 PetriNetUnfolder]: 3891/6823 cut-off events. [2022-12-06 00:36:23,370 INFO L131 PetriNetUnfolder]: For 529265/529265 co-relation queries the response was YES. [2022-12-06 00:36:23,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103386 conditions, 6823 events. 3891/6823 cut-off events. For 529265/529265 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 48190 event pairs, 1480 based on Foata normal form. 52/6872 useless extension candidates. Maximal degree in co-relation 103234. Up to 6222 conditions per place. [2022-12-06 00:36:23,464 INFO L137 encePairwiseOnDemand]: 94/130 looper letters, 781 selfloop transitions, 138 changer transitions 10/929 dead transitions. [2022-12-06 00:36:23,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 929 transitions, 31567 flow [2022-12-06 00:36:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:36:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:36:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2022-12-06 00:36:23,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1258741258741259 [2022-12-06 00:36:23,469 INFO L175 Difference]: Start difference. First operand has 305 places, 856 transitions, 28078 flow. Second operand 11 states and 180 transitions. [2022-12-06 00:36:23,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 929 transitions, 31567 flow [2022-12-06 00:36:25,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 929 transitions, 31067 flow, removed 240 selfloop flow, removed 7 redundant places. [2022-12-06 00:36:25,721 INFO L231 Difference]: Finished difference. Result has 314 places, 866 transitions, 28380 flow [2022-12-06 00:36:25,721 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=27600, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=28380, PETRI_PLACES=314, PETRI_TRANSITIONS=866} [2022-12-06 00:36:25,721 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 293 predicate places. [2022-12-06 00:36:25,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:36:25,722 INFO L89 Accepts]: Start accepts. Operand has 314 places, 866 transitions, 28380 flow [2022-12-06 00:36:25,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:36:25,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:36:25,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 314 places, 866 transitions, 28380 flow [2022-12-06 00:36:25,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 314 places, 866 transitions, 28380 flow [2022-12-06 00:36:26,456 INFO L130 PetriNetUnfolder]: 987/2495 cut-off events. [2022-12-06 00:36:26,456 INFO L131 PetriNetUnfolder]: For 178500/179508 co-relation queries the response was YES. [2022-12-06 00:36:26,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39463 conditions, 2495 events. 987/2495 cut-off events. For 178500/179508 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 20954 event pairs, 34 based on Foata normal form. 0/2448 useless extension candidates. Maximal degree in co-relation 38873. Up to 1467 conditions per place. [2022-12-06 00:36:26,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 314 places, 866 transitions, 28380 flow [2022-12-06 00:36:26,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 2274 [2022-12-06 00:36:26,506 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 00:36:26,622 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 00:36:26,825 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 [941] L59-2-->L49-2: Formula: (let ((.cse0 (* (mod v_~n~0_408 1073741824) 4))) (and (= |v_thread2Thread1of1ForFork1_#res#1.base_163| 0) (= (ite (and (<= 0 v_~x1~0_879) (< v_~x1~0_879 v_~size~0_428)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_525|) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_665| 4294967296) .cse0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_529| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_762| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_525| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_529|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_163| 0) (= v_~x1~0_878 (select (select |v_#memory_int_524| v_~f~0.base_422) (+ v_~f~0.offset_422 (* v_~x1~0_879 4)))) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_762| 1) |v_thread1Thread1of1ForFork0_~i~0#1_761|))) InVars {~size~0=v_~size~0_428, ~f~0.base=v_~f~0.base_422, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_762|, #memory_int=|v_#memory_int_524|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_665|, ~n~0=v_~n~0_408, ~x1~0=v_~x1~0_879, ~f~0.offset=v_~f~0.offset_422} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_519|, ~size~0=v_~size~0_428, ~f~0.base=v_~f~0.base_422, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_163|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_665|, ~x1~0=v_~x1~0_878, ~f~0.offset=v_~f~0.offset_422, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_525|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_163|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_761|, #memory_int=|v_#memory_int_524|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_529|, ~n~0=v_~n~0_408, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_529|} 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 00:36:26,974 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 00:36:27,284 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 00:36:27,441 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 00:36:27,619 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:36:27,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1898 [2022-12-06 00:36:27,620 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 864 transitions, 28451 flow [2022-12-06 00:36:27,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 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 00:36:27,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:36:27,620 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:36:27,625 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 00:36:27,825 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,SelfDestructingSolverStorable42 [2022-12-06 00:36:27,825 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 00:36:27,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:36:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1925932345, now seen corresponding path program 1 times [2022-12-06 00:36:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:36:27,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037083441] [2022-12-06 00:36:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:36:27,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:36:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:36:27,911 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 00:36:27,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:36:27,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037083441] [2022-12-06 00:36:27,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037083441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:36:27,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:36:27,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:36:27,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098999562] [2022-12-06 00:36:27,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:36:27,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:36:27,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:36:27,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:36:27,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:36:27,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 136 [2022-12-06 00:36:27,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 864 transitions, 28451 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 00:36:27,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:36:27,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 136 [2022-12-06 00:36:27,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:36:30,474 INFO L130 PetriNetUnfolder]: 3868/6742 cut-off events. [2022-12-06 00:36:30,474 INFO L131 PetriNetUnfolder]: For 483339/483339 co-relation queries the response was YES. [2022-12-06 00:36:30,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101458 conditions, 6742 events. 3868/6742 cut-off events. For 483339/483339 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 47032 event pairs, 1565 based on Foata normal form. 4/6743 useless extension candidates. Maximal degree in co-relation 99753. Up to 6583 conditions per place. [2022-12-06 00:36:30,552 INFO L137 encePairwiseOnDemand]: 116/136 looper letters, 814 selfloop transitions, 55 changer transitions 1/870 dead transitions. [2022-12-06 00:36:30,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 870 transitions, 30293 flow [2022-12-06 00:36:30,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:36:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:36:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2022-12-06 00:36:30,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3480392156862745 [2022-12-06 00:36:30,553 INFO L175 Difference]: Start difference. First operand has 312 places, 864 transitions, 28451 flow. Second operand 3 states and 142 transitions. [2022-12-06 00:36:30,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 870 transitions, 30293 flow [2022-12-06 00:36:32,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 870 transitions, 29820 flow, removed 201 selfloop flow, removed 6 redundant places. [2022-12-06 00:36:32,683 INFO L231 Difference]: Finished difference. Result has 307 places, 860 transitions, 27962 flow [2022-12-06 00:36:32,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=27878, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=806, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=27962, PETRI_PLACES=307, PETRI_TRANSITIONS=860} [2022-12-06 00:36:32,684 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 286 predicate places. [2022-12-06 00:36:32,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:36:32,684 INFO L89 Accepts]: Start accepts. Operand has 307 places, 860 transitions, 27962 flow [2022-12-06 00:36:32,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:36:32,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:36:32,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 860 transitions, 27962 flow [2022-12-06 00:36:32,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 306 places, 860 transitions, 27962 flow [2022-12-06 00:36:33,321 INFO L130 PetriNetUnfolder]: 984/2457 cut-off events. [2022-12-06 00:36:33,321 INFO L131 PetriNetUnfolder]: For 169952/170927 co-relation queries the response was YES. [2022-12-06 00:36:33,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38614 conditions, 2457 events. 984/2457 cut-off events. For 169952/170927 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 20331 event pairs, 37 based on Foata normal form. 0/2413 useless extension candidates. Maximal degree in co-relation 38173. Up to 1451 conditions per place. [2022-12-06 00:36:33,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 306 places, 860 transitions, 27962 flow [2022-12-06 00:36:33,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 2254 [2022-12-06 00:36:33,367 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:36:33,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 683 [2022-12-06 00:36:33,368 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 860 transitions, 27962 flow [2022-12-06 00:36:33,368 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 00:36:33,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:36:33,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:36:33,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 00:36:33,368 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 00:36:33,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:36:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1979895109, now seen corresponding path program 1 times [2022-12-06 00:36:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:36:33,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450255863] [2022-12-06 00:36:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:36:33,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:36:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:36:33,501 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 00:36:33,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:36:33,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450255863] [2022-12-06 00:36:33,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450255863] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:36:33,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061528671] [2022-12-06 00:36:33,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:36:33,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:36:33,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:36:33,502 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 00:36:33,503 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 00:36:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:36:33,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:36:33,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:36:33,737 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 00:36:33,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:36:33,828 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 00:36:33,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061528671] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:36:33,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:36:33,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-12-06 00:36:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073828918] [2022-12-06 00:36:33,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:36:33,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:36:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:36:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:36:33,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:36:33,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 135 [2022-12-06 00:36:33,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 860 transitions, 27962 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 00:36:33,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:36:33,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 135 [2022-12-06 00:36:33,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:36:38,147 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 00:36:40,206 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 00:36:43,976 INFO L130 PetriNetUnfolder]: 4522/7948 cut-off events. [2022-12-06 00:36:43,977 INFO L131 PetriNetUnfolder]: For 547340/547340 co-relation queries the response was YES. [2022-12-06 00:36:44,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117665 conditions, 7948 events. 4522/7948 cut-off events. For 547340/547340 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 57062 event pairs, 1010 based on Foata normal form. 78/8023 useless extension candidates. Maximal degree in co-relation 116389. Up to 4828 conditions per place. [2022-12-06 00:36:44,061 INFO L137 encePairwiseOnDemand]: 33/135 looper letters, 498 selfloop transitions, 604 changer transitions 0/1102 dead transitions. [2022-12-06 00:36:44,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 1102 transitions, 37046 flow [2022-12-06 00:36:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:36:44,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:36:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 205 transitions. [2022-12-06 00:36:44,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12654320987654322 [2022-12-06 00:36:44,062 INFO L175 Difference]: Start difference. First operand has 306 places, 860 transitions, 27962 flow. Second operand 12 states and 205 transitions. [2022-12-06 00:36:44,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 1102 transitions, 37046 flow [2022-12-06 00:36:46,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 1102 transitions, 36902 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-06 00:36:46,134 INFO L231 Difference]: Finished difference. Result has 322 places, 1049 transitions, 35908 flow [2022-12-06 00:36:46,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=27836, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=444, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=35908, PETRI_PLACES=322, PETRI_TRANSITIONS=1049} [2022-12-06 00:36:46,135 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 301 predicate places. [2022-12-06 00:36:46,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:36:46,135 INFO L89 Accepts]: Start accepts. Operand has 322 places, 1049 transitions, 35908 flow [2022-12-06 00:36:46,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:36:46,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:36:46,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 322 places, 1049 transitions, 35908 flow [2022-12-06 00:36:46,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 1049 transitions, 35908 flow [2022-12-06 00:36:46,996 INFO L130 PetriNetUnfolder]: 1136/2888 cut-off events. [2022-12-06 00:36:46,996 INFO L131 PetriNetUnfolder]: For 232960/234170 co-relation queries the response was YES. [2022-12-06 00:36:47,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48869 conditions, 2888 events. 1136/2888 cut-off events. For 232960/234170 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 24685 event pairs, 49 based on Foata normal form. 0/2835 useless extension candidates. Maximal degree in co-relation 48414. Up to 1720 conditions per place. [2022-12-06 00:36:47,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 322 places, 1049 transitions, 35908 flow [2022-12-06 00:36:47,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 2722 [2022-12-06 00:36:53,096 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:36:53,096 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6961 [2022-12-06 00:36:53,096 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 1049 transitions, 36004 flow [2022-12-06 00:36:53,097 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 00:36:53,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:36:53,103 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:36:53,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-06 00:36:53,311 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 00:36:53,311 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 00:36:53,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:36:53,311 INFO L85 PathProgramCache]: Analyzing trace with hash 208464127, now seen corresponding path program 1 times [2022-12-06 00:36:53,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:36:53,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034614161] [2022-12-06 00:36:53,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:36:53,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:36:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:36:53,504 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 00:36:53,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:36:53,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034614161] [2022-12-06 00:36:53,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034614161] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:36:53,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413870789] [2022-12-06 00:36:53,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:36:53,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:36:53,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:36:53,506 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 00:36:53,510 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 00:36:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:36:53,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:36:53,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:36:53,745 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 00:36:53,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:36:53,820 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 00:36:53,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413870789] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:36:53,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:36:53,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-12-06 00:36:53,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432403053] [2022-12-06 00:36:53,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:36:53,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:36:53,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:36:53,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:36:53,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:36:53,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 136 [2022-12-06 00:36:53,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 1049 transitions, 36004 flow. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:36:53,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:36:53,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 136 [2022-12-06 00:36:53,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:36:56,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 00:36:58,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 00:36:59,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 00:37:05,203 INFO L130 PetriNetUnfolder]: 4959/8751 cut-off events. [2022-12-06 00:37:05,203 INFO L131 PetriNetUnfolder]: For 697690/697690 co-relation queries the response was YES. [2022-12-06 00:37:05,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138927 conditions, 8751 events. 4959/8751 cut-off events. For 697690/697690 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 64551 event pairs, 1208 based on Foata normal form. 40/8788 useless extension candidates. Maximal degree in co-relation 137642. Up to 5854 conditions per place. [2022-12-06 00:37:05,301 INFO L137 encePairwiseOnDemand]: 29/136 looper letters, 641 selfloop transitions, 735 changer transitions 0/1376 dead transitions. [2022-12-06 00:37:05,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 1376 transitions, 49506 flow [2022-12-06 00:37:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 00:37:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 00:37:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 249 transitions. [2022-12-06 00:37:05,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.06538865546218488 [2022-12-06 00:37:05,303 INFO L175 Difference]: Start difference. First operand has 322 places, 1049 transitions, 36004 flow. Second operand 28 states and 249 transitions. [2022-12-06 00:37:05,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 1376 transitions, 49506 flow [2022-12-06 00:37:08,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 1376 transitions, 48165 flow, removed 667 selfloop flow, removed 2 redundant places. [2022-12-06 00:37:08,750 INFO L231 Difference]: Finished difference. Result has 358 places, 1276 transitions, 45094 flow [2022-12-06 00:37:08,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=35157, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=539, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=45094, PETRI_PLACES=358, PETRI_TRANSITIONS=1276} [2022-12-06 00:37:08,751 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 337 predicate places. [2022-12-06 00:37:08,751 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:37:08,751 INFO L89 Accepts]: Start accepts. Operand has 358 places, 1276 transitions, 45094 flow [2022-12-06 00:37:08,759 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:37:08,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:37:08,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 358 places, 1276 transitions, 45094 flow [2022-12-06 00:37:08,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 358 places, 1276 transitions, 45094 flow [2022-12-06 00:37:10,000 INFO L130 PetriNetUnfolder]: 1338/3331 cut-off events. [2022-12-06 00:37:10,000 INFO L131 PetriNetUnfolder]: For 329703/330400 co-relation queries the response was YES. [2022-12-06 00:37:10,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61095 conditions, 3331 events. 1338/3331 cut-off events. For 329703/330400 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 29017 event pairs, 41 based on Foata normal form. 0/3305 useless extension candidates. Maximal degree in co-relation 60626. Up to 1967 conditions per place. [2022-12-06 00:37:10,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 358 places, 1276 transitions, 45094 flow [2022-12-06 00:37:10,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 3032 [2022-12-06 00:37:10,099 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [794] $Ultimate##0-->L49-2: Formula: (let ((.cse12 (select |v_#memory_int_292| v_~f~0.base_202))) (let ((.cse8 (select .cse12 (+ v_~f~0.offset_202 (* v_~x1~0_383 4))))) (let ((.cse5 (select .cse12 (+ v_~f~0.offset_202 (* .cse8 4))))) (let ((.cse10 (select .cse12 (+ v_~f~0.offset_202 (* 4 .cse5))))) (let ((.cse2 (select .cse12 (+ v_~f~0.offset_202 (* .cse10 4))))) (let ((.cse1 (select .cse12 (+ v_~f~0.offset_202 (* .cse2 4))))) (let ((.cse0 (select .cse12 (+ v_~f~0.offset_202 (* .cse1 4))))) (let ((.cse7 (select .cse12 (+ v_~f~0.offset_202 (* 4 .cse0))))) (let ((.cse9 (select .cse12 (+ v_~f~0.offset_202 (* .cse7 4))))) (let ((.cse4 (select .cse12 (+ v_~f~0.offset_202 (* .cse9 4))))) (let ((.cse11 (select .cse12 (+ v_~f~0.offset_202 (* .cse4 4))))) (let ((.cse3 (select .cse12 (+ v_~f~0.offset_202 (* .cse11 4))))) (let ((.cse6 (select .cse12 (+ v_~f~0.offset_202 (* .cse3 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_291| 13) (not (= (ite (and (< .cse0 v_~size~0_208) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_208) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_331| 0) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_208)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230| 0)) (not (= (ite (and (< .cse3 v_~size~0_208) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_208)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_208)) 1 0) 0)) (= (ite (and (< .cse6 v_~size~0_208) (<= 0 .cse6)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_226|) (not (= (ite (and (< .cse7 v_~size~0_208) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_208) (<= 0 .cse8)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_291| 4294967295) 4294967296) (* (mod v_~n~0_188 1073741824) 4)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_208)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_383 v_~size~0_208) (<= 0 v_~x1~0_383)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_226| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230|) (not (= (ite (and (< .cse10 v_~size~0_208) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_208) (<= 0 .cse11)) 1 0) 0)) (= v_~x1~0_381 (select .cse12 (+ v_~f~0.offset_202 (* .cse6 4)))))))))))))))))) InVars {~size~0=v_~size~0_208, ~f~0.base=v_~f~0.base_202, #memory_int=|v_#memory_int_292|, ~n~0=v_~n~0_188, ~x1~0=v_~x1~0_383, ~f~0.offset=v_~f~0.offset_202} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_220|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_226|, ~size~0=v_~size~0_208, ~f~0.base=v_~f~0.base_202, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_291|, #memory_int=|v_#memory_int_292|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_331|, ~n~0=v_~n~0_188, ~x1~0=v_~x1~0_381, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_230|, ~f~0.offset=v_~f~0.offset_202} AuxVars[] 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 00:37:11,558 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 00:37:17,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_273| v_~f~0.base_186))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_186 (* v_~x2~0_327 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_186 (* .cse5 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_186 (* .cse0 4)))) (.cse4 (select .cse2 (+ v_~f~0.offset_186 (* v_~x1~0_336 4)))) (.cse3 (* (mod v_~n~0_172 1073741824) 4))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_222| 0)) (not (= (ite (and (< .cse0 v_~size~0_192) (<= 0 .cse0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_182| (ite (and (< .cse1 v_~size~0_192) (<= 0 .cse1)) 1 0)) (= (select .cse2 (+ v_~f~0.offset_186 (* .cse1 4))) v_~x2~0_326) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_261| 4294967296) .cse3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_198| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_298| 4) |v_thread2Thread1of1ForFork1_~i~1#1_297|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_182| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_222|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_198| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_192)) 1 0)) (= (select .cse2 (+ v_~f~0.offset_186 (* .cse4 4))) v_~x1~0_335) (= |v_thread1Thread1of1ForFork0_~i~0#1_260| (+ |v_thread1Thread1of1ForFork0_~i~0#1_261| 2)) (not (= (ite (and (< .cse5 v_~size~0_192) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_336 v_~size~0_192) (<= 0 v_~x1~0_336)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_327) (< v_~x2~0_327 v_~size~0_192)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_260| 4294967295) 4294967296) .cse3) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_298| 4294967296) .cse3) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202| 0))))))) InVars {~x2~0=v_~x2~0_327, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_186, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_261|, #memory_int=|v_#memory_int_273|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_298|, ~n~0=v_~n~0_172, ~x1~0=v_~x1~0_336, ~f~0.offset=v_~f~0.offset_186} OutVars{~x2~0=v_~x2~0_326, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_192|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_116|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_134|, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_186, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_122|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_182|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_297|, ~x1~0=v_~x1~0_335, ~f~0.offset=v_~f~0.offset_186, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_222|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_198|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_116|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_114|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_260|, #memory_int=|v_#memory_int_273|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_128|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_128|, ~n~0=v_~n~0_172, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_130|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_202|} 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 [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] [2022-12-06 00:37:18,218 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 00:37:18,312 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 00:37:18,410 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 00:37:18,507 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 00:37:18,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9756 [2022-12-06 00:37:18,507 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 1272 transitions, 45125 flow [2022-12-06 00:37:18,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:37:18,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:37:18,507 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:37:18,515 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 00:37:18,713 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 00:37:18,713 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 00:37:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:37:18,713 INFO L85 PathProgramCache]: Analyzing trace with hash -463919353, now seen corresponding path program 1 times [2022-12-06 00:37:18,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:37:18,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97121175] [2022-12-06 00:37:18,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:37:18,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:37:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:37:18,804 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 00:37:18,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:37:18,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97121175] [2022-12-06 00:37:18,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97121175] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:37:18,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191428171] [2022-12-06 00:37:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:37:18,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:37:18,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:37:18,806 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 00:37:18,806 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 00:37:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:37:18,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 87 conjunts are in the unsatisfiable core [2022-12-06 00:37:18,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:37:18,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:37:18,978 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 00:37:18,980 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 00:37:19,007 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 00:37:20,410 INFO L321 Elim1Store]: treesize reduction 897, result has 6.7 percent of original size [2022-12-06 00:37:20,410 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 00:37:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 00:37:20,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:37:30,413 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 00:37:30,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191428171] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:37:30,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:37:30,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 17 [2022-12-06 00:37:30,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165970123] [2022-12-06 00:37:30,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:37:30,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 00:37:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:37:30,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 00:37:30,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=214, Unknown=3, NotChecked=0, Total=272 [2022-12-06 00:37:30,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 145 [2022-12-06 00:37:30,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 1272 transitions, 45125 flow. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:37:30,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:37:30,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 145 [2022-12-06 00:37:30,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:38:22,800 INFO L130 PetriNetUnfolder]: 5332/9430 cut-off events. [2022-12-06 00:38:22,800 INFO L131 PetriNetUnfolder]: For 882184/882184 co-relation queries the response was YES. [2022-12-06 00:38:22,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157403 conditions, 9430 events. 5332/9430 cut-off events. For 882184/882184 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 70780 event pairs, 312 based on Foata normal form. 14/9441 useless extension candidates. Maximal degree in co-relation 156042. Up to 4581 conditions per place. [2022-12-06 00:38:22,914 INFO L137 encePairwiseOnDemand]: 37/145 looper letters, 482 selfloop transitions, 968 changer transitions 43/1493 dead transitions. [2022-12-06 00:38:22,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 1493 transitions, 53985 flow [2022-12-06 00:38:22,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:38:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:38:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 245 transitions. [2022-12-06 00:38:22,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09939148073022312 [2022-12-06 00:38:22,917 INFO L175 Difference]: Start difference. First operand has 354 places, 1272 transitions, 45125 flow. Second operand 17 states and 245 transitions. [2022-12-06 00:38:22,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 1493 transitions, 53985 flow [2022-12-06 00:38:27,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 1493 transitions, 52627 flow, removed 625 selfloop flow, removed 7 redundant places. [2022-12-06 00:38:27,409 INFO L231 Difference]: Finished difference. Result has 373 places, 1369 transitions, 49855 flow [2022-12-06 00:38:27,410 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=43866, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=881, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=49855, PETRI_PLACES=373, PETRI_TRANSITIONS=1369} [2022-12-06 00:38:27,410 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 352 predicate places. [2022-12-06 00:38:27,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:38:27,410 INFO L89 Accepts]: Start accepts. Operand has 373 places, 1369 transitions, 49855 flow [2022-12-06 00:38:27,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:38:27,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:38:27,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 373 places, 1369 transitions, 49855 flow [2022-12-06 00:38:27,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 372 places, 1369 transitions, 49855 flow [2022-12-06 00:38:28,797 INFO L130 PetriNetUnfolder]: 1386/3532 cut-off events. [2022-12-06 00:38:28,797 INFO L131 PetriNetUnfolder]: For 356678/357459 co-relation queries the response was YES. [2022-12-06 00:38:28,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65252 conditions, 3532 events. 1386/3532 cut-off events. For 356678/357459 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 31782 event pairs, 57 based on Foata normal form. 0/3500 useless extension candidates. Maximal degree in co-relation 64759. Up to 2000 conditions per place. [2022-12-06 00:38:28,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 1369 transitions, 49855 flow [2022-12-06 00:38:28,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 3300 [2022-12-06 00:38:28,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [953] $Ultimate##0-->L49-2: Formula: (let ((.cse13 (select |v_#memory_int_540| v_~f~0.base_438))) (let ((.cse10 (select .cse13 (+ v_~f~0.offset_438 (* v_~x1~0_912 4))))) (let ((.cse15 (select .cse13 (+ v_~f~0.offset_438 (* .cse10 4))))) (let ((.cse0 (select .cse13 (+ v_~f~0.offset_438 (* .cse15 4))))) (let ((.cse3 (select .cse13 (+ v_~f~0.offset_438 (* 4 .cse0))))) (let ((.cse9 (select .cse13 (+ v_~f~0.offset_438 (* .cse3 4))))) (let ((.cse7 (select .cse13 (+ v_~f~0.offset_438 (* 4 .cse9))))) (let ((.cse8 (select .cse13 (+ v_~f~0.offset_438 (* .cse7 4))))) (let ((.cse14 (select .cse13 (+ v_~f~0.offset_438 (* .cse8 4))))) (let ((.cse16 (select .cse13 (+ v_~f~0.offset_438 (* .cse14 4))))) (let ((.cse11 (select .cse13 (+ (* .cse16 4) v_~f~0.offset_438)))) (let ((.cse12 (select .cse13 (+ v_~f~0.offset_438 (* .cse11 4))))) (let ((.cse4 (select .cse13 (+ v_~f~0.offset_438 (* .cse12 4))))) (let ((.cse6 (select .cse13 (+ v_~f~0.offset_438 (* .cse4 4))))) (let ((.cse2 (select .cse13 (+ v_~f~0.offset_438 (* .cse6 4))))) (let ((.cse1 (select .cse13 (+ v_~f~0.offset_438 (* .cse2 4))))) (let ((.cse5 (select .cse13 (+ v_~f~0.offset_438 (* 4 .cse1))))) (and (not (= (ite (and (< .cse0 v_~size~0_444) (<= 0 .cse0)) 1 0) 0)) (not (= 0 (ite (and (< .cse1 v_~size~0_444) (<= 0 .cse1)) 1 0))) (not (= (ite (and (< .cse2 v_~size~0_444) (<= 0 .cse2)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_796| 4294967295) 4294967296) (* 4 (mod v_~n~0_424 1073741824))) (not (= (ite (and (< .cse3 v_~size~0_444) (<= 0 .cse3)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_444)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_545| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_444)) 1 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_444)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_444) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_545| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_549|) (= |v_thread1Thread1of1ForFork0_~i~0#1_796| 17) (not (= (ite (and (< .cse8 v_~size~0_444) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_444) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_444) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_444)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_444)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_691| 0) (= (select .cse13 (+ v_~f~0.offset_438 (* .cse5 4))) v_~x1~0_910) (not (= (ite (and (< .cse14 v_~size~0_444) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_912 v_~size~0_444) (<= 0 v_~x1~0_912)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_444) (<= 0 .cse15)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_549| 0)) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_444)) 1 0) 0)))))))))))))))))))) InVars {~size~0=v_~size~0_444, ~f~0.base=v_~f~0.base_438, #memory_int=|v_#memory_int_540|, ~n~0=v_~n~0_424, ~x1~0=v_~x1~0_912, ~f~0.offset=v_~f~0.offset_438} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_539|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_545|, ~size~0=v_~size~0_444, ~f~0.base=v_~f~0.base_438, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_796|, #memory_int=|v_#memory_int_540|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_549|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_691|, ~n~0=v_~n~0_424, ~x1~0=v_~x1~0_910, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_549|, ~f~0.offset=v_~f~0.offset_438} AuxVars[] 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 00:38:32,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [958] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_546| v_~f~0.base_444))) (let ((.cse12 (select .cse0 (+ v_~f~0.offset_444 (* v_~x1~0_932 4))))) (let ((.cse10 (select .cse0 (+ v_~f~0.offset_444 (* .cse12 4))))) (let ((.cse15 (select .cse0 (+ (* 4 .cse10) v_~f~0.offset_444)))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_444 (* .cse15 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_444 (* .cse6 4))))) (let ((.cse14 (select .cse0 (+ v_~f~0.offset_444 (* .cse5 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_444 (* .cse14 4))))) (let ((.cse9 (select .cse0 (+ (* .cse2 4) v_~f~0.offset_444)))) (let ((.cse13 (select .cse0 (+ (* .cse9 4) v_~f~0.offset_444)))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_444 (* v_~x2~0_683 4)))) (.cse8 (select .cse0 (+ v_~f~0.offset_444 (* .cse13 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_444 (* 4 .cse8)))) (.cse4 (select .cse0 (+ v_~f~0.offset_444 (* .cse3 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_444 (* .cse4 4)))) (.cse7 (select .cse0 (+ v_~f~0.offset_444 (* .cse11 4))))) (and (= (select .cse0 (+ v_~f~0.offset_444 (* .cse1 4))) v_~x2~0_682) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_560| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_564|) (not (= (ite (and (< .cse2 v_~size~0_450) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_450) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_450)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_813| 4294967295) 4294967296) (* (mod v_~n~0_430 1073741824) 4)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_450)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_450)) 1 0) 0)) (= v_~x1~0_931 (select .cse0 (+ v_~f~0.offset_444 (* .cse7 4)))) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_450)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_439| 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_450)) 1 0) 0)) (not (= 0 (ite (and (< .cse10 v_~size~0_450) (<= 0 .cse10)) 1 0))) (not (= (ite (and (< v_~x2~0_683 v_~size~0_450) (<= 0 v_~x2~0_683)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_450)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_399| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_439|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_399| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_450)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_703| 4) (not (= (ite (and (< .cse12 v_~size~0_450) (<= 0 .cse12)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_564| 0)) (not (= (ite (and (< .cse13 v_~size~0_450) (<= 0 .cse13)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_813| 13) (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_450)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_560|) (not (= 0 (ite (and (< .cse14 v_~size~0_450) (<= 0 .cse14)) 1 0))) (not (= (ite (and (< v_~x1~0_932 v_~size~0_450) (<= 0 v_~x1~0_932)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_450)) 1 0) 0)))))))))))))))) InVars {~x2~0=v_~x2~0_683, ~size~0=v_~size~0_450, ~f~0.base=v_~f~0.base_444, #memory_int=|v_#memory_int_546|, ~n~0=v_~n~0_430, ~x1~0=v_~x1~0_932, ~f~0.offset=v_~f~0.offset_444} OutVars{~x2~0=v_~x2~0_682, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_554|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_333|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_351|, ~size~0=v_~size~0_450, ~f~0.base=v_~f~0.base_444, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_339|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_399|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_703|, ~x1~0=v_~x1~0_931, ~f~0.offset=v_~f~0.offset_444, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_439|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_560|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_333|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_331|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_813|, #memory_int=|v_#memory_int_546|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_345|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_564|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_345|, ~n~0=v_~n~0_430, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_347|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_564|} 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 00:38:33,557 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:38:33,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6147 [2022-12-06 00:38:33,557 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 1369 transitions, 49918 flow [2022-12-06 00:38:33,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:38:33,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:38:33,557 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:38:33,572 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 00:38:33,763 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 00:38:33,763 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 00:38:33,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:38:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1240082608, now seen corresponding path program 1 times [2022-12-06 00:38:33,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:38:33,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884704141] [2022-12-06 00:38:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:38:33,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:38:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:38:33,838 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 00:38:33,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:38:33,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884704141] [2022-12-06 00:38:33,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884704141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:38:33,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697408747] [2022-12-06 00:38:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:38:33,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:38:33,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:38:33,839 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 00:38:33,841 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 00:38:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:38:34,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:38:34,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:38:34,043 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 00:38:34,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:38:34,085 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 00:38:34,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697408747] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:38:34,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:38:34,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 00:38:34,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266290723] [2022-12-06 00:38:34,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:38:34,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:38:34,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:38:34,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:38:34,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:38:34,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 148 [2022-12-06 00:38:34,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 1369 transitions, 49918 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 00:38:34,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:38:34,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 148 [2022-12-06 00:38:34,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:38:39,889 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 00:38:43,237 INFO L130 PetriNetUnfolder]: 5249/9314 cut-off events. [2022-12-06 00:38:43,237 INFO L131 PetriNetUnfolder]: For 894829/894829 co-relation queries the response was YES. [2022-12-06 00:38:43,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158513 conditions, 9314 events. 5249/9314 cut-off events. For 894829/894829 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 69999 event pairs, 1499 based on Foata normal form. 2/9313 useless extension candidates. Maximal degree in co-relation 157231. Up to 6650 conditions per place. [2022-12-06 00:38:43,367 INFO L137 encePairwiseOnDemand]: 89/148 looper letters, 1232 selfloop transitions, 225 changer transitions 28/1485 dead transitions. [2022-12-06 00:38:43,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 1485 transitions, 56158 flow [2022-12-06 00:38:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:38:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:38:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 188 transitions. [2022-12-06 00:38:43,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09771309771309772 [2022-12-06 00:38:43,368 INFO L175 Difference]: Start difference. First operand has 372 places, 1369 transitions, 49918 flow. Second operand 13 states and 188 transitions. [2022-12-06 00:38:43,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 1485 transitions, 56158 flow [2022-12-06 00:38:48,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 1485 transitions, 54914 flow, removed 592 selfloop flow, removed 4 redundant places. [2022-12-06 00:38:48,088 INFO L231 Difference]: Finished difference. Result has 384 places, 1393 transitions, 50395 flow [2022-12-06 00:38:48,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=48758, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=50395, PETRI_PLACES=384, PETRI_TRANSITIONS=1393} [2022-12-06 00:38:48,089 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 363 predicate places. [2022-12-06 00:38:48,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:38:48,090 INFO L89 Accepts]: Start accepts. Operand has 384 places, 1393 transitions, 50395 flow [2022-12-06 00:38:48,099 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:38:48,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:38:48,100 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 384 places, 1393 transitions, 50395 flow [2022-12-06 00:38:48,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 381 places, 1393 transitions, 50395 flow [2022-12-06 00:38:49,458 INFO L130 PetriNetUnfolder]: 1394/3482 cut-off events. [2022-12-06 00:38:49,458 INFO L131 PetriNetUnfolder]: For 365891/366776 co-relation queries the response was YES. [2022-12-06 00:38:49,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65512 conditions, 3482 events. 1394/3482 cut-off events. For 365891/366776 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 30999 event pairs, 18 based on Foata normal form. 2/3449 useless extension candidates. Maximal degree in co-relation 65003. Up to 1898 conditions per place. [2022-12-06 00:38:49,540 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 381 places, 1393 transitions, 50395 flow [2022-12-06 00:38:49,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 3372 [2022-12-06 00:38:49,542 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 00:38:50,486 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 00:38:50,578 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 00:38:50,677 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 [914] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_490| v_~f~0.base_388))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_388 (* v_~x1~0_807 4)))) (.cse2 (* (mod v_~n~0_374 1073741824) 4))) (and (= (select .cse0 (+ v_~f~0.offset_388 (* .cse1 4))) v_~x1~0_805) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_685| 2) |v_thread1Thread1of1ForFork0_~i~0#1_683|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_394)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_474|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_474| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_685| 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_685| 1) 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x1~0_807) (< v_~x1~0_807 v_~size~0_394)) 1 0) 0))))) InVars {~size~0=v_~size~0_394, ~f~0.base=v_~f~0.base_388, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_685|, #memory_int=|v_#memory_int_490|, ~n~0=v_~n~0_374, ~x1~0=v_~x1~0_807, ~f~0.offset=v_~f~0.offset_388} 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_394, ~f~0.base=v_~f~0.base_388, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_683|, #memory_int=|v_#memory_int_490|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|, ~n~0=v_~n~0_374, ~x1~0=v_~x1~0_805, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_478|, ~f~0.offset=v_~f~0.offset_388} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_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 00:38:53,262 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:38:53,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5174 [2022-12-06 00:38:53,263 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 1392 transitions, 50505 flow [2022-12-06 00:38:53,263 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 00:38:53,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:38:53,263 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:38:53,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-06 00:38:53,463 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 00:38:53,464 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 00:38:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:38:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1260557975, now seen corresponding path program 1 times [2022-12-06 00:38:53,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:38:53,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108315030] [2022-12-06 00:38:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:38:53,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:38:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:38:53,597 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 00:38:53,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:38:53,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108315030] [2022-12-06 00:38:53,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108315030] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:38:53,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520076249] [2022-12-06 00:38:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:38:53,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:38:53,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:38:53,598 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 00:38:53,600 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 00:38:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:38:53,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 00:38:53,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:38:53,824 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 00:38:53,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:38:54,098 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 00:38:54,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520076249] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:38:54,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:38:54,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-12-06 00:38:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171481217] [2022-12-06 00:38:54,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:38:54,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:38:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:38:54,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:38:54,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:38:54,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 150 [2022-12-06 00:38:54,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 1392 transitions, 50505 flow. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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 00:38:54,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:38:54,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 150 [2022-12-06 00:38:54,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:39:00,576 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 00:39:09,462 INFO L130 PetriNetUnfolder]: 5988/10553 cut-off events. [2022-12-06 00:39:09,462 INFO L131 PetriNetUnfolder]: For 1101200/1101200 co-relation queries the response was YES. [2022-12-06 00:39:09,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181289 conditions, 10553 events. 5988/10553 cut-off events. For 1101200/1101200 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 80062 event pairs, 578 based on Foata normal form. 214/10764 useless extension candidates. Maximal degree in co-relation 179799. Up to 4935 conditions per place. [2022-12-06 00:39:09,594 INFO L137 encePairwiseOnDemand]: 32/150 looper letters, 782 selfloop transitions, 1005 changer transitions 26/1813 dead transitions. [2022-12-06 00:39:09,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 1813 transitions, 68187 flow [2022-12-06 00:39:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 00:39:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 00:39:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 292 transitions. [2022-12-06 00:39:09,597 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.060833333333333336 [2022-12-06 00:39:09,597 INFO L175 Difference]: Start difference. First operand has 380 places, 1392 transitions, 50505 flow. Second operand 32 states and 292 transitions. [2022-12-06 00:39:09,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 1813 transitions, 68187 flow [2022-12-06 00:39:15,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 1813 transitions, 67431 flow, removed 378 selfloop flow, removed 2 redundant places. [2022-12-06 00:39:15,819 INFO L231 Difference]: Finished difference. Result has 417 places, 1507 transitions, 57297 flow [2022-12-06 00:39:15,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=50015, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=908, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=57297, PETRI_PLACES=417, PETRI_TRANSITIONS=1507} [2022-12-06 00:39:15,823 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 396 predicate places. [2022-12-06 00:39:15,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:39:15,823 INFO L89 Accepts]: Start accepts. Operand has 417 places, 1507 transitions, 57297 flow [2022-12-06 00:39:15,831 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:39:15,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:39:15,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 417 places, 1507 transitions, 57297 flow [2022-12-06 00:39:15,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 414 places, 1507 transitions, 57297 flow [2022-12-06 00:39:17,466 INFO L130 PetriNetUnfolder]: 1550/3896 cut-off events. [2022-12-06 00:39:17,466 INFO L131 PetriNetUnfolder]: For 407629/408846 co-relation queries the response was YES. [2022-12-06 00:39:17,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73969 conditions, 3896 events. 1550/3896 cut-off events. For 407629/408846 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 35077 event pairs, 24 based on Foata normal form. 2/3873 useless extension candidates. Maximal degree in co-relation 73495. Up to 2188 conditions per place. [2022-12-06 00:39:17,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 414 places, 1507 transitions, 57297 flow [2022-12-06 00:39:17,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 3728 [2022-12-06 00:39:20,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [957] $Ultimate##0-->L59-2: Formula: (let ((.cse13 (select |v_#memory_int_544| v_~f~0.base_442))) (let ((.cse12 (select .cse13 (+ v_~f~0.offset_442 (* v_~x1~0_924 4))))) (let ((.cse16 (select .cse13 (+ (* .cse12 4) v_~f~0.offset_442)))) (let ((.cse9 (select .cse13 (+ v_~f~0.offset_442 (* 4 .cse16))))) (let ((.cse18 (select .cse13 (+ v_~f~0.offset_442 (* 4 .cse9))))) (let ((.cse4 (select .cse13 (+ v_~f~0.offset_442 (* .cse18 4))))) (let ((.cse1 (select .cse13 (+ v_~f~0.offset_442 (* .cse4 4))))) (let ((.cse14 (select .cse13 (+ v_~f~0.offset_442 (* .cse1 4))))) (let ((.cse0 (select .cse13 (+ v_~f~0.offset_442 (* .cse14 4))))) (let ((.cse2 (select .cse13 (+ v_~f~0.offset_442 (* .cse0 4))))) (let ((.cse6 (select .cse13 (+ v_~f~0.offset_442 (* .cse2 4))))) (let ((.cse8 (select .cse13 (+ v_~f~0.offset_442 (* .cse6 4))))) (let ((.cse10 (select .cse13 (+ v_~f~0.offset_442 (* .cse8 4))))) (let ((.cse3 (select .cse13 (+ v_~f~0.offset_442 (* .cse10 4)))) (.cse17 (select .cse13 (+ v_~f~0.offset_442 (* v_~x2~0_677 4))))) (let ((.cse5 (select .cse13 (+ v_~f~0.offset_442 (* .cse17 4)))) (.cse7 (select .cse13 (+ v_~f~0.offset_442 (* .cse3 4))))) (let ((.cse11 (select .cse13 (+ v_~f~0.offset_442 (* .cse7 4)))) (.cse15 (select .cse13 (+ v_~f~0.offset_442 (* 4 .cse5))))) (and (not (= (ite (and (< .cse0 v_~size~0_448) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_448)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_553| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_557|) (not (= (ite (and (< .cse2 v_~size~0_448) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_448) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_448) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_448)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_448)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_395| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_435|) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_448)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_448)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_677 v_~size~0_448) (<= 0 v_~x2~0_677)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_448)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_448) (<= 0 .cse10)) 1 0) 0)) (= (ite (and (< .cse11 v_~size~0_448) (<= 0 .cse11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_553|) (= |v_thread2Thread1of1ForFork1_~i~1#1_697| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_557| 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_448)) 1 0) 0)) (< 15 (* (mod v_~n~0_428 1073741824) 4)) (= v_~x1~0_922 (select .cse13 (+ v_~f~0.offset_442 (* 4 .cse11)))) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_448)) 1 0) 0)) (= (select .cse13 (+ v_~f~0.offset_442 (* .cse15 4))) v_~x2~0_676) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_435| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_804| 16) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_448)) 1 0) 0)) (= (ite (and (< .cse15 v_~size~0_448) (<= 0 .cse15)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_395|) (not (= (ite (and (< .cse17 v_~size~0_448) (<= 0 .cse17)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_924 v_~size~0_448) (<= 0 v_~x1~0_924)) 1 0) 0)) (not (= (ite (and (< .cse18 v_~size~0_448) (<= 0 .cse18)) 1 0) 0))))))))))))))))))) InVars {~x2~0=v_~x2~0_677, ~size~0=v_~size~0_448, ~f~0.base=v_~f~0.base_442, #memory_int=|v_#memory_int_544|, ~n~0=v_~n~0_428, ~x1~0=v_~x1~0_924, ~f~0.offset=v_~f~0.offset_442} OutVars{~x2~0=v_~x2~0_676, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_547|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_329|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_347|, ~size~0=v_~size~0_448, ~f~0.base=v_~f~0.base_442, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_335|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_395|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_697|, ~x1~0=v_~x1~0_922, ~f~0.offset=v_~f~0.offset_442, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_435|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_553|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_329|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_327|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_804|, #memory_int=|v_#memory_int_544|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_341|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_557|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_341|, ~n~0=v_~n~0_428, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_343|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_557|} 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 00:39:22,529 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 00:39:22,936 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [951] $Ultimate##0-->L59-2: Formula: (let ((.cse7 (select |v_#memory_int_538| v_~f~0.base_436))) (let ((.cse12 (select .cse7 (+ v_~f~0.offset_436 (* v_~x1~0_906 4))))) (let ((.cse9 (select .cse7 (+ v_~f~0.offset_436 (* .cse12 4))))) (let ((.cse11 (select .cse7 (+ v_~f~0.offset_436 (* .cse9 4))))) (let ((.cse13 (select .cse7 (+ v_~f~0.offset_436 (* .cse11 4))))) (let ((.cse14 (select .cse7 (+ v_~f~0.offset_436 (* .cse13 4))))) (let ((.cse16 (select .cse7 (+ v_~f~0.offset_436 (* 4 .cse14))))) (let ((.cse0 (select .cse7 (+ v_~f~0.offset_436 (* 4 .cse16))))) (let ((.cse10 (select .cse7 (+ (* .cse0 4) v_~f~0.offset_436)))) (let ((.cse6 (select .cse7 (+ v_~f~0.offset_436 (* .cse10 4))))) (let ((.cse17 (select .cse7 (+ v_~f~0.offset_436 (* .cse6 4))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_436 (* .cse17 4))))) (let ((.cse2 (select .cse7 (+ v_~f~0.offset_436 (* v_~x2~0_669 4)))) (.cse15 (select .cse7 (+ (* .cse5 4) v_~f~0.offset_436)))) (let ((.cse3 (select .cse7 (+ v_~f~0.offset_436 (* .cse15 4)))) (.cse4 (select .cse7 (+ v_~f~0.offset_436 (* .cse2 4))))) (let ((.cse8 (select .cse7 (+ v_~f~0.offset_436 (* .cse4 4)))) (.cse1 (select .cse7 (+ v_~f~0.offset_436 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_442)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541| (ite (and (< .cse1 v_~size~0_442) (<= 0 .cse1)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_442)) 1 0) 0)) (not (= 0 (ite (and (< .cse5 v_~size~0_442) (<= 0 .cse5)) 1 0))) (not (= 0 (ite (and (< .cse6 v_~size~0_442) (<= 0 .cse6)) 1 0))) (not (= (ite (and (< v_~x2~0_669 v_~size~0_442) (<= 0 v_~x2~0_669)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_687| 4) (= v_~x2~0_668 (select .cse7 (+ v_~f~0.offset_436 (* .cse8 4)))) (not (= (ite (and (< .cse9 v_~size~0_442) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_442) (<= 0 .cse12)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391| (ite (and (< .cse8 v_~size~0_442) (<= 0 .cse8)) 1 0)) (not (= (ite (and (< .cse13 v_~size~0_442) (<= 0 .cse13)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_792| 4294967295) 4294967296) (* (mod v_~n~0_422 1073741824) 4)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431| 0)) (not (= (ite (and (< .cse14 v_~size~0_442) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_442)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431|) (not (= (ite (and (< v_~x1~0_906 v_~size~0_442) (<= 0 v_~x1~0_906)) 1 0) 0)) (= (select .cse7 (+ v_~f~0.offset_436 (* .cse1 4))) v_~x1~0_904) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (< .cse17 v_~size~0_442) (<= 0 .cse17)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_792| 15) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_545| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_545|))))))))))))))))) InVars {~x2~0=v_~x2~0_669, ~size~0=v_~size~0_442, ~f~0.base=v_~f~0.base_436, #memory_int=|v_#memory_int_538|, ~n~0=v_~n~0_422, ~x1~0=v_~x1~0_906, ~f~0.offset=v_~f~0.offset_436} OutVars{~x2~0=v_~x2~0_668, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_535|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_325|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_343|, ~size~0=v_~size~0_442, ~f~0.base=v_~f~0.base_436, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_331|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_687|, ~x1~0=v_~x1~0_904, ~f~0.offset=v_~f~0.offset_436, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_325|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_323|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_792|, #memory_int=|v_#memory_int_538|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_337|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_545|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_337|, ~n~0=v_~n~0_422, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_339|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_545|} 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 00:39:24,442 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [951] $Ultimate##0-->L59-2: Formula: (let ((.cse7 (select |v_#memory_int_538| v_~f~0.base_436))) (let ((.cse12 (select .cse7 (+ v_~f~0.offset_436 (* v_~x1~0_906 4))))) (let ((.cse9 (select .cse7 (+ v_~f~0.offset_436 (* .cse12 4))))) (let ((.cse11 (select .cse7 (+ v_~f~0.offset_436 (* .cse9 4))))) (let ((.cse13 (select .cse7 (+ v_~f~0.offset_436 (* .cse11 4))))) (let ((.cse14 (select .cse7 (+ v_~f~0.offset_436 (* .cse13 4))))) (let ((.cse16 (select .cse7 (+ v_~f~0.offset_436 (* 4 .cse14))))) (let ((.cse0 (select .cse7 (+ v_~f~0.offset_436 (* 4 .cse16))))) (let ((.cse10 (select .cse7 (+ (* .cse0 4) v_~f~0.offset_436)))) (let ((.cse6 (select .cse7 (+ v_~f~0.offset_436 (* .cse10 4))))) (let ((.cse17 (select .cse7 (+ v_~f~0.offset_436 (* .cse6 4))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_436 (* .cse17 4))))) (let ((.cse2 (select .cse7 (+ v_~f~0.offset_436 (* v_~x2~0_669 4)))) (.cse15 (select .cse7 (+ (* .cse5 4) v_~f~0.offset_436)))) (let ((.cse3 (select .cse7 (+ v_~f~0.offset_436 (* .cse15 4)))) (.cse4 (select .cse7 (+ v_~f~0.offset_436 (* .cse2 4))))) (let ((.cse8 (select .cse7 (+ v_~f~0.offset_436 (* .cse4 4)))) (.cse1 (select .cse7 (+ v_~f~0.offset_436 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_442)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541| (ite (and (< .cse1 v_~size~0_442) (<= 0 .cse1)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_442)) 1 0) 0)) (not (= 0 (ite (and (< .cse5 v_~size~0_442) (<= 0 .cse5)) 1 0))) (not (= 0 (ite (and (< .cse6 v_~size~0_442) (<= 0 .cse6)) 1 0))) (not (= (ite (and (< v_~x2~0_669 v_~size~0_442) (<= 0 v_~x2~0_669)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_687| 4) (= v_~x2~0_668 (select .cse7 (+ v_~f~0.offset_436 (* .cse8 4)))) (not (= (ite (and (< .cse9 v_~size~0_442) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_442) (<= 0 .cse12)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391| (ite (and (< .cse8 v_~size~0_442) (<= 0 .cse8)) 1 0)) (not (= (ite (and (< .cse13 v_~size~0_442) (<= 0 .cse13)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_792| 4294967295) 4294967296) (* (mod v_~n~0_422 1073741824) 4)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431| 0)) (not (= (ite (and (< .cse14 v_~size~0_442) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_442)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431|) (not (= (ite (and (< v_~x1~0_906 v_~size~0_442) (<= 0 v_~x1~0_906)) 1 0) 0)) (= (select .cse7 (+ v_~f~0.offset_436 (* .cse1 4))) v_~x1~0_904) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (< .cse17 v_~size~0_442) (<= 0 .cse17)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_792| 15) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_545| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_545|))))))))))))))))) InVars {~x2~0=v_~x2~0_669, ~size~0=v_~size~0_442, ~f~0.base=v_~f~0.base_436, #memory_int=|v_#memory_int_538|, ~n~0=v_~n~0_422, ~x1~0=v_~x1~0_906, ~f~0.offset=v_~f~0.offset_436} OutVars{~x2~0=v_~x2~0_668, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_535|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_325|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_343|, ~size~0=v_~size~0_442, ~f~0.base=v_~f~0.base_436, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_331|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_687|, ~x1~0=v_~x1~0_904, ~f~0.offset=v_~f~0.offset_436, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_325|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_323|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_792|, #memory_int=|v_#memory_int_538|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_337|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_545|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_337|, ~n~0=v_~n~0_422, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_339|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_545|} 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 [990] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_589| v_~f~0.base_484))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_484 (* v_~x1~0_1051 4)))) (.cse1 (* (mod v_~n~0_470 1073741824) 4))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_490)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_636|) (= |v_thread1Thread1of1ForFork0_~i~0#1_914| (+ |v_thread1Thread1of1ForFork0_~i~0#1_916| 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_640| 0)) (not (= (ite (and (<= 0 v_~x1~0_1051) (< v_~x1~0_1051 v_~size~0_490)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_914| 4294967295) 4294967296) .cse1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_636| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_640|) (= v_~x1~0_1049 (select .cse2 (+ v_~f~0.offset_484 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_916| 4294967296) .cse1)))) InVars {~size~0=v_~size~0_490, ~f~0.base=v_~f~0.base_484, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_916|, #memory_int=|v_#memory_int_589|, ~n~0=v_~n~0_470, ~x1~0=v_~x1~0_1051, ~f~0.offset=v_~f~0.offset_484} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_630|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_636|, ~size~0=v_~size~0_490, ~f~0.base=v_~f~0.base_484, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_914|, #memory_int=|v_#memory_int_589|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_640|, ~n~0=v_~n~0_470, ~x1~0=v_~x1~0_1049, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_640|, ~f~0.offset=v_~f~0.offset_484} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_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 00:39:26,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [951] $Ultimate##0-->L59-2: Formula: (let ((.cse7 (select |v_#memory_int_538| v_~f~0.base_436))) (let ((.cse12 (select .cse7 (+ v_~f~0.offset_436 (* v_~x1~0_906 4))))) (let ((.cse9 (select .cse7 (+ v_~f~0.offset_436 (* .cse12 4))))) (let ((.cse11 (select .cse7 (+ v_~f~0.offset_436 (* .cse9 4))))) (let ((.cse13 (select .cse7 (+ v_~f~0.offset_436 (* .cse11 4))))) (let ((.cse14 (select .cse7 (+ v_~f~0.offset_436 (* .cse13 4))))) (let ((.cse16 (select .cse7 (+ v_~f~0.offset_436 (* 4 .cse14))))) (let ((.cse0 (select .cse7 (+ v_~f~0.offset_436 (* 4 .cse16))))) (let ((.cse10 (select .cse7 (+ (* .cse0 4) v_~f~0.offset_436)))) (let ((.cse6 (select .cse7 (+ v_~f~0.offset_436 (* .cse10 4))))) (let ((.cse17 (select .cse7 (+ v_~f~0.offset_436 (* .cse6 4))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_436 (* .cse17 4))))) (let ((.cse2 (select .cse7 (+ v_~f~0.offset_436 (* v_~x2~0_669 4)))) (.cse15 (select .cse7 (+ (* .cse5 4) v_~f~0.offset_436)))) (let ((.cse3 (select .cse7 (+ v_~f~0.offset_436 (* .cse15 4)))) (.cse4 (select .cse7 (+ v_~f~0.offset_436 (* .cse2 4))))) (let ((.cse8 (select .cse7 (+ v_~f~0.offset_436 (* .cse4 4)))) (.cse1 (select .cse7 (+ v_~f~0.offset_436 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_442)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541| (ite (and (< .cse1 v_~size~0_442) (<= 0 .cse1)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_442)) 1 0) 0)) (not (= 0 (ite (and (< .cse5 v_~size~0_442) (<= 0 .cse5)) 1 0))) (not (= 0 (ite (and (< .cse6 v_~size~0_442) (<= 0 .cse6)) 1 0))) (not (= (ite (and (< v_~x2~0_669 v_~size~0_442) (<= 0 v_~x2~0_669)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_687| 4) (= v_~x2~0_668 (select .cse7 (+ v_~f~0.offset_436 (* .cse8 4)))) (not (= (ite (and (< .cse9 v_~size~0_442) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_442) (<= 0 .cse12)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391| (ite (and (< .cse8 v_~size~0_442) (<= 0 .cse8)) 1 0)) (not (= (ite (and (< .cse13 v_~size~0_442) (<= 0 .cse13)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_792| 4294967295) 4294967296) (* (mod v_~n~0_422 1073741824) 4)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431| 0)) (not (= (ite (and (< .cse14 v_~size~0_442) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_442)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431|) (not (= (ite (and (< v_~x1~0_906 v_~size~0_442) (<= 0 v_~x1~0_906)) 1 0) 0)) (= (select .cse7 (+ v_~f~0.offset_436 (* .cse1 4))) v_~x1~0_904) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_442)) 1 0) 0)) (not (= (ite (and (< .cse17 v_~size~0_442) (<= 0 .cse17)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_792| 15) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_545| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_545|))))))))))))))))) InVars {~x2~0=v_~x2~0_669, ~size~0=v_~size~0_442, ~f~0.base=v_~f~0.base_436, #memory_int=|v_#memory_int_538|, ~n~0=v_~n~0_422, ~x1~0=v_~x1~0_906, ~f~0.offset=v_~f~0.offset_436} OutVars{~x2~0=v_~x2~0_668, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_535|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_325|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_343|, ~size~0=v_~size~0_442, ~f~0.base=v_~f~0.base_436, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_331|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_687|, ~x1~0=v_~x1~0_904, ~f~0.offset=v_~f~0.offset_436, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_325|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_323|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_792|, #memory_int=|v_#memory_int_538|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_337|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_545|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_337|, ~n~0=v_~n~0_422, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_339|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_545|} 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 [991] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_591| v_~f~0.base_486))) (let ((.cse3 (select .cse0 (+ (* v_~x2~0_740 4) v_~f~0.offset_486)))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_486 (* .cse3 4))))) (let ((.cse1 (* (mod v_~n~0_472 1073741824) 4)) (.cse2 (select .cse0 (+ v_~f~0.offset_486 (* .cse4 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_472| 0)) (= v_~x1~0_1055 (select .cse0 (+ v_~f~0.offset_486 (* v_~x1~0_1056 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_921| 4294967296) .cse1) (not (= (ite (and (< v_~x2~0_740 v_~size~0_492) (<= 0 v_~x2~0_740)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_432| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_472|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_640| (ite (and (< v_~x1~0_1056 v_~size~0_492) (<= 0 v_~x1~0_1056)) 1 0)) (= v_~x2~0_739 (select .cse0 (+ v_~f~0.offset_486 (* .cse2 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_644| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_640| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_644|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_492)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_920| (+ |v_thread1Thread1of1ForFork0_~i~0#1_921| 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_755| 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_432| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_492)) 1 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_492)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_755| 4) |v_thread2Thread1of1ForFork1_~i~1#1_754|)))))) InVars {~x2~0=v_~x2~0_740, ~size~0=v_~size~0_492, ~f~0.base=v_~f~0.base_486, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_921|, #memory_int=|v_#memory_int_591|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_755|, ~n~0=v_~n~0_472, ~x1~0=v_~x1~0_1056, ~f~0.offset=v_~f~0.offset_486} OutVars{~x2~0=v_~x2~0_739, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_634|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_366|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_384|, ~size~0=v_~size~0_492, ~f~0.base=v_~f~0.base_486, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_372|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_432|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_754|, ~x1~0=v_~x1~0_1055, ~f~0.offset=v_~f~0.offset_486, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_472|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_640|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_366|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_364|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_920|, #memory_int=|v_#memory_int_591|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_378|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_644|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_378|, ~n~0=v_~n~0_472, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_380|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_644|} 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 00:39:33,531 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:39:33,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17708 [2022-12-06 00:39:33,531 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 1507 transitions, 57514 flow [2022-12-06 00:39:33,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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 00:39:33,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:39:33,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:39:33,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-06 00:39:33,737 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 00:39:33,737 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 00:39:33,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:39:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1184434981, now seen corresponding path program 1 times [2022-12-06 00:39:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:39:33,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050705300] [2022-12-06 00:39:33,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:39:33,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:39:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:39:33,919 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 00:39:33,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:39:33,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050705300] [2022-12-06 00:39:33,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050705300] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:39:33,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49989426] [2022-12-06 00:39:33,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:39:33,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:39:33,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:39:33,920 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 00:39:33,922 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 00:39:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:39:34,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 00:39:34,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:39:34,117 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 00:39:34,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:39:34,225 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 00:39:34,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49989426] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:39:34,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:39:34,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-06 00:39:34,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414176603] [2022-12-06 00:39:34,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:39:34,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:39:34,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:39:34,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:39:34,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:39:34,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 156 [2022-12-06 00:39:34,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 1507 transitions, 57514 flow. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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 00:39:34,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:39:34,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 156 [2022-12-06 00:39:34,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:39:40,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 00:39:50,693 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 00:39:55,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 00:40:05,332 INFO L130 PetriNetUnfolder]: 6782/11929 cut-off events. [2022-12-06 00:40:05,332 INFO L131 PetriNetUnfolder]: For 1155895/1155895 co-relation queries the response was YES. [2022-12-06 00:40:05,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207385 conditions, 11929 events. 6782/11929 cut-off events. For 1155895/1155895 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 91717 event pairs, 1304 based on Foata normal form. 146/12072 useless extension candidates. Maximal degree in co-relation 206129. Up to 6687 conditions per place. [2022-12-06 00:40:05,491 INFO L137 encePairwiseOnDemand]: 37/156 looper letters, 822 selfloop transitions, 1217 changer transitions 4/2043 dead transitions. [2022-12-06 00:40:05,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 2043 transitions, 81376 flow [2022-12-06 00:40:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 00:40:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 00:40:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 312 transitions. [2022-12-06 00:40:05,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.06060606060606061 [2022-12-06 00:40:05,493 INFO L175 Difference]: Start difference. First operand has 414 places, 1507 transitions, 57514 flow. Second operand 33 states and 312 transitions. [2022-12-06 00:40:05,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 2043 transitions, 81376 flow [2022-12-06 00:40:12,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 2043 transitions, 79159 flow, removed 1018 selfloop flow, removed 9 redundant places. [2022-12-06 00:40:12,430 INFO L231 Difference]: Finished difference. Result has 452 places, 1864 transitions, 73645 flow [2022-12-06 00:40:12,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=55738, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=916, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=73645, PETRI_PLACES=452, PETRI_TRANSITIONS=1864} [2022-12-06 00:40:12,431 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 431 predicate places. [2022-12-06 00:40:12,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:40:12,431 INFO L89 Accepts]: Start accepts. Operand has 452 places, 1864 transitions, 73645 flow [2022-12-06 00:40:12,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:40:12,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:40:12,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 452 places, 1864 transitions, 73645 flow [2022-12-06 00:40:12,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 448 places, 1864 transitions, 73645 flow [2022-12-06 00:40:14,468 INFO L130 PetriNetUnfolder]: 1841/4537 cut-off events. [2022-12-06 00:40:14,468 INFO L131 PetriNetUnfolder]: For 525814/527024 co-relation queries the response was YES. [2022-12-06 00:40:14,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91064 conditions, 4537 events. 1841/4537 cut-off events. For 525814/527024 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 41413 event pairs, 11 based on Foata normal form. 2/4507 useless extension candidates. Maximal degree in co-relation 90595. Up to 2644 conditions per place. [2022-12-06 00:40:14,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 448 places, 1864 transitions, 73645 flow [2022-12-06 00:40:14,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 4402 [2022-12-06 00:40:14,769 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 00:40:16,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1003] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_603| v_~f~0.base_498))) (let ((.cse14 (select .cse6 (+ v_~f~0.offset_498 (* v_~x2~0_771 4))))) (let ((.cse9 (select .cse6 (+ v_~f~0.offset_498 (* 4 .cse14))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_498 (* .cse9 4))))) (let ((.cse17 (select .cse6 (+ v_~f~0.offset_498 (* .cse5 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_498 (* 4 .cse17))))) (let ((.cse12 (select .cse6 (+ v_~f~0.offset_498 (* .cse0 4)))) (.cse1 (select .cse6 (+ (* v_~x1~0_1086 4) v_~f~0.offset_498)))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_498 (* .cse1 4)))) (.cse13 (select .cse6 (+ v_~f~0.offset_498 (* .cse12 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_498 (* .cse13 4)))) (.cse2 (select .cse6 (+ v_~f~0.offset_498 (* .cse3 4))))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_498 (* 4 .cse2)))) (.cse16 (select .cse6 (+ v_~f~0.offset_498 (* .cse4 4))))) (let ((.cse15 (select .cse6 (+ v_~f~0.offset_498 (* .cse16 4)))) (.cse11 (select .cse6 (+ v_~f~0.offset_498 (* .cse8 4))))) (let ((.cse7 (select .cse6 (+ v_~f~0.offset_498 (* .cse11 4)))) (.cse10 (select .cse6 (+ v_~f~0.offset_498 (* .cse15 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_504)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_504) (<= 0 .cse1)) 1 0) 0)) (< 8 (* (mod v_~n~0_484 1073741824) 4)) (not (= (ite (and (< .cse2 v_~size~0_504) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_504)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_504)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_504) (<= 0 .cse5)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_940|) (= (select .cse6 (+ v_~f~0.offset_498 (* .cse7 4))) v_~x1~0_1085) (not (= (ite (and (< .cse8 v_~size~0_504) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_504)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_658| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_662|) (= (select .cse6 (+ v_~f~0.offset_498 (* .cse10 4))) v_~x2~0_769) (not (= (ite (and (< .cse11 v_~size~0_504) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_771 v_~size~0_504) (<= 0 v_~x2~0_771)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_490| 0)) (not (= (ite (and (< v_~x1~0_1086 v_~size~0_504) (<= 0 v_~x1~0_1086)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_774| 12) (not (= (ite (and (< .cse12 v_~size~0_504) (<= 0 .cse12)) 1 0) 0)) (= (ite (and (< .cse7 v_~size~0_504) (<= 0 .cse7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_658|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_450| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_490|) (not (= (ite (and (< .cse13 v_~size~0_504) (<= 0 .cse13)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_662| 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_504)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_450| (ite (and (< .cse10 v_~size~0_504) (<= 0 .cse10)) 1 0)) (not (= (ite (and (< .cse15 v_~size~0_504) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_504) (<= 0 .cse16)) 1 0) 0)) (not (= (ite (and (< .cse17 v_~size~0_504) (<= 0 .cse17)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_771, ~size~0=v_~size~0_504, ~f~0.base=v_~f~0.base_498, #memory_int=|v_#memory_int_603|, ~n~0=v_~n~0_484, ~x1~0=v_~x1~0_1086, ~f~0.offset=v_~f~0.offset_498} OutVars{~x2~0=v_~x2~0_769, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_652|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_384|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_402|, ~size~0=v_~size~0_504, ~f~0.base=v_~f~0.base_498, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_390|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_450|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_774|, ~x1~0=v_~x1~0_1085, ~f~0.offset=v_~f~0.offset_498, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_490|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_658|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_384|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_382|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_940|, #memory_int=|v_#memory_int_603|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_396|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_662|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_396|, ~n~0=v_~n~0_484, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_398|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_662|} 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 00:40:18,917 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 00:40:19,144 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 00:40:19,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6713 [2022-12-06 00:40:19,144 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 1861 transitions, 73683 flow [2022-12-06 00:40:19,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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 00:40:19,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:40:19,145 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:40:19,153 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 00:40:19,345 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 00:40:19,345 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 00:40:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:40:19,345 INFO L85 PathProgramCache]: Analyzing trace with hash 456346262, now seen corresponding path program 1 times [2022-12-06 00:40:19,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:40:19,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620688115] [2022-12-06 00:40:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:40:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:40:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:40:19,509 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 00:40:19,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:40:19,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620688115] [2022-12-06 00:40:19,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620688115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:40:19,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374116707] [2022-12-06 00:40:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:40:19,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:40:19,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:40:19,534 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 00:40:19,535 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 00:40:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:40:19,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 00:40:19,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:40:19,830 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 00:40:19,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:40:19,906 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 00:40:19,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374116707] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:40:19,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:40:19,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-12-06 00:40:19,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435829741] [2022-12-06 00:40:19,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:40:19,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:40:19,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:40:19,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:40:19,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:40:19,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 158 [2022-12-06 00:40:19,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 1861 transitions, 73683 flow. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:40:19,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:40:19,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 158 [2022-12-06 00:40:19,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:40:30,148 INFO L130 PetriNetUnfolder]: 6983/12258 cut-off events. [2022-12-06 00:40:30,148 INFO L131 PetriNetUnfolder]: For 1280264/1280264 co-relation queries the response was YES. [2022-12-06 00:40:30,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219125 conditions, 12258 events. 6983/12258 cut-off events. For 1280264/1280264 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 94373 event pairs, 2204 based on Foata normal form. 286/12541 useless extension candidates. Maximal degree in co-relation 217913. Up to 10481 conditions per place. [2022-12-06 00:40:30,314 INFO L137 encePairwiseOnDemand]: 119/158 looper letters, 1860 selfloop transitions, 200 changer transitions 4/2064 dead transitions. [2022-12-06 00:40:30,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 2064 transitions, 84315 flow [2022-12-06 00:40:30,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:40:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:40:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2022-12-06 00:40:30,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12025316455696203 [2022-12-06 00:40:30,315 INFO L175 Difference]: Start difference. First operand has 445 places, 1861 transitions, 73683 flow. Second operand 11 states and 209 transitions. [2022-12-06 00:40:30,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 2064 transitions, 84315 flow [2022-12-06 00:40:40,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 2064 transitions, 81748 flow, removed 1223 selfloop flow, removed 7 redundant places. [2022-12-06 00:40:40,462 INFO L231 Difference]: Finished difference. Result has 450 places, 1885 transitions, 72395 flow [2022-12-06 00:40:40,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=70762, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=72395, PETRI_PLACES=450, PETRI_TRANSITIONS=1885} [2022-12-06 00:40:40,463 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 429 predicate places. [2022-12-06 00:40:40,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:40:40,463 INFO L89 Accepts]: Start accepts. Operand has 450 places, 1885 transitions, 72395 flow [2022-12-06 00:40:40,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:40:40,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:40:40,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 450 places, 1885 transitions, 72395 flow [2022-12-06 00:40:40,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 450 places, 1885 transitions, 72395 flow [2022-12-06 00:40:42,658 INFO L130 PetriNetUnfolder]: 1907/4674 cut-off events. [2022-12-06 00:40:42,658 INFO L131 PetriNetUnfolder]: For 533667/534777 co-relation queries the response was YES. [2022-12-06 00:40:42,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92953 conditions, 4674 events. 1907/4674 cut-off events. For 533667/534777 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 42694 event pairs, 16 based on Foata normal form. 4/4649 useless extension candidates. Maximal degree in co-relation 92458. Up to 2724 conditions per place. [2022-12-06 00:40:42,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 450 places, 1885 transitions, 72395 flow [2022-12-06 00:40:42,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 4498 [2022-12-06 00:40:46,666 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:40:46,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6204 [2022-12-06 00:40:46,667 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 1884 transitions, 72410 flow [2022-12-06 00:40:46,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:40:46,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:40:46,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:40:46,674 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 00:40:46,872 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 00:40:46,873 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 00:40:46,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:40:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash 305348007, now seen corresponding path program 1 times [2022-12-06 00:40:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:40:46,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384020180] [2022-12-06 00:40:46,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:40:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:40:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:40:47,056 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 00:40:47,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:40:47,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384020180] [2022-12-06 00:40:47,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384020180] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:40:47,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92470355] [2022-12-06 00:40:47,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:40:47,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:40:47,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:40:47,073 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 00:40:47,074 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 00:40:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:40:47,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 00:40:47,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:40:47,228 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 00:40:47,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:40:47,323 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 00:40:47,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92470355] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:40:47,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:40:47,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 00:40:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111235930] [2022-12-06 00:40:47,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:40:47,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:40:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:40:47,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:40:47,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-06 00:40:47,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 159 [2022-12-06 00:40:47,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 1884 transitions, 72410 flow. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 00:40:47,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:40:47,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 159 [2022-12-06 00:40:47,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:40:52,803 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 00:41:02,923 INFO L130 PetriNetUnfolder]: 7589/13392 cut-off events. [2022-12-06 00:41:02,923 INFO L131 PetriNetUnfolder]: For 1359908/1359908 co-relation queries the response was YES. [2022-12-06 00:41:03,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238744 conditions, 13392 events. 7589/13392 cut-off events. For 1359908/1359908 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 105194 event pairs, 1420 based on Foata normal form. 40/13429 useless extension candidates. Maximal degree in co-relation 237538. Up to 7808 conditions per place. [2022-12-06 00:41:03,108 INFO L137 encePairwiseOnDemand]: 37/159 looper letters, 1020 selfloop transitions, 1185 changer transitions 4/2209 dead transitions. [2022-12-06 00:41:03,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 2209 transitions, 88129 flow [2022-12-06 00:41:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 00:41:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 00:41:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 263 transitions. [2022-12-06 00:41:03,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09189378057302586 [2022-12-06 00:41:03,110 INFO L175 Difference]: Start difference. First operand has 449 places, 1884 transitions, 72410 flow. Second operand 18 states and 263 transitions. [2022-12-06 00:41:03,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 2209 transitions, 88129 flow [2022-12-06 00:41:14,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 2209 transitions, 87140 flow, removed 492 selfloop flow, removed 1 redundant places. [2022-12-06 00:41:14,140 INFO L231 Difference]: Finished difference. Result has 474 places, 2049 transitions, 81622 flow [2022-12-06 00:41:14,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=71726, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1053, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=766, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=81622, PETRI_PLACES=474, PETRI_TRANSITIONS=2049} [2022-12-06 00:41:14,141 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 453 predicate places. [2022-12-06 00:41:14,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:41:14,141 INFO L89 Accepts]: Start accepts. Operand has 474 places, 2049 transitions, 81622 flow [2022-12-06 00:41:14,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:41:14,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:41:14,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 474 places, 2049 transitions, 81622 flow [2022-12-06 00:41:14,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 474 places, 2049 transitions, 81622 flow [2022-12-06 00:41:16,729 INFO L130 PetriNetUnfolder]: 2034/5053 cut-off events. [2022-12-06 00:41:16,729 INFO L131 PetriNetUnfolder]: For 598383/599784 co-relation queries the response was YES. [2022-12-06 00:41:16,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103028 conditions, 5053 events. 2034/5053 cut-off events. For 598383/599784 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 47300 event pairs, 22 based on Foata normal form. 7/5024 useless extension candidates. Maximal degree in co-relation 102525. Up to 2944 conditions per place. [2022-12-06 00:41:16,849 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 474 places, 2049 transitions, 81622 flow [2022-12-06 00:41:16,849 INFO L188 LiptonReduction]: Number of co-enabled transitions 4938 [2022-12-06 00:41:16,852 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:41:16,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2711 [2022-12-06 00:41:16,852 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 2049 transitions, 81622 flow [2022-12-06 00:41:16,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 00:41:16,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:41:16,852 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:41:16,858 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 00:41:17,057 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 00:41:17,057 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 00:41:17,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:41:17,057 INFO L85 PathProgramCache]: Analyzing trace with hash 856928245, now seen corresponding path program 1 times [2022-12-06 00:41:17,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:41:17,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008819526] [2022-12-06 00:41:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:41:17,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:41:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:41:38,801 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 00:41:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:41:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008819526] [2022-12-06 00:41:38,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008819526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:41:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234864992] [2022-12-06 00:41:38,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:41:38,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:41:38,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:41:38,805 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 00:41:38,808 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 00:41:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:41:38,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 00:41:38,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:41:39,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:41:39,319 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 00:41:39,937 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 00:41:39,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:41:44,742 INFO L321 Elim1Store]: treesize reduction 40, result has 96.3 percent of original size [2022-12-06 00:41:44,743 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 00:42:44,447 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 00:42:44,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234864992] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:42:44,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:42:44,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 18 [2022-12-06 00:42:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936084861] [2022-12-06 00:42:44,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:42:44,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:42:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:42:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:42:44,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-12-06 00:42:44,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 159 [2022-12-06 00:42:44,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 2049 transitions, 81622 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 00:42:44,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:42:44,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 159 [2022-12-06 00:42:44,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 00:42:51,732 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 00:42:51,732 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 00:42:52,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-12-06 00:42:52,860 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 00:42:52,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 00:42:52,861 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 00:42:52,861 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 00:42:52,862 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 00:42:52,862 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:42:52,864 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:42:52,864 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:42:52,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:42:52 BasicIcfg [2022-12-06 00:42:52,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:42:52,865 INFO L158 Benchmark]: Toolchain (without parser) took 830331.58ms. Allocated memory was 244.3MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 219.7MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 385.8MB. Max. memory is 8.0GB. [2022-12-06 00:42:52,865 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 244.3MB. Free memory is still 220.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:42:52,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.25ms. Allocated memory is still 244.3MB. Free memory was 219.2MB in the beginning and 207.8MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 00:42:52,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.31ms. Allocated memory is still 244.3MB. Free memory was 207.8MB in the beginning and 205.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:42:52,866 INFO L158 Benchmark]: Boogie Preprocessor took 25.09ms. Allocated memory is still 244.3MB. Free memory was 205.8MB in the beginning and 204.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:42:52,866 INFO L158 Benchmark]: RCFGBuilder took 370.23ms. Allocated memory is still 244.3MB. Free memory was 204.1MB in the beginning and 187.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 00:42:52,866 INFO L158 Benchmark]: TraceAbstraction took 829741.38ms. Allocated memory was 244.3MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 186.9MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 353.3MB. Max. memory is 8.0GB. [2022-12-06 00:42:52,866 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 244.3MB. Free memory is still 220.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 165.25ms. Allocated memory is still 244.3MB. Free memory was 219.2MB in the beginning and 207.8MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.31ms. Allocated memory is still 244.3MB. Free memory was 207.8MB in the beginning and 205.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.09ms. Allocated memory is still 244.3MB. Free memory was 205.8MB in the beginning and 204.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 370.23ms. Allocated memory is still 244.3MB. Free memory was 204.1MB in the beginning and 187.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 829741.38ms. Allocated memory was 244.3MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 186.9MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 353.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 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.6s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 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.1s, 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.4s, 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.1s, 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.1s, 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: 1.0s, 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.4s, 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.4s, 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: 3.9s, 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.3s, 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.4s, 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: 3.6s, 184 PlacesBefore, 183 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.5s, 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.7s, 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.6s, 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.8s, 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: 9.6s, 246 PlacesBefore, 246 PlacesAfterwards, 671 TransitionsBefore, 671 TransitionsAfterwards, 1828 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 309, Positive conditional cache size: 298, 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: 4.1s, 259 PlacesBefore, 259 PlacesAfterwards, 689 TransitionsBefore, 689 TransitionsAfterwards, 1856 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): 346, Positive cache size: 346, Positive conditional cache size: 335, 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: 10.4s, 279 PlacesBefore, 274 PlacesAfterwards, 711 TransitionsBefore, 706 TransitionsAfterwards, 1888 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 381, Positive cache size: 381, Positive conditional cache size: 370, 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, 280 PlacesBefore, 280 PlacesAfterwards, 801 TransitionsBefore, 801 TransitionsAfterwards, 2108 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): 381, Positive cache size: 381, Positive conditional cache size: 370, 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, 290 PlacesBefore, 290 PlacesAfterwards, 838 TransitionsBefore, 838 TransitionsAfterwards, 2198 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): 381, Positive cache size: 381, Positive conditional cache size: 370, 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: 3.5s, 306 PlacesBefore, 305 PlacesAfterwards, 857 TransitionsBefore, 856 TransitionsAfterwards, 2248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 382, Positive cache size: 382, Positive conditional cache size: 371, 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.1s, 314 PlacesBefore, 312 PlacesAfterwards, 866 TransitionsBefore, 864 TransitionsAfterwards, 2274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 421, Positive conditional cache size: 410, 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, 306 PlacesBefore, 306 PlacesAfterwards, 860 TransitionsBefore, 860 TransitionsAfterwards, 2254 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): 421, Positive cache size: 421, Positive conditional cache size: 410, 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: 6.0s, 322 PlacesBefore, 322 PlacesAfterwards, 1049 TransitionsBefore, 1049 TransitionsAfterwards, 2722 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 422, Positive conditional cache size: 411, 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: 8.4s, 358 PlacesBefore, 354 PlacesAfterwards, 1276 TransitionsBefore, 1272 TransitionsAfterwards, 3032 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 558, Positive cache size: 558, Positive conditional cache size: 547, 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: 4.7s, 372 PlacesBefore, 372 PlacesAfterwards, 1369 TransitionsBefore, 1369 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 560, Positive cache size: 560, Positive conditional cache size: 549, 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.7s, 381 PlacesBefore, 380 PlacesAfterwards, 1393 TransitionsBefore, 1392 TransitionsAfterwards, 3372 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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): 561, Positive cache size: 561, Positive conditional cache size: 550, 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: 16.0s, 414 PlacesBefore, 414 PlacesAfterwards, 1507 TransitionsBefore, 1507 TransitionsAfterwards, 3728 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 10, independent: 7, independent conditional: 7, 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): 599, Positive cache size: 599, Positive conditional cache size: 588, 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: 4.6s, 448 PlacesBefore, 445 PlacesAfterwards, 1864 TransitionsBefore, 1861 TransitionsAfterwards, 4402 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 661, Positive cache size: 661, Positive conditional cache size: 650, 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.9s, 450 PlacesBefore, 449 PlacesAfterwards, 1885 TransitionsBefore, 1884 TransitionsAfterwards, 4498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 663, Positive cache size: 663, Positive conditional cache size: 652, 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, 474 PlacesBefore, 474 PlacesAfterwards, 2049 TransitionsBefore, 2049 TransitionsAfterwards, 4938 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): 663, Positive cache size: 663, Positive conditional cache size: 652, 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 - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 237 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 829.6s, OverallIterations: 53, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 470.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 2556 SdHoareTripleChecker+Valid, 233.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2556 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 228.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 4139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29027 IncrementalHoareTripleChecker+Invalid, 33182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4139 mSolverCounterUnsat, 8 mSDtfsCounter, 29027 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1871 GetRequests, 1094 SyntacticMatches, 24 SemanticMatches, 753 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3061 ImplicationChecksByTransitivity, 119.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81622occurred in iteration=52, InterpolantAutomatonStates: 569, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 184.5s InterpolantComputationTime, 1356 NumberOfCodeBlocks, 1356 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 1810 ConstructedInterpolants, 19 QuantifiedInterpolants, 121290 SizeOfPredicates, 290 NumberOfNonLiveVariables, 8896 ConjunctsInSsa, 989 ConjunctsInUnsatCore, 136 InterpolantComputations, 12 PerfectInterpolantSequences, 92/429 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown