/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:07:34,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:07:34,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:07:34,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:07:34,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:07:34,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:07:34,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:07:34,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:07:34,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:07:34,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:07:34,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:07:34,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:07:34,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:07:34,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:07:34,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:07:34,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:07:34,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:07:34,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:07:34,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:07:34,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:07:34,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:07:34,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:07:34,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:07:34,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:07:34,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:07:34,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:07:34,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:07:34,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:07:34,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:07:34,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:07:34,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:07:34,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:07:34,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:07:34,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:07:34,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:07:34,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:07:34,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:07:34,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:07:34,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:07:34,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:07:34,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:07:34,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 11:07:34,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:07:34,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:07:34,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:07:34,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:07:34,177 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:07:34,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:07:34,178 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:07:34,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:07:34,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:07:34,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:07:34,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:07:34,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:07:34,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:07:34,179 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:07:34,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:07:34,180 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:07:34,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:07:34,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:07:34,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:07:34,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:07:34,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:07:34,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:07:34,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:07:34,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:07:34,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:07:34,181 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 11:07:34,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:07:34,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:07:34,181 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:07:34,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:07:34,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:07:34,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:07:34,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:07:34,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:07:34,497 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:07:34,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-12-13 11:07:35,534 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:07:35,759 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:07:35,759 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-12-13 11:07:35,765 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618814579/c2bdfa8ffb2a484e85bf5267e35163db/FLAGa43968a95 [2022-12-13 11:07:35,775 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618814579/c2bdfa8ffb2a484e85bf5267e35163db [2022-12-13 11:07:35,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:07:35,778 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:07:35,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:07:35,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:07:35,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:07:35,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:07:35" (1/1) ... [2022-12-13 11:07:35,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d142dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:35, skipping insertion in model container [2022-12-13 11:07:35,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:07:35" (1/1) ... [2022-12-13 11:07:35,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:07:35,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:07:35,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:07:35,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:07:35,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:07:35,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:07:35,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:07:35,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:07:35,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:07:35,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:07:35,969 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/popl20-two-queue.wvr.c[2987,3000] [2022-12-13 11:07:35,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:07:35,983 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:07:35,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:07:35,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:07:35,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:07:35,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:07:35,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:07:35,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:07:35,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:07:35,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:07:36,003 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/popl20-two-queue.wvr.c[2987,3000] [2022-12-13 11:07:36,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:07:36,018 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:07:36,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36 WrapperNode [2022-12-13 11:07:36,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:07:36,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:07:36,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:07:36,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:07:36,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (1/1) ... [2022-12-13 11:07:36,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (1/1) ... [2022-12-13 11:07:36,084 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 200 [2022-12-13 11:07:36,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:07:36,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:07:36,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:07:36,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:07:36,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (1/1) ... [2022-12-13 11:07:36,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (1/1) ... [2022-12-13 11:07:36,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (1/1) ... [2022-12-13 11:07:36,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (1/1) ... [2022-12-13 11:07:36,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (1/1) ... [2022-12-13 11:07:36,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (1/1) ... [2022-12-13 11:07:36,118 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (1/1) ... [2022-12-13 11:07:36,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (1/1) ... [2022-12-13 11:07:36,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:07:36,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:07:36,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:07:36,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:07:36,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (1/1) ... [2022-12-13 11:07:36,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:07:36,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:07:36,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:07:36,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:07:36,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:07:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 11:07:36,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 11:07:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 11:07:36,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 11:07:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:07:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:07:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:07:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:07:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:07:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 11:07:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:07:36,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:07:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:07:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:07:36,207 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:07:36,293 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:07:36,294 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:07:36,712 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:07:36,847 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:07:36,848 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 11:07:36,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:07:36 BoogieIcfgContainer [2022-12-13 11:07:36,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:07:36,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:07:36,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:07:36,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:07:36,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:07:35" (1/3) ... [2022-12-13 11:07:36,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c1e824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:07:36, skipping insertion in model container [2022-12-13 11:07:36,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:36" (2/3) ... [2022-12-13 11:07:36,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c1e824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:07:36, skipping insertion in model container [2022-12-13 11:07:36,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:07:36" (3/3) ... [2022-12-13 11:07:36,864 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-12-13 11:07:36,880 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:07:36,881 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 11:07:36,881 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:07:36,955 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 11:07:36,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 163 transitions, 342 flow [2022-12-13 11:07:37,087 INFO L130 PetriNetUnfolder]: 13/161 cut-off events. [2022-12-13 11:07:37,088 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:07:37,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 161 events. 13/161 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-13 11:07:37,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 163 transitions, 342 flow [2022-12-13 11:07:37,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 153 transitions, 318 flow [2022-12-13 11:07:37,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:07:37,125 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-13 11:07:37,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 153 transitions, 318 flow [2022-12-13 11:07:37,189 INFO L130 PetriNetUnfolder]: 13/153 cut-off events. [2022-12-13 11:07:37,189 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:07:37,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 153 events. 13/153 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-13 11:07:37,192 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-13 11:07:37,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 11:07:43,549 INFO L241 LiptonReduction]: Total number of compositions: 134 [2022-12-13 11:07:43,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:07:43,568 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;@53de69a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:07:43,568 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 11:07:43,574 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-13 11:07:43,574 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:07:43,575 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:43,575 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:07:43,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:07:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash -737479510, now seen corresponding path program 1 times [2022-12-13 11:07:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:43,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980135813] [2022-12-13 11:07:43,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:43,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:44,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:44,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980135813] [2022-12-13 11:07:44,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980135813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:44,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:44,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:07:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258512576] [2022-12-13 11:07:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:44,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:07:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:44,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:07:44,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:07:44,094 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 11:07:44,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:44,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:44,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 11:07:44,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:44,169 INFO L130 PetriNetUnfolder]: 81/147 cut-off events. [2022-12-13 11:07:44,170 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 11:07:44,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 81/147 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 424 event pairs, 24 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 240. Up to 88 conditions per place. [2022-12-13 11:07:44,173 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2022-12-13 11:07:44,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2022-12-13 11:07:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:07:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:07:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 11:07:44,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-13 11:07:44,185 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 32 transitions. [2022-12-13 11:07:44,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2022-12-13 11:07:44,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:07:44,190 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2022-12-13 11:07:44,191 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2022-12-13 11:07:44,195 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2022-12-13 11:07:44,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:07:44,196 INFO L89 Accepts]: Start accepts. Operand has 21 places, 21 transitions, 61 flow [2022-12-13 11:07:44,200 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:07:44,200 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:07:44,201 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-13 11:07:44,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 21 transitions, 61 flow [2022-12-13 11:07:44,212 INFO L130 PetriNetUnfolder]: 7/31 cut-off events. [2022-12-13 11:07:44,212 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:07:44,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 31 events. 7/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 22. Up to 8 conditions per place. [2022-12-13 11:07:44,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-13 11:07:44,217 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 11:07:44,230 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:07:44,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 11:07:44,233 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2022-12-13 11:07:44,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:44,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:44,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:07:44,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:07:44,235 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:07:44,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:44,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1426168016, now seen corresponding path program 1 times [2022-12-13 11:07:44,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:44,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467798955] [2022-12-13 11:07:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:44,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:44,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:44,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467798955] [2022-12-13 11:07:44,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467798955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:44,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:44,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:07:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817090189] [2022-12-13 11:07:44,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:44,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:07:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:44,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:07:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:07:44,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 11:07:44,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:44,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:44,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 11:07:44,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:44,502 INFO L130 PetriNetUnfolder]: 77/143 cut-off events. [2022-12-13 11:07:44,502 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 11:07:44,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 143 events. 77/143 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 428 event pairs, 11 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 114. Up to 88 conditions per place. [2022-12-13 11:07:44,503 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 27 selfloop transitions, 7 changer transitions 5/39 dead transitions. [2022-12-13 11:07:44,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 39 transitions, 185 flow [2022-12-13 11:07:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:07:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:07:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-13 11:07:44,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-13 11:07:44,507 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 4 states and 40 transitions. [2022-12-13 11:07:44,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 39 transitions, 185 flow [2022-12-13 11:07:44,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 39 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:07:44,509 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 99 flow [2022-12-13 11:07:44,509 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2022-12-13 11:07:44,509 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2022-12-13 11:07:44,510 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:07:44,510 INFO L89 Accepts]: Start accepts. Operand has 25 places, 25 transitions, 99 flow [2022-12-13 11:07:44,510 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:07:44,511 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:07:44,511 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 25 transitions, 99 flow [2022-12-13 11:07:44,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 99 flow [2022-12-13 11:07:44,517 INFO L130 PetriNetUnfolder]: 14/46 cut-off events. [2022-12-13 11:07:44,517 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-12-13 11:07:44,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 46 events. 14/46 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 113 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 64. Up to 15 conditions per place. [2022-12-13 11:07:44,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 99 flow [2022-12-13 11:07:44,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-13 11:07:44,525 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:07:44,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 11:07:44,526 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 99 flow [2022-12-13 11:07:44,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:44,527 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:44,527 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:07:44,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:07:44,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:07:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:44,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1982189810, now seen corresponding path program 2 times [2022-12-13 11:07:44,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:44,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609281684] [2022-12-13 11:07:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:44,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:44,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609281684] [2022-12-13 11:07:44,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609281684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:44,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:44,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:07:44,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685538393] [2022-12-13 11:07:44,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:44,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:07:44,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:44,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:07:44,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:07:44,606 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 11:07:44,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:44,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:44,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 11:07:44,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:44,724 INFO L130 PetriNetUnfolder]: 88/162 cut-off events. [2022-12-13 11:07:44,724 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-13 11:07:44,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 162 events. 88/162 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 13 based on Foata normal form. 10/170 useless extension candidates. Maximal degree in co-relation 169. Up to 86 conditions per place. [2022-12-13 11:07:44,728 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 32 selfloop transitions, 7 changer transitions 6/45 dead transitions. [2022-12-13 11:07:44,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 45 transitions, 244 flow [2022-12-13 11:07:44,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:07:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:07:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-13 11:07:44,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-13 11:07:44,731 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 99 flow. Second operand 5 states and 45 transitions. [2022-12-13 11:07:44,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 45 transitions, 244 flow [2022-12-13 11:07:44,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 45 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:07:44,734 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 122 flow [2022-12-13 11:07:44,734 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2022-12-13 11:07:44,735 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2022-12-13 11:07:44,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:07:44,735 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 122 flow [2022-12-13 11:07:44,736 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:07:44,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:07:44,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 122 flow [2022-12-13 11:07:44,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 122 flow [2022-12-13 11:07:44,746 INFO L130 PetriNetUnfolder]: 17/53 cut-off events. [2022-12-13 11:07:44,746 INFO L131 PetriNetUnfolder]: For 22/25 co-relation queries the response was YES. [2022-12-13 11:07:44,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 53 events. 17/53 cut-off events. For 22/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 2 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 105. Up to 15 conditions per place. [2022-12-13 11:07:44,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 122 flow [2022-12-13 11:07:44,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 11:07:44,749 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:07:44,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 11:07:44,754 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 122 flow [2022-12-13 11:07:44,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:44,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:44,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:07:44,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:07:44,755 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:07:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash 552214239, now seen corresponding path program 1 times [2022-12-13 11:07:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:44,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675029280] [2022-12-13 11:07:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:44,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:44,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675029280] [2022-12-13 11:07:44,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675029280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:44,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:44,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:07:44,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219324734] [2022-12-13 11:07:44,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:44,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:07:44,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:44,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:07:44,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:07:44,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 11:07:44,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:44,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:44,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 11:07:44,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:44,973 INFO L130 PetriNetUnfolder]: 84/167 cut-off events. [2022-12-13 11:07:44,973 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-12-13 11:07:44,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 167 events. 84/167 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 46 based on Foata normal form. 10/174 useless extension candidates. Maximal degree in co-relation 267. Up to 150 conditions per place. [2022-12-13 11:07:44,974 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 25 selfloop transitions, 2 changer transitions 11/38 dead transitions. [2022-12-13 11:07:44,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 242 flow [2022-12-13 11:07:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:07:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:07:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 11:07:44,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2022-12-13 11:07:44,977 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 122 flow. Second operand 4 states and 33 transitions. [2022-12-13 11:07:44,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 242 flow [2022-12-13 11:07:44,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 229 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 11:07:44,980 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 130 flow [2022-12-13 11:07:44,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-12-13 11:07:44,982 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2022-12-13 11:07:44,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:07:44,982 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 130 flow [2022-12-13 11:07:44,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:07:44,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:07:44,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 130 flow [2022-12-13 11:07:44,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 130 flow [2022-12-13 11:07:44,995 INFO L130 PetriNetUnfolder]: 20/59 cut-off events. [2022-12-13 11:07:44,995 INFO L131 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-12-13 11:07:44,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 59 events. 20/59 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 152 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 132. Up to 17 conditions per place. [2022-12-13 11:07:44,996 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 130 flow [2022-12-13 11:07:44,996 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 11:07:45,343 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:07:45,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 362 [2022-12-13 11:07:45,344 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 126 flow [2022-12-13 11:07:45,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:45,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:45,344 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:07:45,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:07:45,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:07:45,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:45,345 INFO L85 PathProgramCache]: Analyzing trace with hash 67876178, now seen corresponding path program 1 times [2022-12-13 11:07:45,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:45,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865439122] [2022-12-13 11:07:45,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:45,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:45,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:45,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865439122] [2022-12-13 11:07:45,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865439122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:07:45,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151384243] [2022-12-13 11:07:45,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:45,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:07:45,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:07:45,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:07:45,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 11:07:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:45,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 11:07:45,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:07:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:45,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:07:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:45,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151384243] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:07:45,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:07:45,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 11:07:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674357289] [2022-12-13 11:07:45,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:07:45,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:07:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:45,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:07:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:07:45,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 11:07:45,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 126 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:45,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:45,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 11:07:45,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:45,835 INFO L130 PetriNetUnfolder]: 109/207 cut-off events. [2022-12-13 11:07:45,835 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-13 11:07:45,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 207 events. 109/207 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 680 event pairs, 2 based on Foata normal form. 8/214 useless extension candidates. Maximal degree in co-relation 662. Up to 77 conditions per place. [2022-12-13 11:07:45,837 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 47 selfloop transitions, 15 changer transitions 4/66 dead transitions. [2022-12-13 11:07:45,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 66 transitions, 406 flow [2022-12-13 11:07:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:07:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 11:07:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-12-13 11:07:45,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38011695906432746 [2022-12-13 11:07:45,838 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 126 flow. Second operand 9 states and 65 transitions. [2022-12-13 11:07:45,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 66 transitions, 406 flow [2022-12-13 11:07:45,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 66 transitions, 396 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 11:07:45,841 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 218 flow [2022-12-13 11:07:45,841 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-13 11:07:45,842 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2022-12-13 11:07:45,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:07:45,842 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 218 flow [2022-12-13 11:07:45,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:07:45,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:07:45,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 218 flow [2022-12-13 11:07:45,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 218 flow [2022-12-13 11:07:45,851 INFO L130 PetriNetUnfolder]: 19/64 cut-off events. [2022-12-13 11:07:45,851 INFO L131 PetriNetUnfolder]: For 78/79 co-relation queries the response was YES. [2022-12-13 11:07:45,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 64 events. 19/64 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 169 event pairs, 2 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 179. Up to 20 conditions per place. [2022-12-13 11:07:45,852 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 218 flow [2022-12-13 11:07:45,852 INFO L226 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-13 11:07:45,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 11:07:46,100 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (not (< v_~i~0_In_3 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~i~0=v_~i~0_In_3, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_3, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:07:46,187 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:07:46,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 346 [2022-12-13 11:07:46,188 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 224 flow [2022-12-13 11:07:46,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:46,188 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:46,188 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:07:46,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 11:07:46,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:07:46,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:07:46,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:46,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2005601282, now seen corresponding path program 2 times [2022-12-13 11:07:46,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:46,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388736739] [2022-12-13 11:07:46,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:46,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388736739] [2022-12-13 11:07:46,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388736739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:46,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:46,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:07:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110529975] [2022-12-13 11:07:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:46,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:07:46,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:46,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:07:46,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:07:46,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 11:07:46,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:46,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:46,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 11:07:46,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:46,555 INFO L130 PetriNetUnfolder]: 99/176 cut-off events. [2022-12-13 11:07:46,555 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2022-12-13 11:07:46,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 176 events. 99/176 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 498 event pairs, 21 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 465. Up to 150 conditions per place. [2022-12-13 11:07:46,556 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 30 selfloop transitions, 4 changer transitions 3/37 dead transitions. [2022-12-13 11:07:46,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 304 flow [2022-12-13 11:07:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:07:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:07:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-13 11:07:46,558 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-13 11:07:46,559 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 224 flow. Second operand 4 states and 32 transitions. [2022-12-13 11:07:46,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 304 flow [2022-12-13 11:07:46,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 276 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 11:07:46,563 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 183 flow [2022-12-13 11:07:46,563 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-12-13 11:07:46,565 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 20 predicate places. [2022-12-13 11:07:46,566 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:07:46,566 INFO L89 Accepts]: Start accepts. Operand has 42 places, 30 transitions, 183 flow [2022-12-13 11:07:46,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:07:46,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:07:46,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 183 flow [2022-12-13 11:07:46,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 183 flow [2022-12-13 11:07:46,575 INFO L130 PetriNetUnfolder]: 19/52 cut-off events. [2022-12-13 11:07:46,575 INFO L131 PetriNetUnfolder]: For 73/77 co-relation queries the response was YES. [2022-12-13 11:07:46,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 52 events. 19/52 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 119 event pairs, 2 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 148. Up to 16 conditions per place. [2022-12-13 11:07:46,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 183 flow [2022-12-13 11:07:46,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-13 11:07:46,581 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:07:46,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 11:07:46,583 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 183 flow [2022-12-13 11:07:46,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:46,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:46,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:07:46,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:07:46,583 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:07:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash -322819188, now seen corresponding path program 1 times [2022-12-13 11:07:46,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:46,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399752600] [2022-12-13 11:07:46,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:46,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:46,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:46,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399752600] [2022-12-13 11:07:46,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399752600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:46,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:46,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:07:46,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974006267] [2022-12-13 11:07:46,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:46,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:07:46,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:46,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:07:46,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:07:46,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 11:07:46,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:46,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:46,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 11:07:46,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:46,765 INFO L130 PetriNetUnfolder]: 101/185 cut-off events. [2022-12-13 11:07:46,765 INFO L131 PetriNetUnfolder]: For 460/460 co-relation queries the response was YES. [2022-12-13 11:07:46,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 185 events. 101/185 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 502 event pairs, 46 based on Foata normal form. 10/191 useless extension candidates. Maximal degree in co-relation 534. Up to 171 conditions per place. [2022-12-13 11:07:46,767 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 29 selfloop transitions, 2 changer transitions 8/39 dead transitions. [2022-12-13 11:07:46,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 287 flow [2022-12-13 11:07:46,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:07:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:07:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-13 11:07:46,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2022-12-13 11:07:46,768 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 183 flow. Second operand 4 states and 35 transitions. [2022-12-13 11:07:46,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 287 flow [2022-12-13 11:07:46,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 260 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 11:07:46,771 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 179 flow [2022-12-13 11:07:46,771 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-13 11:07:46,771 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 15 predicate places. [2022-12-13 11:07:46,771 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:07:46,771 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 179 flow [2022-12-13 11:07:46,772 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:07:46,772 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:07:46,772 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 179 flow [2022-12-13 11:07:46,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 179 flow [2022-12-13 11:07:46,780 INFO L130 PetriNetUnfolder]: 20/55 cut-off events. [2022-12-13 11:07:46,780 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-13 11:07:46,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 55 events. 20/55 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 1 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 161. Up to 17 conditions per place. [2022-12-13 11:07:46,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 179 flow [2022-12-13 11:07:46,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-13 11:07:47,974 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:07:47,975 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1204 [2022-12-13 11:07:47,975 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 175 flow [2022-12-13 11:07:47,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:47,975 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:47,975 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:07:47,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:07:47,976 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:07:47,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:47,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1180264432, now seen corresponding path program 1 times [2022-12-13 11:07:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:47,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650782280] [2022-12-13 11:07:47,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:47,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:49,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:49,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650782280] [2022-12-13 11:07:49,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650782280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:07:49,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703804219] [2022-12-13 11:07:49,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:49,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:07:49,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:07:49,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:07:49,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 11:07:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:49,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 11:07:49,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:07:49,451 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 16 treesize of output 12 [2022-12-13 11:07:49,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:07:49,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:07:49,481 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:07:49,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-13 11:07:49,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-13 11:07:49,558 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:07:49,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:07:49,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:07:49,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:07:49,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:07:49,982 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 11:07:49,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 17 [2022-12-13 11:07:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:50,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:07:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:50,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703804219] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:07:50,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:07:50,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-12-13 11:07:50,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503986205] [2022-12-13 11:07:50,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:07:50,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 11:07:50,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:50,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 11:07:50,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=542, Unknown=2, NotChecked=0, Total=650 [2022-12-13 11:07:50,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 11:07:50,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 175 flow. Second operand has 26 states, 25 states have (on average 1.76) internal successors, (44), 25 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-13 11:07:50,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:50,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 11:07:50,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:56,432 INFO L130 PetriNetUnfolder]: 290/515 cut-off events. [2022-12-13 11:07:56,433 INFO L131 PetriNetUnfolder]: For 736/736 co-relation queries the response was YES. [2022-12-13 11:07:56,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2006 conditions, 515 events. 290/515 cut-off events. For 736/736 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2072 event pairs, 17 based on Foata normal form. 6/513 useless extension candidates. Maximal degree in co-relation 1988. Up to 166 conditions per place. [2022-12-13 11:07:56,437 INFO L137 encePairwiseOnDemand]: 6/22 looper letters, 82 selfloop transitions, 93 changer transitions 3/178 dead transitions. [2022-12-13 11:07:56,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 178 transitions, 1258 flow [2022-12-13 11:07:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 11:07:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-13 11:07:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 169 transitions. [2022-12-13 11:07:56,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24005681818181818 [2022-12-13 11:07:56,440 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 175 flow. Second operand 32 states and 169 transitions. [2022-12-13 11:07:56,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 178 transitions, 1258 flow [2022-12-13 11:07:56,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 178 transitions, 1230 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 11:07:56,447 INFO L231 Difference]: Finished difference. Result has 72 places, 114 transitions, 954 flow [2022-12-13 11:07:56,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=954, PETRI_PLACES=72, PETRI_TRANSITIONS=114} [2022-12-13 11:07:56,448 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 50 predicate places. [2022-12-13 11:07:56,448 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:07:56,448 INFO L89 Accepts]: Start accepts. Operand has 72 places, 114 transitions, 954 flow [2022-12-13 11:07:56,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:07:56,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:07:56,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 114 transitions, 954 flow [2022-12-13 11:07:56,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 114 transitions, 954 flow [2022-12-13 11:07:56,474 INFO L130 PetriNetUnfolder]: 83/215 cut-off events. [2022-12-13 11:07:56,475 INFO L131 PetriNetUnfolder]: For 395/399 co-relation queries the response was YES. [2022-12-13 11:07:56,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 215 events. 83/215 cut-off events. For 395/399 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 917 event pairs, 2 based on Foata normal form. 2/210 useless extension candidates. Maximal degree in co-relation 837. Up to 74 conditions per place. [2022-12-13 11:07:56,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 114 transitions, 954 flow [2022-12-13 11:07:56,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-13 11:07:56,495 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [704] L65-1-->L52: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (= (ite (= v_~j~0_110 (select (select |v_#memory_int_212| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (not (= (ite (and (<= 0 v_~q2_back~0_120) (< v_~q2_back~0_120 v_~n2~0_87)) 1 0) 0)) (< v_~j~0_110 v_~N~0_73) (= v_~q2_back~0_119 (+ v_~q2_back~0_120 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (ite (= (select (select |v_#memory_int_212| v_~q2~0.base_73) (+ v_~q2~0.offset_73 (* 4 v_~q2_back~0_120))) v_~i~0_119) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (< v_~i~0_119 v_~N~0_73) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0))) InVars {~j~0=v_~j~0_110, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_87, ~i~0=v_~i~0_119, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_73, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_212|, ~q2~0.base=v_~q2~0.base_73, ~N~0=v_~N~0_73, ~q2_back~0=v_~q2_back~0_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_22|, ~j~0=v_~j~0_110, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_87, ~i~0=v_~i~0_119, ~q2~0.offset=v_~q2~0.offset_73, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_73, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, #memory_int=|v_#memory_int_212|, ~q2~0.base=v_~q2~0.base_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_22|, ~q2_back~0=v_~q2_back~0_119} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:07:56,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_234| v_~q1~0.base_103))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_58| 0)) (< v_~j~0_128 v_~N~0_87) (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~q1_back~0_139) (< v_~q1_front~0_125 v_~n1~0_94)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|) (= v_~i~0_133 (+ (select .cse0 (+ v_~q1~0.offset_103 (* v_~q1_front~0_125 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_58| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| 0)) (= (+ v_~q2_back~0_135 1) v_~q2_back~0_134) (not (= (ite (= (select (select |v_#memory_int_234| v_~q2~0.base_84) (+ v_~q2~0.offset_84 (* 4 v_~q2_back~0_135))) v_~i~0_134) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_140 v_~n1~0_94) (<= 0 v_~q1_back~0_140)) 1 0) 0)) (= v_~q1_back~0_139 (+ v_~q1_back~0_140 1)) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|) (= (ite (= v_~j~0_128 (select .cse0 (+ (* v_~q1_back~0_140 4) v_~q1~0.offset_103))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= (ite (and (< v_~q2_back~0_135 v_~n2~0_97) (<= 0 v_~q2_back~0_135)) 1 0) 0)) (< v_~i~0_134 v_~N~0_87))) InVars {~j~0=v_~j~0_128, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_125, ~n2~0=v_~n2~0_97, ~i~0=v_~i~0_134, ~n1~0=v_~n1~0_94, ~q2~0.offset=v_~q2~0.offset_84, ~N~0=v_~N~0_87, ~q1_back~0=v_~q1_back~0_140, ~q1~0.base=v_~q1~0.base_103, #memory_int=|v_#memory_int_234|, ~q2~0.base=v_~q2~0.base_84, ~q2_back~0=v_~q2_back~0_135} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_28|, ~j~0=v_~j~0_128, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_124, ~n2~0=v_~n2~0_97, ~i~0=v_~i~0_133, ~n1~0=v_~n1~0_94, ~q2~0.offset=v_~q2~0.offset_84, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_32|, ~N~0=v_~N~0_87, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_32|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_58|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|, ~q1_back~0=v_~q1_back~0_139, ~q1~0.base=v_~q1~0.base_103, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_43|, #memory_int=|v_#memory_int_234|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60|, ~q2~0.base=v_~q2~0.base_84, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_37|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_28|, ~q2_back~0=v_~q2_back~0_134} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:07:57,084 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:07:57,085 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:07:57,085 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:07:57,085 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:07:57,085 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:07:57,085 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:07:57,085 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:07:57,085 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:07:57,085 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:07:57,085 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:07:57,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:07:57,844 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [712] L65-1-->L52: Formula: (let ((.cse1 (select |v_#memory_int_238| v_~q2~0.base_88)) (.cse2 (* 4 v_~q2_back~0_144)) (.cse3 (select |v_#memory_int_238| v_~q1~0.base_107))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_66|) (< v_~j~0_134 v_~N~0_91) (not (= (ite (let ((.cse0 (+ v_~q2_back~0_144 1))) (and (< .cse0 v_~n2~0_101) (<= 0 .cse0))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_64| 0)) (= (ite (= (select .cse1 (+ v_~q2~0.offset_88 .cse2 4)) v_~i~0_141) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_66|) (< v_~i~0_141 v_~N~0_91) (< v_~i~0_142 v_~N~0_91) (not (= (ite (and (<= 0 v_~q2_back~0_144) (< v_~q2_back~0_144 v_~n2~0_101)) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_147) (< v_~q1_front~0_133 v_~n1~0_98) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_64| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_64|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (not (= (ite (and (< v_~q1_back~0_148 v_~n1~0_98) (<= 0 v_~q1_back~0_148)) 1 0) 0)) (= v_~q1_back~0_147 (+ v_~q1_back~0_148 1)) (= (ite (= v_~j~0_134 (select .cse3 (+ v_~q1~0.offset_107 (* v_~q1_back~0_148 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_64|) (= (+ 2 v_~q2_back~0_144) v_~q2_back~0_142) (not (= (ite (= v_~i~0_142 (select .cse1 (+ v_~q2~0.offset_88 .cse2))) 1 0) 0)) (= v_~i~0_141 (+ (select .cse3 (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_107)) 1)))) InVars {~j~0=v_~j~0_134, ~q1~0.offset=v_~q1~0.offset_107, ~n2~0=v_~n2~0_101, ~q1_front~0=v_~q1_front~0_133, ~i~0=v_~i~0_142, ~q2~0.offset=v_~q2~0.offset_88, ~n1~0=v_~n1~0_98, ~N~0=v_~N~0_91, ~q1_back~0=v_~q1_back~0_148, ~q1~0.base=v_~q1~0.base_107, #memory_int=|v_#memory_int_238|, ~q2~0.base=v_~q2~0.base_88, ~q2_back~0=v_~q2_back~0_144} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_32|, ~j~0=v_~j~0_134, ~q1~0.offset=v_~q1~0.offset_107, ~n2~0=v_~n2~0_101, ~q1_front~0=v_~q1_front~0_132, ~i~0=v_~i~0_141, ~q2~0.offset=v_~q2~0.offset_88, ~n1~0=v_~n1~0_98, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_64|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_36|, ~N~0=v_~N~0_91, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_36|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_66|, ~q1_back~0=v_~q1_back~0_147, ~q1~0.base=v_~q1~0.base_107, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_238|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_47|, ~q2~0.base=v_~q2~0.base_88, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_41|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_32|, ~q2_back~0=v_~q2_back~0_142} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:07:58,138 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:07:58,235 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [704] L65-1-->L52: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (= (ite (= v_~j~0_110 (select (select |v_#memory_int_212| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (not (= (ite (and (<= 0 v_~q2_back~0_120) (< v_~q2_back~0_120 v_~n2~0_87)) 1 0) 0)) (< v_~j~0_110 v_~N~0_73) (= v_~q2_back~0_119 (+ v_~q2_back~0_120 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (ite (= (select (select |v_#memory_int_212| v_~q2~0.base_73) (+ v_~q2~0.offset_73 (* 4 v_~q2_back~0_120))) v_~i~0_119) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (< v_~i~0_119 v_~N~0_73) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0))) InVars {~j~0=v_~j~0_110, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_87, ~i~0=v_~i~0_119, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_73, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_212|, ~q2~0.base=v_~q2~0.base_73, ~N~0=v_~N~0_73, ~q2_back~0=v_~q2_back~0_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_22|, ~j~0=v_~j~0_110, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_87, ~i~0=v_~i~0_119, ~q2~0.offset=v_~q2~0.offset_73, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_73, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, #memory_int=|v_#memory_int_212|, ~q2~0.base=v_~q2~0.base_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_22|, ~q2_back~0=v_~q2_back~0_119} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:07:58,665 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:02,856 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:02,857 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:02,857 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:02,857 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:02,857 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:02,857 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:02,857 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:02,857 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:02,857 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:02,858 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,148 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,148 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,149 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,149 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,149 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,149 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,149 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,149 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,149 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,149 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,430 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [708] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_232| v_~q2~0.base_82))) (and (not (= (ite (and (<= 0 v_~q2_back~0_131) (< v_~q2_back~0_131 v_~n2~0_95)) 1 0) 0)) (not (= (ite (and (<= 0 v_~q1_back~0_136) (< v_~q1_back~0_136 v_~n1~0_92)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_54| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_54|) (= (ite (and (<= 0 v_~q2_front~0_112) (< v_~q2_front~0_112 v_~q2_back~0_130) (< v_~q2_front~0_112 v_~n2~0_95)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_54|) (= (+ v_~q1_back~0_136 1) v_~q1_back~0_135) (not (= 0 (ite (= v_~j~0_125 (select (select |v_#memory_int_232| v_~q1~0.base_101) (+ v_~q1~0.offset_101 (* v_~q1_back~0_136 4)))) 1 0))) (= v_~j~0_124 (+ (select .cse0 (+ v_~q2~0.offset_82 (* v_~q2_front~0_112 4))) 1)) (< v_~j~0_125 v_~N~0_85) (< v_~i~0_131 v_~N~0_85) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_54| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= v_~q2_front~0_111 (+ v_~q2_front~0_112 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| 0)) (= (ite (= (select .cse0 (+ v_~q2~0.offset_82 (* 4 v_~q2_back~0_131))) v_~i~0_131) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= v_~q2_back~0_130 (+ v_~q2_back~0_131 1)))) InVars {~j~0=v_~j~0_125, ~q1~0.offset=v_~q1~0.offset_101, ~n2~0=v_~n2~0_95, ~i~0=v_~i~0_131, ~q2~0.offset=v_~q2~0.offset_82, ~n1~0=v_~n1~0_92, ~q2_front~0=v_~q2_front~0_112, ~N~0=v_~N~0_85, ~q1_back~0=v_~q1_back~0_136, ~q1~0.base=v_~q1~0.base_101, #memory_int=|v_#memory_int_232|, ~q2~0.base=v_~q2~0.base_82, ~q2_back~0=v_~q2_back~0_131} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_26|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_35|, ~j~0=v_~j~0_124, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_29|, ~q1~0.offset=v_~q1~0.offset_101, ~n2~0=v_~n2~0_95, ~i~0=v_~i~0_131, ~q2~0.offset=v_~q2~0.offset_82, ~n1~0=v_~n1~0_92, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_54|, ~q2_front~0=v_~q2_front~0_111, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_30|, ~N~0=v_~N~0_85, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_30|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_29|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_54|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|, ~q1_back~0=v_~q1_back~0_135, ~q1~0.base=v_~q1~0.base_101, #memory_int=|v_#memory_int_232|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58|, ~q2~0.base=v_~q2~0.base_82, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_26|, ~q2_back~0=v_~q2_back~0_130} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:03,618 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,618 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,618 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,618 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,618 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,619 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,619 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,619 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,619 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:03,619 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:04,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [704] L65-1-->L52: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (= (ite (= v_~j~0_110 (select (select |v_#memory_int_212| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (not (= (ite (and (<= 0 v_~q2_back~0_120) (< v_~q2_back~0_120 v_~n2~0_87)) 1 0) 0)) (< v_~j~0_110 v_~N~0_73) (= v_~q2_back~0_119 (+ v_~q2_back~0_120 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (ite (= (select (select |v_#memory_int_212| v_~q2~0.base_73) (+ v_~q2~0.offset_73 (* 4 v_~q2_back~0_120))) v_~i~0_119) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (< v_~i~0_119 v_~N~0_73) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0))) InVars {~j~0=v_~j~0_110, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_87, ~i~0=v_~i~0_119, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_73, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_212|, ~q2~0.base=v_~q2~0.base_73, ~N~0=v_~N~0_73, ~q2_back~0=v_~q2_back~0_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_22|, ~j~0=v_~j~0_110, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_87, ~i~0=v_~i~0_119, ~q2~0.offset=v_~q2~0.offset_73, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_73, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, #memory_int=|v_#memory_int_212|, ~q2~0.base=v_~q2~0.base_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_22|, ~q2_back~0=v_~q2_back~0_119} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:08:07,666 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:07,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [713] L65-1-->L65-1: Formula: (and (not (= (ite (= v_~j~0_137 (select (select |v_#memory_int_240| v_~q1~0.base_109) (+ (* v_~q1_back~0_152 4) v_~q1~0.offset_109))) 1 0) 0)) (= (+ v_~q2_front~0_120 1) v_~q2_front~0_119) (< v_~j~0_137 v_~N~0_93) (not (= (ite (and (<= 0 v_~q1_back~0_152) (< v_~q1_back~0_152 v_~n1~0_100)) 1 0) 0)) (= v_~j~0_136 (+ (select (select |v_#memory_int_240| v_~q2~0.base_90) (+ v_~q2~0.offset_90 (* v_~q2_front~0_120 4))) 1)) (= v_~q1_back~0_151 (+ v_~q1_back~0_152 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_66| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|) (= (ite (and (< v_~q2_front~0_120 v_~q2_back~0_148) (<= 0 v_~q2_front~0_120) (< v_~q2_front~0_120 v_~n2~0_103)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_66| 0))) InVars {~j~0=v_~j~0_137, ~q1~0.offset=v_~q1~0.offset_109, ~n2~0=v_~n2~0_103, ~q1_back~0=v_~q1_back~0_152, ~q2~0.offset=v_~q2~0.offset_90, ~n1~0=v_~n1~0_100, ~q1~0.base=v_~q1~0.base_109, #memory_int=|v_#memory_int_240|, ~q2_front~0=v_~q2_front~0_120, ~q2~0.base=v_~q2~0.base_90, ~N~0=v_~N~0_93, ~q2_back~0=v_~q2_back~0_148} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_39|, ~j~0=v_~j~0_136, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_33|, ~q1~0.offset=v_~q1~0.offset_109, ~n2~0=v_~n2~0_103, ~q2~0.offset=v_~q2~0.offset_90, ~n1~0=v_~n1~0_100, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|, ~q2_front~0=v_~q2_front~0_119, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_38|, ~N~0=v_~N~0_93, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_38|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_66|, ~q1_back~0=v_~q1_back~0_151, ~q1~0.base=v_~q1~0.base_109, #memory_int=|v_#memory_int_240|, ~q2~0.base=v_~q2~0.base_90, ~q2_back~0=v_~q2_back~0_148} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:08:08,040 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [714] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_242| v_~q1~0.base_111))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| 0)) (< v_~j~0_140 v_~N~0_95) (not (= (ite (and (< v_~q1_back~0_156 v_~n1~0_102) (<= 0 v_~q1_back~0_156)) 1 0) 0)) (= (+ v_~q1_front~0_137 1) v_~q1_front~0_136) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (= (ite (and (< v_~q1_front~0_137 v_~q1_back~0_155) (< v_~q1_front~0_137 v_~n1~0_102) (<= 0 v_~q1_front~0_137)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70| 0)) (= (ite (= v_~j~0_140 (select .cse0 (+ v_~q1~0.offset_111 (* v_~q1_back~0_156 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|) (= (+ v_~q1_back~0_156 1) v_~q1_back~0_155) (= (+ (select .cse0 (+ v_~q1~0.offset_111 (* v_~q1_front~0_137 4))) 1) v_~i~0_145))) InVars {~j~0=v_~j~0_140, ~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_137, ~q1_back~0=v_~q1_back~0_156, ~n1~0=v_~n1~0_102, ~q1~0.base=v_~q1~0.base_111, #memory_int=|v_#memory_int_242|, ~N~0=v_~N~0_95} OutVars{~j~0=v_~j~0_140, ~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_136, ~i~0=v_~i~0_145, ~n1~0=v_~n1~0_102, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_43|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_40|, ~N~0=v_~N~0_95, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_40|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, ~q1_back~0=v_~q1_back~0_155, ~q1~0.base=v_~q1~0.base_111, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_49|, #memory_int=|v_#memory_int_242|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 11:08:08,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 11:08:08,260 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (not (< v_~i~0_In_3 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~i~0=v_~i~0_In_3, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_3, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [733] L70-->L70: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| (ite (= v_~j~0_184 (select (select |v_#memory_int_290| v_~q1~0.base_145) (+ (* v_~q1_back~0_212 4) v_~q1~0.offset_145))) 1 0)) (= v_~j~0_184 (+ (select (select |v_#memory_int_290| v_~q2~0.base_116) (+ v_~q2~0.offset_116 (* v_~q2_front~0_158 4))) 1)) (< v_~j~0_184 v_~N~0_123) (= (+ v_~q1_back~0_212 1) v_~q1_back~0_211) (= (+ v_~q2_front~0_158 1) v_~q2_front~0_157) (not (= (ite (and (<= 0 v_~q2_front~0_158) (< v_~q2_front~0_158 v_~q2_back~0_188) (< v_~q2_front~0_158 v_~n2~0_131)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|) (not (= (ite (and (< v_~q1_back~0_212 v_~n1~0_130) (<= 0 v_~q1_back~0_212)) 1 0) 0))) InVars {~q1~0.offset=v_~q1~0.offset_145, ~n2~0=v_~n2~0_131, ~q1_back~0=v_~q1_back~0_212, ~n1~0=v_~n1~0_130, ~q2~0.offset=v_~q2~0.offset_116, ~q1~0.base=v_~q1~0.base_145, #memory_int=|v_#memory_int_290|, ~q2_front~0=v_~q2_front~0_158, ~q2~0.base=v_~q2~0.base_116, ~N~0=v_~N~0_123, ~q2_back~0=v_~q2_back~0_188} OutVars{~j~0=v_~j~0_184, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_57|, ~q1~0.offset=v_~q1~0.offset_145, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_51|, ~n2~0=v_~n2~0_131, ~n1~0=v_~n1~0_130, ~q2~0.offset=v_~q2~0.offset_116, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_68|, ~q2_front~0=v_~q2_front~0_157, ~N~0=v_~N~0_123, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_68|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_51|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|, ~q1_back~0=v_~q1_back~0_211, ~q1~0.base=v_~q1~0.base_145, #memory_int=|v_#memory_int_290|, ~q2~0.base=v_~q2~0.base_116, ~q2_back~0=v_~q2_back~0_188} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:08:08,415 INFO L241 LiptonReduction]: Total number of compositions: 16 [2022-12-13 11:08:08,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11967 [2022-12-13 11:08:08,416 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 106 transitions, 1026 flow [2022-12-13 11:08:08,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.76) internal successors, (44), 25 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-13 11:08:08,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:08:08,416 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:08:08,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 11:08:08,616 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,SelfDestructingSolverStorable7 [2022-12-13 11:08:08,617 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:08:08,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:08:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash -314194077, now seen corresponding path program 1 times [2022-12-13 11:08:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:08:08,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282440576] [2022-12-13 11:08:08,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:08,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:08:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:09,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:08:09,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282440576] [2022-12-13 11:08:09,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282440576] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:08:09,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734385462] [2022-12-13 11:08:09,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:09,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:08:09,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:08:09,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:08:09,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 11:08:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:09,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 11:08:09,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:08:10,003 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 11:08:10,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 20 [2022-12-13 11:08:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:10,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:08:10,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:08:10,146 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 126 [2022-12-13 11:08:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:10,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734385462] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:08:10,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:08:10,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2022-12-13 11:08:10,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281377177] [2022-12-13 11:08:10,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:08:10,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:08:10,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:08:10,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:08:10,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:08:10,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 11:08:10,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 106 transitions, 1026 flow. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:10,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:08:10,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 11:08:10,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:08:12,601 INFO L130 PetriNetUnfolder]: 405/736 cut-off events. [2022-12-13 11:08:12,601 INFO L131 PetriNetUnfolder]: For 2220/2220 co-relation queries the response was YES. [2022-12-13 11:08:12,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 736 events. 405/736 cut-off events. For 2220/2220 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3593 event pairs, 28 based on Foata normal form. 23/746 useless extension candidates. Maximal degree in co-relation 3467. Up to 278 conditions per place. [2022-12-13 11:08:12,607 INFO L137 encePairwiseOnDemand]: 17/49 looper letters, 98 selfloop transitions, 92 changer transitions 9/199 dead transitions. [2022-12-13 11:08:12,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 199 transitions, 1954 flow [2022-12-13 11:08:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:08:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 11:08:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 152 transitions. [2022-12-13 11:08:12,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14100185528756956 [2022-12-13 11:08:12,609 INFO L175 Difference]: Start difference. First operand has 64 places, 106 transitions, 1026 flow. Second operand 22 states and 152 transitions. [2022-12-13 11:08:12,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 199 transitions, 1954 flow [2022-12-13 11:08:12,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 199 transitions, 1708 flow, removed 123 selfloop flow, removed 4 redundant places. [2022-12-13 11:08:12,636 INFO L231 Difference]: Finished difference. Result has 84 places, 133 transitions, 1274 flow [2022-12-13 11:08:12,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1274, PETRI_PLACES=84, PETRI_TRANSITIONS=133} [2022-12-13 11:08:12,637 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 62 predicate places. [2022-12-13 11:08:12,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:08:12,637 INFO L89 Accepts]: Start accepts. Operand has 84 places, 133 transitions, 1274 flow [2022-12-13 11:08:12,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:08:12,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:08:12,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 133 transitions, 1274 flow [2022-12-13 11:08:12,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 133 transitions, 1274 flow [2022-12-13 11:08:12,672 INFO L130 PetriNetUnfolder]: 100/276 cut-off events. [2022-12-13 11:08:12,673 INFO L131 PetriNetUnfolder]: For 572/573 co-relation queries the response was YES. [2022-12-13 11:08:12,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 276 events. 100/276 cut-off events. For 572/573 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1482 event pairs, 4 based on Foata normal form. 1/268 useless extension candidates. Maximal degree in co-relation 1021. Up to 71 conditions per place. [2022-12-13 11:08:12,676 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 133 transitions, 1274 flow [2022-12-13 11:08:12,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-13 11:08:12,688 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:12,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [743] L47-1-->L97-3: Formula: (and (= (+ v_~q2_back~0_217 1) v_~q2_back~0_216) (= |v_#pthreadsForks_61| (+ |v_#pthreadsForks_62| 1)) (= (ite (= (select (select |v_#memory_int_319| v_~q2~0.base_136) (+ v_~q2~0.offset_136 (* 4 v_~q2_back~0_217))) v_~i~0_205) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|) (= (store |v_#memory_int_319| |v_ULTIMATE.start_main_~#t2~0#1.base_53| (store (select |v_#memory_int_319| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) |v_ULTIMATE.start_main_~#t2~0#1.offset_53| |v_ULTIMATE.start_main_#t~pre20#1_57|)) |v_#memory_int_318|) (not (= (ite (and (< v_~q2_back~0_217 v_~n2~0_149) (<= 0 v_~q2_back~0_217)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|) (< v_~i~0_205 v_~N~0_143) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118| 0)) (= |v_#pthreadsForks_62| |v_ULTIMATE.start_main_#t~pre20#1_57|)) InVars {#pthreadsForks=|v_#pthreadsForks_62|, ~n2~0=v_~n2~0_149, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_53|, ~i~0=v_~i~0_205, ~q2~0.offset=v_~q2~0.offset_136, #memory_int=|v_#memory_int_319|, ~q2~0.base=v_~q2~0.base_136, ~N~0=v_~N~0_143, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ~q2_back~0=v_~q2_back~0_217} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_59|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_62|, ~n2~0=v_~n2~0_149, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_53|, ~i~0=v_~i~0_205, ~q2~0.offset=v_~q2~0.offset_136, ~N~0=v_~N~0_143, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_57|, #pthreadsForks=|v_#pthreadsForks_61|, #memory_int=|v_#memory_int_318|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|, ~q2~0.base=v_~q2~0.base_136, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_41|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_62|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ~q2_back~0=v_~q2_back~0_216} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:12,963 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:12,963 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:12,963 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:12,963 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:12,963 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:12,963 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:12,963 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:12,964 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:12,964 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:12,964 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:13,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [741] L47-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_314| v_~q2~0.base_132))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120| (ite (and (<= 0 v_~q2_front~0_174) (< v_~q2_front~0_174 v_~n2~0_145) (< v_~q2_front~0_174 v_~q2_back~0_208)) 1 0)) (< v_~i~0_199 v_~N~0_139) (not (= (ite (and (< v_~q1_back~0_238 v_~n1~0_146) (<= 0 v_~q1_back~0_238)) 1 0) 0)) (not (= (ite (and (<= 0 v_~q2_back~0_209) (< v_~q2_back~0_209 v_~n2~0_145)) 1 0) 0)) (= (+ v_~q1_back~0_238 1) v_~q1_back~0_237) (= (+ v_~q2_back~0_209 1) v_~q2_back~0_208) (not (= (ite (= v_~j~0_203 (select (select |v_#memory_int_314| v_~q1~0.base_161) (+ v_~q1~0.offset_161 (* v_~q1_back~0_238 4)))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_120|) (= (ite (= (select .cse0 (+ v_~q2~0.offset_132 (* 4 v_~q2_back~0_209))) v_~i~0_199) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112| 0)) (< v_~j~0_203 v_~N~0_139) (= v_~j~0_202 (+ (select .cse0 (+ v_~q2~0.offset_132 (* v_~q2_front~0_174 4))) 1)) (= v_~q2_front~0_173 (+ v_~q2_front~0_174 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_120| 0)))) InVars {~j~0=v_~j~0_203, ~q1~0.offset=v_~q1~0.offset_161, ~n2~0=v_~n2~0_145, ~i~0=v_~i~0_199, ~q2~0.offset=v_~q2~0.offset_132, ~n1~0=v_~n1~0_146, ~q2_front~0=v_~q2_front~0_174, ~N~0=v_~N~0_139, ~q1_back~0=v_~q1_back~0_238, ~q1~0.base=v_~q1~0.base_161, #memory_int=|v_#memory_int_314|, ~q2~0.base=v_~q2~0.base_132, ~q2_back~0=v_~q2_back~0_209} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_58|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_63|, ~j~0=v_~j~0_202, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_57|, ~q1~0.offset=v_~q1~0.offset_161, ~n2~0=v_~n2~0_145, ~i~0=v_~i~0_199, ~q2~0.offset=v_~q2~0.offset_132, ~n1~0=v_~n1~0_146, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120|, ~q2_front~0=v_~q2_front~0_173, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_78|, ~N~0=v_~N~0_139, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_78|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_120|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112|, ~q1_back~0=v_~q1_back~0_237, ~q1~0.base=v_~q1~0.base_161, #memory_int=|v_#memory_int_314|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112|, ~q2~0.base=v_~q2~0.base_132, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_58|, ~q2_back~0=v_~q2_back~0_208} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:13,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:13,625 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:08:13,815 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [751] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_337| v_~q1~0.base_177))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (= v_~j~0_226 (select .cse0 (+ (* v_~q1_back~0_271 4) v_~q1~0.offset_177))) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (= (+ v_~q1_front~0_208 1) v_~q1_front~0_207) (= (+ (select .cse0 (+ v_~q1~0.offset_177 (* v_~q1_front~0_208 4))) 1) v_~i~0_223) (= (+ v_~q1_back~0_271 1) v_~q1_back~0_270) (not (= (ite (and (<= 0 v_~q1_back~0_271) (< v_~q1_back~0_271 v_~n1~0_162)) 1 0) 0)) (= (ite (and (< v_~q1_front~0_208 v_~q1_back~0_270) (< v_~q1_front~0_208 v_~n1~0_162) (<= 0 v_~q1_front~0_208)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (< v_~j~0_226 v_~N~0_157))) InVars {~j~0=v_~j~0_226, ~q1~0.offset=v_~q1~0.offset_177, ~q1_front~0=v_~q1_front~0_208, ~q1_back~0=v_~q1_back~0_271, ~n1~0=v_~n1~0_162, ~q1~0.base=v_~q1~0.base_177, #memory_int=|v_#memory_int_337|, ~N~0=v_~N~0_157} OutVars{~j~0=v_~j~0_226, ~q1~0.offset=v_~q1~0.offset_177, ~q1_front~0=v_~q1_front~0_207, ~i~0=v_~i~0_223, ~n1~0=v_~n1~0_162, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_77|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_96|, ~N~0=v_~N~0_157, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_96|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|, ~q1_back~0=v_~q1_back~0_270, ~q1~0.base=v_~q1~0.base_177, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_83|, #memory_int=|v_#memory_int_337|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_77|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 11:08:14,034 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [752] L65-1-->L65-1: Formula: (and (= (+ v_~q2_front~0_195 1) v_~q2_front~0_194) (< v_~j~0_229 v_~N~0_159) (not (= (ite (and (< v_~q1_back~0_275 v_~n1~0_164) (<= 0 v_~q1_back~0_275)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_142|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_142| 0)) (not (= (ite (= v_~j~0_229 (select (select |v_#memory_int_339| v_~q1~0.base_179) (+ v_~q1~0.offset_179 (* v_~q1_back~0_275 4)))) 1 0) 0)) (= (+ v_~q1_back~0_275 1) v_~q1_back~0_274) (= v_~j~0_228 (+ (select (select |v_#memory_int_339| v_~q2~0.base_148) (+ v_~q2~0.offset_148 (* v_~q2_front~0_195 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| (ite (and (< v_~q2_front~0_195 v_~n2~0_161) (<= 0 v_~q2_front~0_195) (< v_~q2_front~0_195 v_~q2_back~0_238)) 1 0))) InVars {~j~0=v_~j~0_229, ~q1~0.offset=v_~q1~0.offset_179, ~n2~0=v_~n2~0_161, ~q1_back~0=v_~q1_back~0_275, ~q2~0.offset=v_~q2~0.offset_148, ~n1~0=v_~n1~0_164, ~q1~0.base=v_~q1~0.base_179, #memory_int=|v_#memory_int_339|, ~q2_front~0=v_~q2_front~0_195, ~q2~0.base=v_~q2~0.base_148, ~N~0=v_~N~0_159, ~q2_back~0=v_~q2_back~0_238} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_75|, ~j~0=v_~j~0_228, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_69|, ~q1~0.offset=v_~q1~0.offset_179, ~n2~0=v_~n2~0_161, ~q2~0.offset=v_~q2~0.offset_148, ~n1~0=v_~n1~0_164, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142|, ~q2_front~0=v_~q2_front~0_194, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_98|, ~N~0=v_~N~0_159, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_98|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_142|, ~q1_back~0=v_~q1_back~0_274, ~q1~0.base=v_~q1~0.base_179, #memory_int=|v_#memory_int_339|, ~q2~0.base=v_~q2~0.base_148, ~q2_back~0=v_~q2_back~0_238} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:08:14,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L47-1-->L70: Formula: (let ((.cse1 (select |v_#memory_int_333| v_~q2~0.base_144)) (.cse0 (select |v_#memory_int_333| v_~q1~0.base_173))) (and (not (= (ite (= v_~j~0_219 (select .cse0 (+ v_~q1~0.offset_173 (* v_~q1_back~0_262 4)))) 1 0) 0)) (= (+ v_~q2_front~0_187 1) v_~q2_front~0_186) (not (= (ite (and (<= 0 v_~q1_back~0_262) (< v_~q1_back~0_262 v_~n1~0_158)) 1 0) 0)) (= v_~j~0_218 (+ (select .cse1 (+ v_~q2~0.offset_144 (* v_~q2_front~0_187 4))) 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128| 0)) (= (+ v_~q2_back~0_231 1) v_~q2_back~0_230) (not (= (ite (and (< v_~q2_front~0_187 v_~n2~0_157) (<= 0 v_~q2_front~0_187) (< v_~q2_front~0_187 v_~q2_back~0_230)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_128| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128|) (= (+ 2 v_~q1_back~0_262) v_~q1_back~0_260) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_134| 0)) (< v_~i~0_217 v_~N~0_153) (< v_~j~0_219 v_~N~0_153) (not (= (ite (and (< v_~q1_back~0_260 (+ v_~n1~0_158 1)) (<= 1 v_~q1_back~0_260)) 1 0) 0)) (< v_~j~0_218 v_~N~0_153) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_134| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_134|) (= (ite (= (select .cse1 (+ (* 4 v_~q2_back~0_231) v_~q2~0.offset_144)) v_~i~0_217) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_128|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_134| (ite (= v_~j~0_218 (select .cse0 (+ v_~q1~0.offset_173 (* v_~q1_back~0_260 4) (- 4)))) 1 0)) (not (= (ite (and (< v_~q2_back~0_231 v_~n2~0_157) (<= 0 v_~q2_back~0_231)) 1 0) 0)))) InVars {~j~0=v_~j~0_219, ~q1~0.offset=v_~q1~0.offset_173, ~n2~0=v_~n2~0_157, ~i~0=v_~i~0_217, ~n1~0=v_~n1~0_158, ~q2~0.offset=v_~q2~0.offset_144, ~q2_front~0=v_~q2_front~0_187, ~N~0=v_~N~0_153, ~q1_back~0=v_~q1_back~0_262, ~q1~0.base=v_~q1~0.base_173, #memory_int=|v_#memory_int_333|, ~q2~0.base=v_~q2~0.base_144, ~q2_back~0=v_~q2_back~0_231} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, ~j~0=v_~j~0_218, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_71|, ~q1~0.offset=v_~q1~0.offset_173, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_65|, ~n2~0=v_~n2~0_157, ~i~0=v_~i~0_217, ~n1~0=v_~n1~0_158, ~q2~0.offset=v_~q2~0.offset_144, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_134|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_90|, ~q2_front~0=v_~q2_front~0_186, ~N~0=v_~N~0_153, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_90|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_134|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_128|, ~q1_back~0=v_~q1_back~0_260, ~q1~0.base=v_~q1~0.base_173, #memory_int=|v_#memory_int_333|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128|, ~q2~0.base=v_~q2~0.base_144, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_68|, ~q2_back~0=v_~q2_back~0_230} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:14,773 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 11:08:14,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2137 [2022-12-13 11:08:14,774 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 129 transitions, 1291 flow [2022-12-13 11:08:14,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:14,775 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:08:14,775 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:08:14,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 11:08:14,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:08:14,982 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:08:14,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:08:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash -969893987, now seen corresponding path program 1 times [2022-12-13 11:08:14,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:08:14,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575630157] [2022-12-13 11:08:14,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:14,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:08:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:08:15,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575630157] [2022-12-13 11:08:15,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575630157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:08:15,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:08:15,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:08:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005601462] [2022-12-13 11:08:15,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:08:15,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:08:15,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:08:15,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:08:15,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:08:15,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 11:08:15,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 129 transitions, 1291 flow. Second operand has 3 states, 3 states have (on average 4.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-13 11:08:15,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:08:15,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 11:08:15,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:08:15,328 INFO L130 PetriNetUnfolder]: 587/1042 cut-off events. [2022-12-13 11:08:15,328 INFO L131 PetriNetUnfolder]: For 3212/3212 co-relation queries the response was YES. [2022-12-13 11:08:15,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 1042 events. 587/1042 cut-off events. For 3212/3212 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5273 event pairs, 222 based on Foata normal form. 2/1033 useless extension candidates. Maximal degree in co-relation 4618. Up to 684 conditions per place. [2022-12-13 11:08:15,337 INFO L137 encePairwiseOnDemand]: 46/51 looper letters, 192 selfloop transitions, 2 changer transitions 2/196 dead transitions. [2022-12-13 11:08:15,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 196 transitions, 2277 flow [2022-12-13 11:08:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:08:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:08:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 11:08:15,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2022-12-13 11:08:15,339 INFO L175 Difference]: Start difference. First operand has 73 places, 129 transitions, 1291 flow. Second operand 3 states and 75 transitions. [2022-12-13 11:08:15,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 196 transitions, 2277 flow [2022-12-13 11:08:15,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 196 transitions, 2144 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-12-13 11:08:15,360 INFO L231 Difference]: Finished difference. Result has 71 places, 122 transitions, 1098 flow [2022-12-13 11:08:15,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1098, PETRI_PLACES=71, PETRI_TRANSITIONS=122} [2022-12-13 11:08:15,362 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 49 predicate places. [2022-12-13 11:08:15,362 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:08:15,362 INFO L89 Accepts]: Start accepts. Operand has 71 places, 122 transitions, 1098 flow [2022-12-13 11:08:15,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:08:15,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:08:15,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 122 transitions, 1098 flow [2022-12-13 11:08:15,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 122 transitions, 1098 flow [2022-12-13 11:08:15,404 INFO L130 PetriNetUnfolder]: 151/410 cut-off events. [2022-12-13 11:08:15,404 INFO L131 PetriNetUnfolder]: For 640/641 co-relation queries the response was YES. [2022-12-13 11:08:15,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1647 conditions, 410 events. 151/410 cut-off events. For 640/641 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2445 event pairs, 6 based on Foata normal form. 1/401 useless extension candidates. Maximal degree in co-relation 1612. Up to 124 conditions per place. [2022-12-13 11:08:15,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 122 transitions, 1098 flow [2022-12-13 11:08:15,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-13 11:08:15,409 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:08:15,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 11:08:15,409 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 122 transitions, 1098 flow [2022-12-13 11:08:15,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.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-13 11:08:15,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:08:15,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:08:15,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:08:15,410 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:08:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:08:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash 871674675, now seen corresponding path program 1 times [2022-12-13 11:08:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:08:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923409177] [2022-12-13 11:08:15,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:15,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:08:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:08:16,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923409177] [2022-12-13 11:08:16,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923409177] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:08:16,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261334404] [2022-12-13 11:08:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:16,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:08:16,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:08:16,082 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:08:16,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 11:08:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:16,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 11:08:16,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:08:16,266 INFO L321 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2022-12-13 11:08:16,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 43 [2022-12-13 11:08:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:16,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:08:16,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:08:16,441 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 121 [2022-12-13 11:08:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:16,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261334404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:08:16,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:08:16,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 11:08:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111421307] [2022-12-13 11:08:16,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:08:16,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:08:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:08:16,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:08:16,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:08:16,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 11:08:16,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 122 transitions, 1098 flow. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:16,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:08:16,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 11:08:16,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:08:17,929 INFO L130 PetriNetUnfolder]: 626/1106 cut-off events. [2022-12-13 11:08:17,930 INFO L131 PetriNetUnfolder]: For 2598/2598 co-relation queries the response was YES. [2022-12-13 11:08:17,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5335 conditions, 1106 events. 626/1106 cut-off events. For 2598/2598 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5749 event pairs, 22 based on Foata normal form. 16/1112 useless extension candidates. Maximal degree in co-relation 5070. Up to 524 conditions per place. [2022-12-13 11:08:17,939 INFO L137 encePairwiseOnDemand]: 15/47 looper letters, 75 selfloop transitions, 112 changer transitions 8/195 dead transitions. [2022-12-13 11:08:17,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 195 transitions, 1952 flow [2022-12-13 11:08:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:08:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 11:08:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 127 transitions. [2022-12-13 11:08:17,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15894868585732166 [2022-12-13 11:08:17,942 INFO L175 Difference]: Start difference. First operand has 69 places, 122 transitions, 1098 flow. Second operand 17 states and 127 transitions. [2022-12-13 11:08:17,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 195 transitions, 1952 flow [2022-12-13 11:08:17,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 195 transitions, 1946 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 11:08:17,962 INFO L231 Difference]: Finished difference. Result has 89 places, 150 transitions, 1702 flow [2022-12-13 11:08:17,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1702, PETRI_PLACES=89, PETRI_TRANSITIONS=150} [2022-12-13 11:08:17,963 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 67 predicate places. [2022-12-13 11:08:17,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:08:17,963 INFO L89 Accepts]: Start accepts. Operand has 89 places, 150 transitions, 1702 flow [2022-12-13 11:08:17,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:08:17,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:08:17,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 150 transitions, 1702 flow [2022-12-13 11:08:17,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 150 transitions, 1702 flow [2022-12-13 11:08:18,013 INFO L130 PetriNetUnfolder]: 165/418 cut-off events. [2022-12-13 11:08:18,013 INFO L131 PetriNetUnfolder]: For 1240/1245 co-relation queries the response was YES. [2022-12-13 11:08:18,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2195 conditions, 418 events. 165/418 cut-off events. For 1240/1245 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2398 event pairs, 3 based on Foata normal form. 1/409 useless extension candidates. Maximal degree in co-relation 2142. Up to 150 conditions per place. [2022-12-13 11:08:18,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 150 transitions, 1702 flow [2022-12-13 11:08:18,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-13 11:08:18,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:18,108 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:08:18,109 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 11:08:18,109 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 149 transitions, 1700 flow [2022-12-13 11:08:18,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:18,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:08:18,109 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:08:18,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 11:08:18,310 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-13 11:08:18,310 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:08:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:08:18,310 INFO L85 PathProgramCache]: Analyzing trace with hash 399573538, now seen corresponding path program 1 times [2022-12-13 11:08:18,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:08:18,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895025540] [2022-12-13 11:08:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:18,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:08:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:18,380 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-13 11:08:18,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:08:18,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895025540] [2022-12-13 11:08:18,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895025540] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:08:18,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436357245] [2022-12-13 11:08:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:18,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:08:18,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:08:18,382 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:08:18,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 11:08:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:18,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 11:08:18,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:08:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:18,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:08:18,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436357245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:08:18,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:08:18,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 11:08:18,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278370517] [2022-12-13 11:08:18,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:08:18,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:08:18,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:08:18,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:08:18,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:08:18,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 11:08:18,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 149 transitions, 1700 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:18,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:08:18,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 11:08:18,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:08:18,728 INFO L130 PetriNetUnfolder]: 400/744 cut-off events. [2022-12-13 11:08:18,728 INFO L131 PetriNetUnfolder]: For 3973/3973 co-relation queries the response was YES. [2022-12-13 11:08:18,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4232 conditions, 744 events. 400/744 cut-off events. For 3973/3973 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3668 event pairs, 103 based on Foata normal form. 64/799 useless extension candidates. Maximal degree in co-relation 4176. Up to 386 conditions per place. [2022-12-13 11:08:18,734 INFO L137 encePairwiseOnDemand]: 27/47 looper letters, 147 selfloop transitions, 15 changer transitions 10/172 dead transitions. [2022-12-13 11:08:18,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 172 transitions, 2157 flow [2022-12-13 11:08:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:08:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:08:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 11:08:18,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3776595744680851 [2022-12-13 11:08:18,735 INFO L175 Difference]: Start difference. First operand has 87 places, 149 transitions, 1700 flow. Second operand 4 states and 71 transitions. [2022-12-13 11:08:18,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 172 transitions, 2157 flow [2022-12-13 11:08:18,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 172 transitions, 1991 flow, removed 17 selfloop flow, removed 10 redundant places. [2022-12-13 11:08:18,759 INFO L231 Difference]: Finished difference. Result has 78 places, 120 transitions, 1291 flow [2022-12-13 11:08:18,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1291, PETRI_PLACES=78, PETRI_TRANSITIONS=120} [2022-12-13 11:08:18,760 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 56 predicate places. [2022-12-13 11:08:18,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:08:18,760 INFO L89 Accepts]: Start accepts. Operand has 78 places, 120 transitions, 1291 flow [2022-12-13 11:08:18,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:08:18,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:08:18,762 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 120 transitions, 1291 flow [2022-12-13 11:08:18,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 120 transitions, 1291 flow [2022-12-13 11:08:18,794 INFO L130 PetriNetUnfolder]: 98/277 cut-off events. [2022-12-13 11:08:18,794 INFO L131 PetriNetUnfolder]: For 848/853 co-relation queries the response was YES. [2022-12-13 11:08:18,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 277 events. 98/277 cut-off events. For 848/853 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1473 event pairs, 2 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 1308. Up to 86 conditions per place. [2022-12-13 11:08:18,797 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 120 transitions, 1291 flow [2022-12-13 11:08:18,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-13 11:08:18,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 11:08:18,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L47-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_316| v_~q1~0.base_163))) (and (not (= (ite (and (< v_~q2_back~0_213 v_~n2~0_147) (<= 0 v_~q2_back~0_213)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122| 0)) (= (ite (and (< v_~q1_front~0_191 v_~q1_back~0_241) (<= 0 v_~q1_front~0_191) (< v_~q1_front~0_191 v_~n1~0_148)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| (ite (= v_~j~0_206 (select .cse0 (+ (* v_~q1_back~0_242 4) v_~q1~0.offset_163))) 1 0)) (not (= (ite (= (select (select |v_#memory_int_316| v_~q2~0.base_134) (+ v_~q2~0.offset_134 (* 4 v_~q2_back~0_213))) v_~i~0_202) 1 0) 0)) (< v_~j~0_206 v_~N~0_141) (= (+ v_~q2_back~0_213 1) v_~q2_back~0_212) (not (= 0 (ite (and (< v_~q1_back~0_242 v_~n1~0_148) (<= 0 v_~q1_back~0_242)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114|) (= (+ v_~q1_front~0_191 1) v_~q1_front~0_190) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114| 0)) (< v_~i~0_202 v_~N~0_141) (= v_~q1_back~0_241 (+ v_~q1_back~0_242 1)) (= v_~i~0_201 (+ (select .cse0 (+ v_~q1~0.offset_163 (* v_~q1_front~0_191 4))) 1)))) InVars {~j~0=v_~j~0_206, ~q1~0.offset=v_~q1~0.offset_163, ~q1_front~0=v_~q1_front~0_191, ~n2~0=v_~n2~0_147, ~i~0=v_~i~0_202, ~n1~0=v_~n1~0_148, ~q2~0.offset=v_~q2~0.offset_134, ~N~0=v_~N~0_141, ~q1_back~0=v_~q1_back~0_242, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_316|, ~q2~0.base=v_~q2~0.base_134, ~q2_back~0=v_~q2_back~0_213} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_60|, ~j~0=v_~j~0_206, ~q1~0.offset=v_~q1~0.offset_163, ~q1_front~0=v_~q1_front~0_190, ~n2~0=v_~n2~0_147, ~i~0=v_~i~0_201, ~n1~0=v_~n1~0_148, ~q2~0.offset=v_~q2~0.offset_134, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_67|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_80|, ~N~0=v_~N~0_141, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_80|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|, ~q1_back~0=v_~q1_back~0_241, ~q1~0.base=v_~q1~0.base_163, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_73|, #memory_int=|v_#memory_int_316|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114|, ~q2~0.base=v_~q2~0.base_134, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_67|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_60|, ~q2_back~0=v_~q2_back~0_212} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:08:19,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L47-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_316| v_~q1~0.base_163))) (and (not (= (ite (and (< v_~q2_back~0_213 v_~n2~0_147) (<= 0 v_~q2_back~0_213)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122| 0)) (= (ite (and (< v_~q1_front~0_191 v_~q1_back~0_241) (<= 0 v_~q1_front~0_191) (< v_~q1_front~0_191 v_~n1~0_148)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| (ite (= v_~j~0_206 (select .cse0 (+ (* v_~q1_back~0_242 4) v_~q1~0.offset_163))) 1 0)) (not (= (ite (= (select (select |v_#memory_int_316| v_~q2~0.base_134) (+ v_~q2~0.offset_134 (* 4 v_~q2_back~0_213))) v_~i~0_202) 1 0) 0)) (< v_~j~0_206 v_~N~0_141) (= (+ v_~q2_back~0_213 1) v_~q2_back~0_212) (not (= 0 (ite (and (< v_~q1_back~0_242 v_~n1~0_148) (<= 0 v_~q1_back~0_242)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114|) (= (+ v_~q1_front~0_191 1) v_~q1_front~0_190) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114| 0)) (< v_~i~0_202 v_~N~0_141) (= v_~q1_back~0_241 (+ v_~q1_back~0_242 1)) (= v_~i~0_201 (+ (select .cse0 (+ v_~q1~0.offset_163 (* v_~q1_front~0_191 4))) 1)))) InVars {~j~0=v_~j~0_206, ~q1~0.offset=v_~q1~0.offset_163, ~q1_front~0=v_~q1_front~0_191, ~n2~0=v_~n2~0_147, ~i~0=v_~i~0_202, ~n1~0=v_~n1~0_148, ~q2~0.offset=v_~q2~0.offset_134, ~N~0=v_~N~0_141, ~q1_back~0=v_~q1_back~0_242, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_316|, ~q2~0.base=v_~q2~0.base_134, ~q2_back~0=v_~q2_back~0_213} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_60|, ~j~0=v_~j~0_206, ~q1~0.offset=v_~q1~0.offset_163, ~q1_front~0=v_~q1_front~0_190, ~n2~0=v_~n2~0_147, ~i~0=v_~i~0_201, ~n1~0=v_~n1~0_148, ~q2~0.offset=v_~q2~0.offset_134, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_67|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_80|, ~N~0=v_~N~0_141, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_80|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|, ~q1_back~0=v_~q1_back~0_241, ~q1~0.base=v_~q1~0.base_163, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_73|, #memory_int=|v_#memory_int_316|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114|, ~q2~0.base=v_~q2~0.base_134, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_67|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_60|, ~q2_back~0=v_~q2_back~0_212} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [761] L70-->L52: Formula: (let ((.cse0 (select |v_#memory_int_358| v_~q2~0.base_164))) (and (= v_~j~0_254 (+ (select .cse0 (+ v_~q2~0.offset_164 (* v_~q2_front~0_218 4))) 1)) (= v_~q2_back~0_270 (+ v_~q2_back~0_271 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_160| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_160|) (not (= (ite (and (< v_~q2_back~0_271 v_~n2~0_177) (<= 0 v_~q2_back~0_271)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_160| (ite (and (< v_~q2_front~0_218 v_~q2_back~0_271) (<= 0 v_~q2_front~0_218) (< v_~q2_front~0_218 v_~n2~0_177)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_162|) (= v_~q2_front~0_217 (+ v_~q2_front~0_218 1)) (< v_~i~0_251 v_~N~0_177) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_162| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162| (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_271) v_~q2~0.offset_164)) v_~i~0_251) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_160| 0)))) InVars {~n2~0=v_~n2~0_177, ~i~0=v_~i~0_251, ~q2~0.offset=v_~q2~0.offset_164, #memory_int=|v_#memory_int_358|, ~q2~0.base=v_~q2~0.base_164, ~q2_front~0=v_~q2_front~0_218, ~N~0=v_~N~0_177, ~q2_back~0=v_~q2_back~0_271} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_88|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_89|, ~j~0=v_~j~0_254, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_83|, ~n2~0=v_~n2~0_177, ~i~0=v_~i~0_251, ~q2~0.offset=v_~q2~0.offset_164, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_160|, ~q2_front~0=v_~q2_front~0_217, ~N~0=v_~N~0_177, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_83|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_160|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_162|, #memory_int=|v_#memory_int_358|, ~q2~0.base=v_~q2~0.base_164, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_88|, ~q2_back~0=v_~q2_back~0_270} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:08:19,153 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,153 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,153 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,154 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,154 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,154 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,154 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,154 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,154 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,154 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [760] L65-1-->L47-1: Formula: (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_160| 0)) (= (+ (select (select |v_#memory_int_356| v_~q1~0.base_193) (+ (* v_~q1_front~0_229 4) v_~q1~0.offset_193)) 1) v_~i~0_249) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_160|) (= (+ v_~q1_front~0_229 1) v_~q1_front~0_228) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_23|) (= (ite (and (<= 0 v_~q1_front~0_229) (< v_~q1_front~0_229 v_~n1~0_178) (< v_~q1_front~0_229 v_~q1_back~0_299)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_23| 0) (not (< v_~j~0_252 v_~N~0_175))) InVars {~j~0=v_~j~0_252, ~q1~0.offset=v_~q1~0.offset_193, ~q1_front~0=v_~q1_front~0_229, ~q1_back~0=v_~q1_back~0_299, ~n1~0=v_~n1~0_178, ~q1~0.base=v_~q1~0.base_193, #memory_int=|v_#memory_int_356|, ~N~0=v_~N~0_175} OutVars{~j~0=v_~j~0_252, ~q1~0.offset=v_~q1~0.offset_193, ~q1_front~0=v_~q1_front~0_228, ~i~0=v_~i~0_249, ~n1~0=v_~n1~0_178, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_89|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_23|, ~N~0=v_~N~0_175, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_23|, ~q1_back~0=v_~q1_back~0_299, ~q1~0.base=v_~q1~0.base_193, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_95|, #memory_int=|v_#memory_int_356|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_160|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_89|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:19,905 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,906 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,906 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,906 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,906 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,906 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,906 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,906 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,906 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,906 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,906 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:19,907 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,301 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,301 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,301 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,301 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,301 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,301 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,301 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,302 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,303 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,303 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,303 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,303 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,882 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,882 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,882 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,882 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,882 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,882 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,882 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,882 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,883 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,883 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,883 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:20,883 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:21,373 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:08:21,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2614 [2022-12-13 11:08:21,374 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 120 transitions, 1335 flow [2022-12-13 11:08:21,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:21,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:08:21,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:08:21,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 11:08:21,575 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-13 11:08:21,575 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:08:21,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:08:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1978847357, now seen corresponding path program 1 times [2022-12-13 11:08:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:08:21,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011446243] [2022-12-13 11:08:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:21,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:08:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:22,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:08:22,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011446243] [2022-12-13 11:08:22,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011446243] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:08:22,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434642100] [2022-12-13 11:08:22,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:22,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:08:22,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:08:22,240 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:08:22,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 11:08:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:22,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 11:08:22,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:08:22,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:08:22,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:08:22,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:08:22,379 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:08:22,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2022-12-13 11:08:22,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-12-13 11:08:22,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 11:08:22,437 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:08:22,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 11:08:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:22,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:08:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:22,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434642100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:08:22,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:08:22,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 11:08:22,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13488109] [2022-12-13 11:08:22,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:08:22,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:08:22,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:08:22,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:08:22,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=183, Unknown=1, NotChecked=0, Total=240 [2022-12-13 11:08:22,908 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 11:08:22,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 120 transitions, 1335 flow. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:22,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:08:22,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 11:08:22,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:08:25,219 INFO L130 PetriNetUnfolder]: 367/682 cut-off events. [2022-12-13 11:08:25,220 INFO L131 PetriNetUnfolder]: For 3103/3103 co-relation queries the response was YES. [2022-12-13 11:08:25,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 682 events. 367/682 cut-off events. For 3103/3103 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3281 event pairs, 32 based on Foata normal form. 5/681 useless extension candidates. Maximal degree in co-relation 3761. Up to 356 conditions per place. [2022-12-13 11:08:25,231 INFO L137 encePairwiseOnDemand]: 11/42 looper letters, 66 selfloop transitions, 79 changer transitions 10/155 dead transitions. [2022-12-13 11:08:25,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 155 transitions, 1778 flow [2022-12-13 11:08:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:08:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 11:08:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2022-12-13 11:08:25,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1619047619047619 [2022-12-13 11:08:25,233 INFO L175 Difference]: Start difference. First operand has 75 places, 120 transitions, 1335 flow. Second operand 15 states and 102 transitions. [2022-12-13 11:08:25,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 155 transitions, 1778 flow [2022-12-13 11:08:25,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 155 transitions, 1750 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 11:08:25,252 INFO L231 Difference]: Finished difference. Result has 86 places, 119 transitions, 1442 flow [2022-12-13 11:08:25,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1442, PETRI_PLACES=86, PETRI_TRANSITIONS=119} [2022-12-13 11:08:25,253 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 64 predicate places. [2022-12-13 11:08:25,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:08:25,253 INFO L89 Accepts]: Start accepts. Operand has 86 places, 119 transitions, 1442 flow [2022-12-13 11:08:25,254 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:08:25,254 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:08:25,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 119 transitions, 1442 flow [2022-12-13 11:08:25,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 119 transitions, 1442 flow [2022-12-13 11:08:25,283 INFO L130 PetriNetUnfolder]: 93/269 cut-off events. [2022-12-13 11:08:25,283 INFO L131 PetriNetUnfolder]: For 935/942 co-relation queries the response was YES. [2022-12-13 11:08:25,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 269 events. 93/269 cut-off events. For 935/942 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1410 event pairs, 5 based on Foata normal form. 1/261 useless extension candidates. Maximal degree in co-relation 1362. Up to 84 conditions per place. [2022-12-13 11:08:25,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 119 transitions, 1442 flow [2022-12-13 11:08:25,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-13 11:08:29,306 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:08:29,391 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [738] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_308| v_~q1~0.base_155))) (and (= (+ (select .cse0 (+ (* v_~q1_front~0_183 4) v_~q1~0.offset_155)) 1) v_~i~0_193) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106| (ite (and (< v_~q1_front~0_183 v_~n1~0_140) (<= 0 v_~q1_front~0_183) (< v_~q1_front~0_183 v_~q1_back~0_227)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114| (ite (= v_~j~0_196 (select .cse0 (+ (* v_~q1_back~0_228 4) v_~q1~0.offset_155))) 1 0)) (not (= (ite (and (< v_~q1_back~0_228 v_~n1~0_140) (<= 0 v_~q1_back~0_228)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (= (+ v_~q1_back~0_228 1) v_~q1_back~0_227) (< v_~j~0_196 v_~N~0_133) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114| 0)) (= (+ v_~q1_front~0_183 1) v_~q1_front~0_182))) InVars {~j~0=v_~j~0_196, ~q1~0.offset=v_~q1~0.offset_155, ~q1_front~0=v_~q1_front~0_183, ~q1_back~0=v_~q1_back~0_228, ~n1~0=v_~n1~0_140, ~q1~0.base=v_~q1~0.base_155, #memory_int=|v_#memory_int_308|, ~N~0=v_~N~0_133} OutVars{~j~0=v_~j~0_196, ~q1~0.offset=v_~q1~0.offset_155, ~q1_front~0=v_~q1_front~0_182, ~i~0=v_~i~0_193, ~n1~0=v_~n1~0_140, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_74|, ~N~0=v_~N~0_133, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_74|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|, ~q1_back~0=v_~q1_back~0_227, ~q1~0.base=v_~q1~0.base_155, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_69|, #memory_int=|v_#memory_int_308|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_63|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:08:29,662 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:29,662 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:29,662 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:29,662 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:29,662 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:29,663 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:08:35,714 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:08:35,715 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10462 [2022-12-13 11:08:35,715 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 119 transitions, 1521 flow [2022-12-13 11:08:35,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:35,715 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:08:35,715 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:08:35,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 11:08:35,919 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-13 11:08:35,920 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:08:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:08:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash -43591553, now seen corresponding path program 1 times [2022-12-13 11:08:35,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:08:35,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084995225] [2022-12-13 11:08:35,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:08:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:08:36,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084995225] [2022-12-13 11:08:36,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084995225] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:08:36,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118946731] [2022-12-13 11:08:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:36,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:08:36,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:08:36,828 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:08:36,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 11:08:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:36,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 11:08:36,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:08:37,105 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 11:08:37,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2022-12-13 11:08:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:37,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:08:37,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:08:37,220 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 128 [2022-12-13 11:08:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:37,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118946731] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:08:37,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:08:37,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-13 11:08:37,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638552743] [2022-12-13 11:08:37,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:08:37,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 11:08:37,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:08:37,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 11:08:37,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:08:37,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 11:08:37,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 119 transitions, 1521 flow. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:37,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:08:37,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 11:08:37,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:08:38,848 INFO L130 PetriNetUnfolder]: 500/938 cut-off events. [2022-12-13 11:08:38,848 INFO L131 PetriNetUnfolder]: For 4660/4660 co-relation queries the response was YES. [2022-12-13 11:08:38,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5502 conditions, 938 events. 500/938 cut-off events. For 4660/4660 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4981 event pairs, 29 based on Foata normal form. 12/942 useless extension candidates. Maximal degree in co-relation 5457. Up to 436 conditions per place. [2022-12-13 11:08:38,857 INFO L137 encePairwiseOnDemand]: 11/44 looper letters, 103 selfloop transitions, 108 changer transitions 19/230 dead transitions. [2022-12-13 11:08:38,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 230 transitions, 2817 flow [2022-12-13 11:08:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:08:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 11:08:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 158 transitions. [2022-12-13 11:08:38,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16322314049586778 [2022-12-13 11:08:38,859 INFO L175 Difference]: Start difference. First operand has 83 places, 119 transitions, 1521 flow. Second operand 22 states and 158 transitions. [2022-12-13 11:08:38,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 230 transitions, 2817 flow [2022-12-13 11:08:38,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 230 transitions, 2611 flow, removed 25 selfloop flow, removed 8 redundant places. [2022-12-13 11:08:38,880 INFO L231 Difference]: Finished difference. Result has 106 places, 158 transitions, 2179 flow [2022-12-13 11:08:38,880 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2179, PETRI_PLACES=106, PETRI_TRANSITIONS=158} [2022-12-13 11:08:38,881 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 84 predicate places. [2022-12-13 11:08:38,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:08:38,881 INFO L89 Accepts]: Start accepts. Operand has 106 places, 158 transitions, 2179 flow [2022-12-13 11:08:38,882 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:08:38,882 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:08:38,882 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 158 transitions, 2179 flow [2022-12-13 11:08:38,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 158 transitions, 2179 flow [2022-12-13 11:08:38,926 INFO L130 PetriNetUnfolder]: 131/377 cut-off events. [2022-12-13 11:08:38,927 INFO L131 PetriNetUnfolder]: For 1917/1918 co-relation queries the response was YES. [2022-12-13 11:08:38,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2149 conditions, 377 events. 131/377 cut-off events. For 1917/1918 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2237 event pairs, 8 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 2063. Up to 130 conditions per place. [2022-12-13 11:08:38,931 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 158 transitions, 2179 flow [2022-12-13 11:08:38,931 INFO L226 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-13 11:08:38,937 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [739] L65-1-->L65-1: Formula: (and (= v_~q2_front~0_169 (+ v_~q2_front~0_170 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_116| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116| (ite (and (< v_~q2_front~0_170 v_~q2_back~0_202) (<= 0 v_~q2_front~0_170) (< v_~q2_front~0_170 v_~n2~0_141)) 1 0)) (< v_~j~0_199 v_~N~0_135) (not (= (ite (= v_~j~0_199 (select (select |v_#memory_int_310| v_~q1~0.base_157) (+ v_~q1~0.offset_157 (* v_~q1_back~0_232 4)))) 1 0) 0)) (= v_~j~0_198 (+ (select (select |v_#memory_int_310| v_~q2~0.base_128) (+ (* v_~q2_front~0_170 4) v_~q2~0.offset_128)) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_116|) (not (= (ite (and (< v_~q1_back~0_232 v_~n1~0_142) (<= 0 v_~q1_back~0_232)) 1 0) 0)) (= v_~q1_back~0_231 (+ v_~q1_back~0_232 1))) InVars {~j~0=v_~j~0_199, ~q1~0.offset=v_~q1~0.offset_157, ~n2~0=v_~n2~0_141, ~q1_back~0=v_~q1_back~0_232, ~q2~0.offset=v_~q2~0.offset_128, ~n1~0=v_~n1~0_142, ~q1~0.base=v_~q1~0.base_157, #memory_int=|v_#memory_int_310|, ~q2_front~0=v_~q2_front~0_170, ~q2~0.base=v_~q2~0.base_128, ~N~0=v_~N~0_135, ~q2_back~0=v_~q2_back~0_202} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_61|, ~j~0=v_~j~0_198, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_55|, ~q1~0.offset=v_~q1~0.offset_157, ~n2~0=v_~n2~0_141, ~q2~0.offset=v_~q2~0.offset_128, ~n1~0=v_~n1~0_142, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116|, ~q2_front~0=v_~q2_front~0_169, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_76|, ~N~0=v_~N~0_135, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_76|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_55|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_116|, ~q1_back~0=v_~q1_back~0_231, ~q1~0.base=v_~q1~0.base_157, #memory_int=|v_#memory_int_310|, ~q2~0.base=v_~q2~0.base_128, ~q2_back~0=v_~q2_back~0_202} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:39,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [734] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_292| v_~q1~0.base_147))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_108| 0)) (< v_~j~0_186 v_~N~0_125) (= (ite (and (< v_~q1_front~0_175 v_~n1~0_132) (< v_~q1_front~0_175 v_~q1_back~0_215) (<= 0 v_~q1_front~0_175)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100|) (= (+ v_~q2_back~0_191 1) v_~q2_back~0_190) (= (+ v_~q1_back~0_216 1) v_~q1_back~0_215) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_100| 0)) (< v_~i~0_184 v_~N~0_125) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_108| (ite (= v_~j~0_186 (select .cse0 (+ v_~q1~0.offset_147 (* v_~q1_back~0_216 4)))) 1 0)) (not (= (ite (and (< v_~q2_back~0_191 v_~n2~0_133) (<= 0 v_~q2_back~0_191)) 1 0) 0)) (= (+ (select .cse0 (+ (* v_~q1_front~0_175 4) v_~q1~0.offset_147)) 1) v_~i~0_183) (not (= (ite (and (<= 0 v_~q1_back~0_216) (< v_~q1_back~0_216 v_~n1~0_132)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_108| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_108|) (= (+ v_~q1_front~0_175 1) v_~q1_front~0_174) (not (= (ite (= (select (select |v_#memory_int_292| v_~q2~0.base_118) (+ (* 4 v_~q2_back~0_191) v_~q2~0.offset_118)) v_~i~0_184) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_100|))) InVars {~j~0=v_~j~0_186, ~q1~0.offset=v_~q1~0.offset_147, ~q1_front~0=v_~q1_front~0_175, ~n2~0=v_~n2~0_133, ~i~0=v_~i~0_184, ~n1~0=v_~n1~0_132, ~q2~0.offset=v_~q2~0.offset_118, ~N~0=v_~N~0_125, ~q1_back~0=v_~q1_back~0_216, ~q1~0.base=v_~q1~0.base_147, #memory_int=|v_#memory_int_292|, ~q2~0.base=v_~q2~0.base_118, ~q2_back~0=v_~q2_back~0_191} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_52|, ~j~0=v_~j~0_186, ~q1~0.offset=v_~q1~0.offset_147, ~q1_front~0=v_~q1_front~0_174, ~n2~0=v_~n2~0_133, ~i~0=v_~i~0_183, ~n1~0=v_~n1~0_132, ~q2~0.offset=v_~q2~0.offset_118, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_61|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_108|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_70|, ~N~0=v_~N~0_125, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_70|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100|, ~q1_back~0=v_~q1_back~0_215, ~q1~0.base=v_~q1~0.base_147, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_67|, #memory_int=|v_#memory_int_292|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_100|, ~q2~0.base=v_~q2~0.base_118, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_61|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_52|, ~q2_back~0=v_~q2_back~0_190} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:08:44,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:44,874 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:44,963 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:45,175 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:08:45,245 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 11:08:45,246 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6365 [2022-12-13 11:08:45,246 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 154 transitions, 2195 flow [2022-12-13 11:08:45,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:45,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:08:45,246 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:08:45,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 11:08:45,457 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-13 11:08:45,458 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:08:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:08:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash 414018379, now seen corresponding path program 1 times [2022-12-13 11:08:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:08:45,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152420301] [2022-12-13 11:08:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:08:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:08:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152420301] [2022-12-13 11:08:46,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152420301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:08:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980316934] [2022-12-13 11:08:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:46,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:08:46,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:08:46,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:08:46,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 11:08:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:46,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 11:08:46,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:08:46,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:08:46,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:08:46,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-13 11:08:46,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:08:46,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:08:46,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 11:08:46,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-12-13 11:08:46,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-13 11:08:46,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-13 11:08:46,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:08:46,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:08:46,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 11:08:46,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 20 [2022-12-13 11:08:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:46,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:08:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:46,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980316934] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:08:46,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:08:46,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 11:08:46,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453503749] [2022-12-13 11:08:46,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:08:46,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:08:46,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:08:46,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:08:46,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:08:46,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 11:08:46,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 154 transitions, 2195 flow. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:46,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:08:46,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 11:08:46,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:08:48,174 INFO L130 PetriNetUnfolder]: 494/921 cut-off events. [2022-12-13 11:08:48,174 INFO L131 PetriNetUnfolder]: For 5848/5848 co-relation queries the response was YES. [2022-12-13 11:08:48,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5841 conditions, 921 events. 494/921 cut-off events. For 5848/5848 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4782 event pairs, 29 based on Foata normal form. 13/924 useless extension candidates. Maximal degree in co-relation 5761. Up to 474 conditions per place. [2022-12-13 11:08:48,184 INFO L137 encePairwiseOnDemand]: 8/47 looper letters, 54 selfloop transitions, 115 changer transitions 32/201 dead transitions. [2022-12-13 11:08:48,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 201 transitions, 2896 flow [2022-12-13 11:08:48,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:08:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 11:08:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 107 transitions. [2022-12-13 11:08:48,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1751227495908347 [2022-12-13 11:08:48,186 INFO L175 Difference]: Start difference. First operand has 96 places, 154 transitions, 2195 flow. Second operand 13 states and 107 transitions. [2022-12-13 11:08:48,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 201 transitions, 2896 flow [2022-12-13 11:08:48,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 201 transitions, 2725 flow, removed 44 selfloop flow, removed 7 redundant places. [2022-12-13 11:08:48,223 INFO L231 Difference]: Finished difference. Result has 107 places, 156 transitions, 2365 flow [2022-12-13 11:08:48,223 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2365, PETRI_PLACES=107, PETRI_TRANSITIONS=156} [2022-12-13 11:08:48,223 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 85 predicate places. [2022-12-13 11:08:48,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:08:48,224 INFO L89 Accepts]: Start accepts. Operand has 107 places, 156 transitions, 2365 flow [2022-12-13 11:08:48,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:08:48,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:08:48,225 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 156 transitions, 2365 flow [2022-12-13 11:08:48,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 156 transitions, 2365 flow [2022-12-13 11:08:48,267 INFO L130 PetriNetUnfolder]: 131/346 cut-off events. [2022-12-13 11:08:48,267 INFO L131 PetriNetUnfolder]: For 2015/2022 co-relation queries the response was YES. [2022-12-13 11:08:48,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 346 events. 131/346 cut-off events. For 2015/2022 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1888 event pairs, 5 based on Foata normal form. 1/335 useless extension candidates. Maximal degree in co-relation 2256. Up to 126 conditions per place. [2022-12-13 11:08:48,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 156 transitions, 2365 flow [2022-12-13 11:08:48,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-13 11:08:48,274 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 11:08:48,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 11:08:48,411 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:08:48,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-13 11:08:48,412 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 156 transitions, 2377 flow [2022-12-13 11:08:48,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:48,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:08:48,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:08:48,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 11:08:48,613 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-13 11:08:48,613 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:08:48,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:08:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash 604145425, now seen corresponding path program 1 times [2022-12-13 11:08:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:08:48,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030138935] [2022-12-13 11:08:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:48,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:08:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:08:49,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030138935] [2022-12-13 11:08:49,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030138935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:08:49,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199054382] [2022-12-13 11:08:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:49,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:08:49,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:08:49,538 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:08:49,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 11:08:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:49,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 11:08:49,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:08:49,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 11:08:49,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 406 [2022-12-13 11:08:49,667 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:08:49,667 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 11:08:49,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:08:49,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:08:49,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-12-13 11:08:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:49,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:08:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:50,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199054382] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:08:50,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:08:50,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2022-12-13 11:08:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465530342] [2022-12-13 11:08:50,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:08:50,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 11:08:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:08:50,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 11:08:50,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=248, Unknown=3, NotChecked=0, Total=306 [2022-12-13 11:08:50,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 11:08:50,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 156 transitions, 2377 flow. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:50,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:08:50,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 11:08:50,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:08:57,764 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-13 11:09:03,886 INFO L130 PetriNetUnfolder]: 579/1069 cut-off events. [2022-12-13 11:09:03,886 INFO L131 PetriNetUnfolder]: For 8215/8215 co-relation queries the response was YES. [2022-12-13 11:09:03,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7488 conditions, 1069 events. 579/1069 cut-off events. For 8215/8215 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5747 event pairs, 29 based on Foata normal form. 8/1068 useless extension candidates. Maximal degree in co-relation 7428. Up to 548 conditions per place. [2022-12-13 11:09:03,896 INFO L137 encePairwiseOnDemand]: 7/42 looper letters, 90 selfloop transitions, 179 changer transitions 12/281 dead transitions. [2022-12-13 11:09:03,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 281 transitions, 4075 flow [2022-12-13 11:09:03,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 11:09:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 11:09:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 177 transitions. [2022-12-13 11:09:03,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14532019704433496 [2022-12-13 11:09:03,898 INFO L175 Difference]: Start difference. First operand has 95 places, 156 transitions, 2377 flow. Second operand 29 states and 177 transitions. [2022-12-13 11:09:03,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 281 transitions, 4075 flow [2022-12-13 11:09:03,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 281 transitions, 3987 flow, removed 44 selfloop flow, removed 3 redundant places. [2022-12-13 11:09:03,951 INFO L231 Difference]: Finished difference. Result has 135 places, 216 transitions, 3885 flow [2022-12-13 11:09:03,952 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2315, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3885, PETRI_PLACES=135, PETRI_TRANSITIONS=216} [2022-12-13 11:09:03,952 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 113 predicate places. [2022-12-13 11:09:03,952 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:09:03,952 INFO L89 Accepts]: Start accepts. Operand has 135 places, 216 transitions, 3885 flow [2022-12-13 11:09:03,953 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:09:03,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:09:03,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 216 transitions, 3885 flow [2022-12-13 11:09:03,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 216 transitions, 3885 flow [2022-12-13 11:09:04,017 INFO L130 PetriNetUnfolder]: 160/443 cut-off events. [2022-12-13 11:09:04,017 INFO L131 PetriNetUnfolder]: For 4140/4148 co-relation queries the response was YES. [2022-12-13 11:09:04,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3442 conditions, 443 events. 160/443 cut-off events. For 4140/4148 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2684 event pairs, 5 based on Foata normal form. 6/443 useless extension candidates. Maximal degree in co-relation 3366. Up to 163 conditions per place. [2022-12-13 11:09:04,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 216 transitions, 3885 flow [2022-12-13 11:09:04,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-13 11:09:04,239 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:09:04,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [797] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_35| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_35| 0) (= v_~q1_front~0_328 (+ v_~q1_front~0_329 1)) (= (ite (and (< v_~q1_front~0_329 v_~q1_back~0_389) (< v_~q1_front~0_329 v_~n1~0_234) (<= 0 v_~q1_front~0_329)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236|) (= (+ (select (select |v_#memory_int_462| v_~q1~0.base_253) (+ (* v_~q1_front~0_329 4) v_~q1~0.offset_253)) 1) v_~i~0_341) (not (< v_~i~0_341 v_~N~0_239)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_236| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_236|)) InVars {~q1~0.offset=v_~q1~0.offset_253, ~q1_front~0=v_~q1_front~0_329, ~q1_back~0=v_~q1_back~0_389, ~n1~0=v_~n1~0_234, ~q1~0.base=v_~q1~0.base_253, #memory_int=|v_#memory_int_462|, ~N~0=v_~N~0_239} OutVars{~q1~0.offset=v_~q1~0.offset_253, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_35|, ~q1_front~0=v_~q1_front~0_328, ~i~0=v_~i~0_341, ~n1~0=v_~n1~0_234, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_141|, ~N~0=v_~N~0_239, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236|, ~q1_back~0=v_~q1_back~0_389, ~q1~0.base=v_~q1~0.base_253, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_147|, #memory_int=|v_#memory_int_462|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_236|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_141|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:09:04,585 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [704] L65-1-->L52: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (= (ite (= v_~j~0_110 (select (select |v_#memory_int_212| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (not (= (ite (and (<= 0 v_~q2_back~0_120) (< v_~q2_back~0_120 v_~n2~0_87)) 1 0) 0)) (< v_~j~0_110 v_~N~0_73) (= v_~q2_back~0_119 (+ v_~q2_back~0_120 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (ite (= (select (select |v_#memory_int_212| v_~q2~0.base_73) (+ v_~q2~0.offset_73 (* 4 v_~q2_back~0_120))) v_~i~0_119) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (< v_~i~0_119 v_~N~0_73) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0))) InVars {~j~0=v_~j~0_110, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_87, ~i~0=v_~i~0_119, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_73, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_212|, ~q2~0.base=v_~q2~0.base_73, ~N~0=v_~N~0_73, ~q2_back~0=v_~q2_back~0_120} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_22|, ~j~0=v_~j~0_110, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_87, ~i~0=v_~i~0_119, ~q2~0.offset=v_~q2~0.offset_73, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_73, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, #memory_int=|v_#memory_int_212|, ~q2~0.base=v_~q2~0.base_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_22|, ~q2_back~0=v_~q2_back~0_119} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:09:04,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:04,928 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:04,929 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:04,929 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:04,929 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:04,929 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:04,929 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:04,929 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:04,929 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:04,929 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:04,929 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [801] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_470| v_~q1~0.base_261))) (and (< v_~j~0_339 v_~N~0_245) (not (= (ite (= (select (select |v_#memory_int_470| v_~q2~0.base_230) (+ v_~q2~0.offset_230 (* 4 v_~q2_back~0_377))) v_~i~0_350) 1 0) 0)) (not (= (ite (and (< v_~q2_back~0_377 v_~n2~0_237) (<= 0 v_~q2_back~0_377)) 1 0) 0)) (= (ite (and (< v_~q1_front~0_345 v_~q1_back~0_397) (< v_~q1_front~0_345 v_~n1~0_242) (<= 0 v_~q1_front~0_345)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_246|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| (ite (= v_~j~0_339 (select .cse0 (+ v_~q1~0.offset_261 (* v_~q1_back~0_398 4)))) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_219|) (= (+ v_~q1_back~0_398 1) v_~q1_back~0_397) (< v_~i~0_350 v_~N~0_245) (= (+ v_~q2_back~0_377 1) v_~q2_back~0_376) (= (+ (select .cse0 (+ v_~q1~0.offset_261 (* v_~q1_front~0_345 4))) 1) v_~i~0_349) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_246| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_246| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_246|) (= v_~q1_front~0_344 (+ v_~q1_front~0_345 1)) (not (= (ite (and (< v_~q1_back~0_398 v_~n1~0_242) (<= 0 v_~q1_back~0_398)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_219| 0)))) InVars {~j~0=v_~j~0_339, ~q1~0.offset=v_~q1~0.offset_261, ~q1_front~0=v_~q1_front~0_345, ~n2~0=v_~n2~0_237, ~i~0=v_~i~0_350, ~n1~0=v_~n1~0_242, ~q2~0.offset=v_~q2~0.offset_230, ~N~0=v_~N~0_245, ~q1_back~0=v_~q1_back~0_398, ~q1~0.base=v_~q1~0.base_261, #memory_int=|v_#memory_int_470|, ~q2~0.base=v_~q2~0.base_230, ~q2_back~0=v_~q2_back~0_377} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_138|, ~j~0=v_~j~0_339, ~q1~0.offset=v_~q1~0.offset_261, ~q1_front~0=v_~q1_front~0_344, ~n2~0=v_~n2~0_237, ~i~0=v_~i~0_349, ~n1~0=v_~n1~0_242, ~q2~0.offset=v_~q2~0.offset_230, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_149|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_146|, ~N~0=v_~N~0_245, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_146|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_219|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_246|, ~q1_back~0=v_~q1_back~0_397, ~q1~0.base=v_~q1~0.base_261, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_155|, #memory_int=|v_#memory_int_470|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_246|, ~q2~0.base=v_~q2~0.base_230, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_149|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_138|, ~q2_back~0=v_~q2_back~0_376} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:09:05,361 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,362 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,362 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,362 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,362 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,362 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,593 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,593 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,593 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,593 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,593 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,594 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:09:05,927 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,928 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,928 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:05,928 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:06,432 INFO L241 LiptonReduction]: Total number of compositions: 10 [2022-12-13 11:09:06,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2481 [2022-12-13 11:09:06,433 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 210 transitions, 3908 flow [2022-12-13 11:09:06,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:06,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:06,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:06,438 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-13 11:09:06,635 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,SelfDestructingSolverStorable15 [2022-12-13 11:09:06,635 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:09:06,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:06,636 INFO L85 PathProgramCache]: Analyzing trace with hash -478902271, now seen corresponding path program 1 times [2022-12-13 11:09:06,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:06,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102856599] [2022-12-13 11:09:06,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:06,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:07,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-13 11:09:07,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:09:07,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102856599] [2022-12-13 11:09:07,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102856599] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:09:07,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649438240] [2022-12-13 11:09:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:07,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:09:07,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:09:07,868 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:09:07,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 11:09:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:07,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 11:09:07,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:09:08,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:09:08,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 36 [2022-12-13 11:09:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:08,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:09:08,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:09:08,375 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 130 [2022-12-13 11:09:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:08,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649438240] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:09:08,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:09:08,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 11:09:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131964285] [2022-12-13 11:09:08,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:09:08,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:09:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:09:08,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:09:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:09:08,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 11:09:08,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 210 transitions, 3908 flow. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:08,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:09:08,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 11:09:08,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:09:10,793 INFO L130 PetriNetUnfolder]: 619/1168 cut-off events. [2022-12-13 11:09:10,793 INFO L131 PetriNetUnfolder]: For 14488/14488 co-relation queries the response was YES. [2022-12-13 11:09:10,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9468 conditions, 1168 events. 619/1168 cut-off events. For 14488/14488 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6556 event pairs, 23 based on Foata normal form. 25/1189 useless extension candidates. Maximal degree in co-relation 9372. Up to 412 conditions per place. [2022-12-13 11:09:10,805 INFO L137 encePairwiseOnDemand]: 12/53 looper letters, 111 selfloop transitions, 175 changer transitions 33/319 dead transitions. [2022-12-13 11:09:10,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 319 transitions, 5449 flow [2022-12-13 11:09:10,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:09:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 11:09:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 205 transitions. [2022-12-13 11:09:10,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.143256464011181 [2022-12-13 11:09:10,807 INFO L175 Difference]: Start difference. First operand has 128 places, 210 transitions, 3908 flow. Second operand 27 states and 205 transitions. [2022-12-13 11:09:10,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 319 transitions, 5449 flow [2022-12-13 11:09:10,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 319 transitions, 5127 flow, removed 98 selfloop flow, removed 9 redundant places. [2022-12-13 11:09:10,870 INFO L231 Difference]: Finished difference. Result has 155 places, 221 transitions, 4470 flow [2022-12-13 11:09:10,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3375, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4470, PETRI_PLACES=155, PETRI_TRANSITIONS=221} [2022-12-13 11:09:10,871 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 133 predicate places. [2022-12-13 11:09:10,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:09:10,871 INFO L89 Accepts]: Start accepts. Operand has 155 places, 221 transitions, 4470 flow [2022-12-13 11:09:10,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:09:10,873 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:09:10,873 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 221 transitions, 4470 flow [2022-12-13 11:09:10,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 221 transitions, 4470 flow [2022-12-13 11:09:10,938 INFO L130 PetriNetUnfolder]: 166/470 cut-off events. [2022-12-13 11:09:10,938 INFO L131 PetriNetUnfolder]: For 5428/5434 co-relation queries the response was YES. [2022-12-13 11:09:10,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 470 events. 166/470 cut-off events. For 5428/5434 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2940 event pairs, 5 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 3900. Up to 172 conditions per place. [2022-12-13 11:09:10,948 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 221 transitions, 4470 flow [2022-12-13 11:09:10,948 INFO L226 LiptonReduction]: Number of co-enabled transitions 512 [2022-12-13 11:09:11,080 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,080 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,080 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,080 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,081 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,081 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,081 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,081 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,081 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,081 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [735] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_294| v_~q2~0.base_120))) (and (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_195) v_~q2~0.offset_120)) v_~i~0_187) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|) (= v_~j~0_188 (+ (select .cse0 (+ v_~q2~0.offset_120 (* v_~q2_front~0_162 4))) 1)) (not (= (ite (= v_~j~0_189 (select (select |v_#memory_int_294| v_~q1~0.base_149) (+ (* v_~q1_back~0_220 4) v_~q1~0.offset_149))) 1 0) 0)) (< v_~j~0_189 v_~N~0_127) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_110| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_110|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|) (< v_~i~0_187 v_~N~0_127) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_110| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_220) (< v_~q1_back~0_220 v_~n1~0_134)) 1 0) 0)) (= (+ v_~q2_back~0_195 1) v_~q2_back~0_194) (= v_~q2_front~0_161 (+ v_~q2_front~0_162 1)) (= v_~q1_back~0_219 (+ v_~q1_back~0_220 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_110| (ite (and (< v_~q2_front~0_162 v_~q2_back~0_194) (< v_~q2_front~0_162 v_~n2~0_135) (<= 0 v_~q2_front~0_162)) 1 0)) (not (= (ite (and (< v_~q2_back~0_195 v_~n2~0_135) (<= 0 v_~q2_back~0_195)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104| 0)))) InVars {~j~0=v_~j~0_189, ~q1~0.offset=v_~q1~0.offset_149, ~n2~0=v_~n2~0_135, ~i~0=v_~i~0_187, ~q2~0.offset=v_~q2~0.offset_120, ~n1~0=v_~n1~0_134, ~q2_front~0=v_~q2_front~0_162, ~N~0=v_~N~0_127, ~q1_back~0=v_~q1_back~0_220, ~q1~0.base=v_~q1~0.base_149, #memory_int=|v_#memory_int_294|, ~q2~0.base=v_~q2~0.base_120, ~q2_back~0=v_~q2_back~0_195} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_54|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_59|, ~j~0=v_~j~0_188, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_53|, ~q1~0.offset=v_~q1~0.offset_149, ~n2~0=v_~n2~0_135, ~i~0=v_~i~0_187, ~q2~0.offset=v_~q2~0.offset_120, ~n1~0=v_~n1~0_134, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_110|, ~q2_front~0=v_~q2_front~0_161, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_72|, ~N~0=v_~N~0_127, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_72|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_110|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|, ~q1_back~0=v_~q1_back~0_219, ~q1~0.base=v_~q1~0.base_149, #memory_int=|v_#memory_int_294|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|, ~q2~0.base=v_~q2~0.base_120, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_54|, ~q2_back~0=v_~q2_back~0_194} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:11,606 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [735] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_294| v_~q2~0.base_120))) (and (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_195) v_~q2~0.offset_120)) v_~i~0_187) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|) (= v_~j~0_188 (+ (select .cse0 (+ v_~q2~0.offset_120 (* v_~q2_front~0_162 4))) 1)) (not (= (ite (= v_~j~0_189 (select (select |v_#memory_int_294| v_~q1~0.base_149) (+ (* v_~q1_back~0_220 4) v_~q1~0.offset_149))) 1 0) 0)) (< v_~j~0_189 v_~N~0_127) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_110| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_110|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|) (< v_~i~0_187 v_~N~0_127) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_110| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_220) (< v_~q1_back~0_220 v_~n1~0_134)) 1 0) 0)) (= (+ v_~q2_back~0_195 1) v_~q2_back~0_194) (= v_~q2_front~0_161 (+ v_~q2_front~0_162 1)) (= v_~q1_back~0_219 (+ v_~q1_back~0_220 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_110| (ite (and (< v_~q2_front~0_162 v_~q2_back~0_194) (< v_~q2_front~0_162 v_~n2~0_135) (<= 0 v_~q2_front~0_162)) 1 0)) (not (= (ite (and (< v_~q2_back~0_195 v_~n2~0_135) (<= 0 v_~q2_back~0_195)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104| 0)))) InVars {~j~0=v_~j~0_189, ~q1~0.offset=v_~q1~0.offset_149, ~n2~0=v_~n2~0_135, ~i~0=v_~i~0_187, ~q2~0.offset=v_~q2~0.offset_120, ~n1~0=v_~n1~0_134, ~q2_front~0=v_~q2_front~0_162, ~N~0=v_~N~0_127, ~q1_back~0=v_~q1_back~0_220, ~q1~0.base=v_~q1~0.base_149, #memory_int=|v_#memory_int_294|, ~q2~0.base=v_~q2~0.base_120, ~q2_back~0=v_~q2_back~0_195} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_54|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_59|, ~j~0=v_~j~0_188, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_53|, ~q1~0.offset=v_~q1~0.offset_149, ~n2~0=v_~n2~0_135, ~i~0=v_~i~0_187, ~q2~0.offset=v_~q2~0.offset_120, ~n1~0=v_~n1~0_134, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_110|, ~q2_front~0=v_~q2_front~0_161, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_72|, ~N~0=v_~N~0_127, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_72|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_110|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|, ~q1_back~0=v_~q1_back~0_219, ~q1~0.base=v_~q1~0.base_149, #memory_int=|v_#memory_int_294|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|, ~q2~0.base=v_~q2~0.base_120, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_54|, ~q2_back~0=v_~q2_back~0_194} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [819] L52-->L52: Formula: (and (< v_~i~0_396 v_~N~0_273) (= v_~q1_front~0_397 (+ v_~q1_front~0_398 1)) (= (+ v_~q2_back~0_435 1) v_~q2_back~0_434) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_297|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297| (ite (= (select (select |v_#memory_int_499| v_~q2~0.base_256) (+ v_~q2~0.offset_256 (* 4 v_~q2_back~0_435))) v_~i~0_396) 1 0)) (not (= (ite (and (< v_~q2_back~0_435 v_~n2~0_263) (<= 0 v_~q2_back~0_435)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_297| 0)) (not (= (ite (and (<= 0 v_~q1_front~0_398) (< v_~q1_front~0_398 v_~n1~0_268) (< v_~q1_front~0_398 v_~q1_back~0_432)) 1 0) 0)) (= (+ (select (select |v_#memory_int_499| v_~q1~0.base_287) (+ v_~q1~0.offset_287 (* v_~q1_front~0_398 4))) 1) v_~i~0_396)) InVars {~q1~0.offset=v_~q1~0.offset_287, ~n2~0=v_~n2~0_263, ~q1_front~0=v_~q1_front~0_398, ~q1_back~0=v_~q1_back~0_432, ~q2~0.offset=v_~q2~0.offset_256, ~n1~0=v_~n1~0_268, ~q1~0.base=v_~q1~0.base_287, #memory_int=|v_#memory_int_499|, ~q2~0.base=v_~q2~0.base_256, ~N~0=v_~N~0_273, ~q2_back~0=v_~q2_back~0_435} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_170|, ~q1~0.offset=v_~q1~0.offset_287, ~n2~0=v_~n2~0_263, ~q1_front~0=v_~q1_front~0_397, ~i~0=v_~i~0_396, ~q2~0.offset=v_~q2~0.offset_256, ~n1~0=v_~n1~0_268, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_179|, ~N~0=v_~N~0_273, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297|, ~q1_back~0=v_~q1_back~0_432, ~q1~0.base=v_~q1~0.base_287, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_297|, #memory_int=|v_#memory_int_499|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_185|, ~q2~0.base=v_~q2~0.base_256, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_179|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_170|, ~q2_back~0=v_~q2_back~0_434} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 11:09:11,606 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,606 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,607 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,607 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,607 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,607 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,607 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,607 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,607 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:11,607 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:12,093 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:12,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [825] L96-4-->L47-1: Formula: (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_313| 0)) (= (+ v_~q1_front~0_414 1) v_~q1_front~0_413) (= |v_#pthreadsForks_97| |v_ULTIMATE.start_main_#t~pre20#1_93|) (= (store |v_#memory_int_508| |v_ULTIMATE.start_main_~#t2~0#1.base_75| (store (select |v_#memory_int_508| |v_ULTIMATE.start_main_~#t2~0#1.base_75|) |v_ULTIMATE.start_main_~#t2~0#1.offset_75| |v_ULTIMATE.start_main_#t~pre20#1_93|)) |v_#memory_int_507|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_313| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_313|) (= (ite (and (<= 0 v_~q1_front~0_414) (< v_~q1_front~0_414 v_~q1_back~0_448) (< v_~q1_front~0_414 v_~n1~0_276)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_313|) (= (+ |v_#pthreadsForks_97| 1) |v_#pthreadsForks_96|) (= (+ (select (select |v_#memory_int_507| v_~q1~0.base_295) (+ v_~q1~0.offset_295 (* v_~q1_front~0_414 4))) 1) v_~i~0_410)) InVars {~q1~0.offset=v_~q1~0.offset_295, ~q1_front~0=v_~q1_front~0_414, #pthreadsForks=|v_#pthreadsForks_97|, ~q1_back~0=v_~q1_back~0_448, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ~n1~0=v_~n1~0_276, ~q1~0.base=v_~q1~0.base_295, #memory_int=|v_#memory_int_508|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_75|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_94|, ~q1~0.offset=v_~q1~0.offset_295, ~q1_front~0=v_~q1_front~0_413, ~i~0=v_~i~0_410, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ~n1~0=v_~n1~0_276, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_187|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_313|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_93|, #pthreadsForks=|v_#pthreadsForks_96|, ~q1_back~0=v_~q1_back~0_448, ~q1~0.base=v_~q1~0.base_295, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_193|, #memory_int=|v_#memory_int_507|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_313|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_187|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_70|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_75|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, ~q1_front~0, #pthreadsForks, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~nondet19#1] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 11:09:12,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:12,551 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 11:09:12,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1681 [2022-12-13 11:09:12,552 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 220 transitions, 4523 flow [2022-12-13 11:09:12,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:12,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:12,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:12,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 11:09:12,752 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,SelfDestructingSolverStorable16 [2022-12-13 11:09:12,753 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:09:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:12,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1862405282, now seen corresponding path program 1 times [2022-12-13 11:09:12,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:12,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651063404] [2022-12-13 11:09:12,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:09:12,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651063404] [2022-12-13 11:09:12,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651063404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:09:12,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:09:12,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:09:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247727406] [2022-12-13 11:09:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:09:12,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:09:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:09:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:09:12,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:09:12,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 11:09:12,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 220 transitions, 4523 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:12,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:09:12,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 11:09:12,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:09:13,190 INFO L130 PetriNetUnfolder]: 545/1039 cut-off events. [2022-12-13 11:09:13,190 INFO L131 PetriNetUnfolder]: For 17923/17923 co-relation queries the response was YES. [2022-12-13 11:09:13,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9284 conditions, 1039 events. 545/1039 cut-off events. For 17923/17923 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5712 event pairs, 183 based on Foata normal form. 26/1061 useless extension candidates. Maximal degree in co-relation 9177. Up to 888 conditions per place. [2022-12-13 11:09:13,200 INFO L137 encePairwiseOnDemand]: 35/54 looper letters, 194 selfloop transitions, 15 changer transitions 12/221 dead transitions. [2022-12-13 11:09:13,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 221 transitions, 4772 flow [2022-12-13 11:09:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:09:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:09:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 11:09:13,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2022-12-13 11:09:13,201 INFO L175 Difference]: Start difference. First operand has 144 places, 220 transitions, 4523 flow. Second operand 4 states and 75 transitions. [2022-12-13 11:09:13,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 221 transitions, 4772 flow [2022-12-13 11:09:13,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 221 transitions, 4443 flow, removed 78 selfloop flow, removed 15 redundant places. [2022-12-13 11:09:13,262 INFO L231 Difference]: Finished difference. Result has 133 places, 193 transitions, 3644 flow [2022-12-13 11:09:13,262 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3865, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3644, PETRI_PLACES=133, PETRI_TRANSITIONS=193} [2022-12-13 11:09:13,263 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 111 predicate places. [2022-12-13 11:09:13,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:09:13,263 INFO L89 Accepts]: Start accepts. Operand has 133 places, 193 transitions, 3644 flow [2022-12-13 11:09:13,264 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:09:13,264 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:09:13,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 193 transitions, 3644 flow [2022-12-13 11:09:13,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 193 transitions, 3644 flow [2022-12-13 11:09:13,312 INFO L130 PetriNetUnfolder]: 145/419 cut-off events. [2022-12-13 11:09:13,313 INFO L131 PetriNetUnfolder]: For 4257/4262 co-relation queries the response was YES. [2022-12-13 11:09:13,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3294 conditions, 419 events. 145/419 cut-off events. For 4257/4262 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2545 event pairs, 2 based on Foata normal form. 3/417 useless extension candidates. Maximal degree in co-relation 3069. Up to 133 conditions per place. [2022-12-13 11:09:13,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 193 transitions, 3644 flow [2022-12-13 11:09:13,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-13 11:09:13,318 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:09:13,319 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 11:09:13,319 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 193 transitions, 3644 flow [2022-12-13 11:09:13,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:13,319 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:13,319 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:13,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 11:09:13,319 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:09:13,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash 977069257, now seen corresponding path program 1 times [2022-12-13 11:09:13,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:13,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181214672] [2022-12-13 11:09:13,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:13,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:13,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:09:13,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181214672] [2022-12-13 11:09:13,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181214672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:09:13,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:09:13,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:09:13,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494252591] [2022-12-13 11:09:13,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:09:13,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:09:13,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:09:13,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:09:13,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:09:13,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 11:09:13,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 193 transitions, 3644 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:13,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:09:13,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 11:09:13,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:09:13,698 INFO L130 PetriNetUnfolder]: 561/1066 cut-off events. [2022-12-13 11:09:13,698 INFO L131 PetriNetUnfolder]: For 14272/14272 co-relation queries the response was YES. [2022-12-13 11:09:13,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8741 conditions, 1066 events. 561/1066 cut-off events. For 14272/14272 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5719 event pairs, 117 based on Foata normal form. 38/1100 useless extension candidates. Maximal degree in co-relation 8167. Up to 565 conditions per place. [2022-12-13 11:09:13,707 INFO L137 encePairwiseOnDemand]: 26/45 looper letters, 177 selfloop transitions, 56 changer transitions 0/233 dead transitions. [2022-12-13 11:09:13,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 233 transitions, 4475 flow [2022-12-13 11:09:13,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:09:13,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:09:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-13 11:09:13,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3688888888888889 [2022-12-13 11:09:13,709 INFO L175 Difference]: Start difference. First operand has 129 places, 193 transitions, 3644 flow. Second operand 5 states and 83 transitions. [2022-12-13 11:09:13,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 233 transitions, 4475 flow [2022-12-13 11:09:13,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 4068 flow, removed 58 selfloop flow, removed 11 redundant places. [2022-12-13 11:09:13,764 INFO L231 Difference]: Finished difference. Result has 123 places, 185 transitions, 3345 flow [2022-12-13 11:09:13,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2644, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3345, PETRI_PLACES=123, PETRI_TRANSITIONS=185} [2022-12-13 11:09:13,764 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 101 predicate places. [2022-12-13 11:09:13,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:09:13,764 INFO L89 Accepts]: Start accepts. Operand has 123 places, 185 transitions, 3345 flow [2022-12-13 11:09:13,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:09:13,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:09:13,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 185 transitions, 3345 flow [2022-12-13 11:09:13,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 185 transitions, 3345 flow [2022-12-13 11:09:13,810 INFO L130 PetriNetUnfolder]: 146/445 cut-off events. [2022-12-13 11:09:13,811 INFO L131 PetriNetUnfolder]: For 3590/3590 co-relation queries the response was YES. [2022-12-13 11:09:13,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 445 events. 146/445 cut-off events. For 3590/3590 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2784 event pairs, 4 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 2967. Up to 133 conditions per place. [2022-12-13 11:09:13,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 185 transitions, 3345 flow [2022-12-13 11:09:13,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-13 11:09:13,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [790] L65-1-->L65-1: Formula: (and (< v_~j~0_320 v_~N~0_225) (= v_~q1_back~0_373 (+ v_~q1_back~0_374 1)) (not (= 0 (ite (= v_~j~0_320 (select (select |v_#memory_int_438| v_~q1~0.base_243) (+ (* v_~q1_back~0_374 4) v_~q1~0.offset_243))) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_203| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_203|) (not (= (ite (and (<= 0 v_~q1_back~0_374) (< v_~q1_back~0_374 v_~n1~0_224)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_203| 0)) (= v_~j~0_319 (+ (select (select |v_#memory_int_438| v_~q2~0.base_216) (+ (* v_~q2_front~0_278 4) v_~q2~0.offset_216)) 1)) (= (+ v_~q2_front~0_278 1) v_~q2_front~0_277) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_203| (ite (and (<= 0 v_~q2_front~0_278) (< v_~q2_front~0_278 v_~n2~0_223) (< v_~q2_front~0_278 v_~q2_back~0_354)) 1 0))) InVars {~j~0=v_~j~0_320, ~q1~0.offset=v_~q1~0.offset_243, ~n2~0=v_~n2~0_223, ~q1_back~0=v_~q1_back~0_374, ~q2~0.offset=v_~q2~0.offset_216, ~n1~0=v_~n1~0_224, ~q1~0.base=v_~q1~0.base_243, #memory_int=|v_#memory_int_438|, ~q2_front~0=v_~q2_front~0_278, ~q2~0.base=v_~q2~0.base_216, ~N~0=v_~N~0_225, ~q2_back~0=v_~q2_back~0_354} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_115|, ~j~0=v_~j~0_319, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_109|, ~q1~0.offset=v_~q1~0.offset_243, ~n2~0=v_~n2~0_223, ~q2~0.offset=v_~q2~0.offset_216, ~n1~0=v_~n1~0_224, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_203|, ~q2_front~0=v_~q2_front~0_277, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_138|, ~N~0=v_~N~0_225, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_138|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_109|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_203|, ~q1_back~0=v_~q1_back~0_373, ~q1~0.base=v_~q1~0.base_243, #memory_int=|v_#memory_int_438|, ~q2~0.base=v_~q2~0.base_216, ~q2_back~0=v_~q2_back~0_354} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:14,020 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:14,020 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:14,020 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:14,020 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:14,020 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:14,020 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:14,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:09:14,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 385 [2022-12-13 11:09:14,149 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 185 transitions, 3373 flow [2022-12-13 11:09:14,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:14,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:14,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:14,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 11:09:14,150 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:09:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash -812818207, now seen corresponding path program 1 times [2022-12-13 11:09:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:14,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768190315] [2022-12-13 11:09:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:09:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768190315] [2022-12-13 11:09:14,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768190315] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:09:14,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482821306] [2022-12-13 11:09:14,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:14,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:09:14,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:09:14,901 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:09:14,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 11:09:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:15,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 11:09:15,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:09:15,204 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 11:09:15,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 20 [2022-12-13 11:09:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:15,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:09:15,595 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-13 11:09:15,599 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 236 [2022-12-13 11:09:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:18,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482821306] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:09:18,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:09:18,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 11:09:18,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332301834] [2022-12-13 11:09:18,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:09:18,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 11:09:18,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:09:18,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 11:09:18,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:09:18,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 11:09:18,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 185 transitions, 3373 flow. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:18,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:09:18,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 11:09:18,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:09:20,623 INFO L130 PetriNetUnfolder]: 581/1126 cut-off events. [2022-12-13 11:09:20,624 INFO L131 PetriNetUnfolder]: For 13309/13309 co-relation queries the response was YES. [2022-12-13 11:09:20,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8882 conditions, 1126 events. 581/1126 cut-off events. For 13309/13309 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6356 event pairs, 32 based on Foata normal form. 15/1136 useless extension candidates. Maximal degree in co-relation 8358. Up to 551 conditions per place. [2022-12-13 11:09:20,630 INFO L137 encePairwiseOnDemand]: 10/43 looper letters, 99 selfloop transitions, 148 changer transitions 31/278 dead transitions. [2022-12-13 11:09:20,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 278 transitions, 4598 flow [2022-12-13 11:09:20,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 11:09:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 11:09:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 183 transitions. [2022-12-13 11:09:20,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14186046511627906 [2022-12-13 11:09:20,632 INFO L175 Difference]: Start difference. First operand has 123 places, 185 transitions, 3373 flow. Second operand 30 states and 183 transitions. [2022-12-13 11:09:20,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 278 transitions, 4598 flow [2022-12-13 11:09:20,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 278 transitions, 4349 flow, removed 11 selfloop flow, removed 7 redundant places. [2022-12-13 11:09:20,682 INFO L231 Difference]: Finished difference. Result has 154 places, 197 transitions, 3767 flow [2022-12-13 11:09:20,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2767, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3767, PETRI_PLACES=154, PETRI_TRANSITIONS=197} [2022-12-13 11:09:20,682 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 132 predicate places. [2022-12-13 11:09:20,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:09:20,683 INFO L89 Accepts]: Start accepts. Operand has 154 places, 197 transitions, 3767 flow [2022-12-13 11:09:20,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:09:20,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:09:20,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 197 transitions, 3767 flow [2022-12-13 11:09:20,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 197 transitions, 3767 flow [2022-12-13 11:09:20,730 INFO L130 PetriNetUnfolder]: 148/450 cut-off events. [2022-12-13 11:09:20,730 INFO L131 PetriNetUnfolder]: For 5360/5364 co-relation queries the response was YES. [2022-12-13 11:09:20,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3650 conditions, 450 events. 148/450 cut-off events. For 5360/5364 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2818 event pairs, 6 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 3552. Up to 136 conditions per place. [2022-12-13 11:09:20,734 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 197 transitions, 3767 flow [2022-12-13 11:09:20,734 INFO L226 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-13 11:09:20,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:20,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [828] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_519| v_~q1~0.base_301))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_321| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_321|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_321| 0)) (= (+ v_~q1_front~0_426 1) v_~q1_front~0_425) (not (= (ite (and (<= 0 v_~q1_back~0_457) (< v_~q1_back~0_457 v_~n1~0_282)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_249| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_249|) (= (+ v_~q1_back~0_457 1) v_~q1_back~0_456) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_249| (ite (= v_~j~0_379 (select .cse0 (+ v_~q1~0.offset_301 (* v_~q1_back~0_457 4)))) 1 0)) (= (ite (and (< v_~q1_front~0_426 v_~n1~0_282) (< v_~q1_front~0_426 v_~q1_back~0_456) (<= 0 v_~q1_front~0_426)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_321|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_249| 0)) (= (+ (select .cse0 (+ v_~q1~0.offset_301 (* v_~q1_front~0_426 4))) 1) v_~i~0_416) (< v_~j~0_379 v_~N~0_285))) InVars {~j~0=v_~j~0_379, ~q1~0.offset=v_~q1~0.offset_301, ~q1_front~0=v_~q1_front~0_426, ~q1_back~0=v_~q1_back~0_457, ~n1~0=v_~n1~0_282, ~q1~0.base=v_~q1~0.base_301, #memory_int=|v_#memory_int_519|, ~N~0=v_~N~0_285} OutVars{~j~0=v_~j~0_379, ~q1~0.offset=v_~q1~0.offset_301, ~q1_front~0=v_~q1_front~0_425, ~i~0=v_~i~0_416, ~n1~0=v_~n1~0_282, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_193|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_249|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_166|, ~N~0=v_~N~0_285, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_166|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_321|, ~q1_back~0=v_~q1_back~0_456, ~q1~0.base=v_~q1~0.base_301, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_199|, #memory_int=|v_#memory_int_519|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_321|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_193|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:09:21,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [832] L65-1-->L70: Formula: (let ((.cse0 (select |v_#memory_int_525| v_~q1~0.base_307))) (and (not (= (ite (and (< v_~q2_front~0_337 v_~n2~0_277) (<= 0 v_~q2_front~0_337) (< v_~q2_front~0_337 v_~q2_back~0_460)) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_468 (+ v_~n1~0_288 1)) (<= 1 v_~q1_back~0_468)) 1 0) 0)) (= (+ v_~q2_front~0_337 1) v_~q2_front~0_336) (= v_~j~0_389 (+ (select (select |v_#memory_int_525| v_~q2~0.base_270) (+ v_~q2~0.offset_270 (* v_~q2_front~0_337 4))) 1)) (= (+ 2 v_~q1_back~0_470) v_~q1_back~0_468) (not (= (ite (and (<= 0 v_~q1_back~0_470) (< v_~q1_back~0_470 v_~n1~0_288)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_257| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_257| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_257|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_257| (ite (= v_~j~0_389 (select .cse0 (+ v_~q1~0.offset_307 (- 4) (* v_~q1_back~0_468 4)))) 1 0)) (< v_~j~0_390 v_~N~0_291) (< v_~j~0_389 v_~N~0_291) (not (= (ite (= v_~j~0_390 (select .cse0 (+ v_~q1~0.offset_307 (* v_~q1_back~0_470 4)))) 1 0) 0)))) InVars {~j~0=v_~j~0_390, ~q1~0.offset=v_~q1~0.offset_307, ~n2~0=v_~n2~0_277, ~q1_back~0=v_~q1_back~0_470, ~n1~0=v_~n1~0_288, ~q2~0.offset=v_~q2~0.offset_270, ~q1~0.base=v_~q1~0.base_307, #memory_int=|v_#memory_int_525|, ~q2_front~0=v_~q2_front~0_337, ~q2~0.base=v_~q2~0.base_270, ~N~0=v_~N~0_291, ~q2_back~0=v_~q2_back~0_460} OutVars{~j~0=v_~j~0_389, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_149|, ~q1~0.offset=v_~q1~0.offset_307, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_143|, ~n2~0=v_~n2~0_277, ~n1~0=v_~n1~0_288, ~q2~0.offset=v_~q2~0.offset_270, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_257|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_172|, ~q2_front~0=v_~q2_front~0_336, ~N~0=v_~N~0_291, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_172|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_143|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_257|, ~q1_back~0=v_~q1_back~0_468, ~q1~0.base=v_~q1~0.base_307, #memory_int=|v_#memory_int_525|, ~q2~0.base=v_~q2~0.base_270, ~q2_back~0=v_~q2_back~0_460} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:21,290 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:21,363 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_436| v_~q1~0.base_241))) (and (= (+ v_~q1_back~0_370 1) v_~q1_back~0_369) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_218| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_201| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_201|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218| (ite (and (< v_~q1_front~0_311 v_~n1~0_222) (<= 0 v_~q1_front~0_311) (< v_~q1_front~0_311 v_~q1_back~0_369)) 1 0)) (= v_~i~0_325 (+ (select .cse0 (+ v_~q1~0.offset_241 (* v_~q1_front~0_311 4))) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_218|) (< v_~j~0_317 v_~N~0_223) (not (= (ite (and (< v_~q1_back~0_370 v_~n1~0_222) (<= 0 v_~q1_back~0_370)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_201| 0)) (= (+ v_~q1_front~0_311 1) v_~q1_front~0_310) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_201| (ite (= v_~j~0_317 (select .cse0 (+ v_~q1~0.offset_241 (* v_~q1_back~0_370 4)))) 1 0)))) InVars {~j~0=v_~j~0_317, ~q1~0.offset=v_~q1~0.offset_241, ~q1_front~0=v_~q1_front~0_311, ~q1_back~0=v_~q1_back~0_370, ~n1~0=v_~n1~0_222, ~q1~0.base=v_~q1~0.base_241, #memory_int=|v_#memory_int_436|, ~N~0=v_~N~0_223} OutVars{~j~0=v_~j~0_317, ~q1~0.offset=v_~q1~0.offset_241, ~q1_front~0=v_~q1_front~0_310, ~i~0=v_~i~0_325, ~n1~0=v_~n1~0_222, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_201|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_136|, ~N~0=v_~N~0_223, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_136|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_201|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218|, ~q1_back~0=v_~q1_back~0_369, ~q1~0.base=v_~q1~0.base_241, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_135|, #memory_int=|v_#memory_int_436|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_218|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:09:21,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:21,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:21,766 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:21,766 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:21,766 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:21,766 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:21,766 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:21,767 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:21,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [829] L65-1-->L65-1: Formula: (and (< v_~j~0_382 v_~N~0_287) (= v_~q2_front~0_328 (+ v_~q2_front~0_329 1)) (not (= 0 (ite (= v_~j~0_382 (select (select |v_#memory_int_521| v_~q1~0.base_303) (+ v_~q1~0.offset_303 (* v_~q1_back~0_461 4)))) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_251| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_251|) (not (= (ite (and (<= 0 v_~q1_back~0_461) (< v_~q1_back~0_461 v_~n1~0_284)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_251| 0)) (= (+ v_~q1_back~0_461 1) v_~q1_back~0_460) (= v_~j~0_381 (+ (select (select |v_#memory_int_521| v_~q2~0.base_266) (+ (* v_~q2_front~0_329 4) v_~q2~0.offset_266)) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_251| (ite (and (< v_~q2_front~0_329 v_~n2~0_273) (<= 0 v_~q2_front~0_329) (< v_~q2_front~0_329 v_~q2_back~0_456)) 1 0))) InVars {~j~0=v_~j~0_382, ~q1~0.offset=v_~q1~0.offset_303, ~n2~0=v_~n2~0_273, ~q1_back~0=v_~q1_back~0_461, ~q2~0.offset=v_~q2~0.offset_266, ~n1~0=v_~n1~0_284, ~q1~0.base=v_~q1~0.base_303, #memory_int=|v_#memory_int_521|, ~q2_front~0=v_~q2_front~0_329, ~q2~0.base=v_~q2~0.base_266, ~N~0=v_~N~0_287, ~q2_back~0=v_~q2_back~0_456} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_145|, ~j~0=v_~j~0_381, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_139|, ~q1~0.offset=v_~q1~0.offset_303, ~n2~0=v_~n2~0_273, ~q2~0.offset=v_~q2~0.offset_266, ~n1~0=v_~n1~0_284, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_251|, ~q2_front~0=v_~q2_front~0_328, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_168|, ~N~0=v_~N~0_287, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_168|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_139|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_251|, ~q1_back~0=v_~q1_back~0_460, ~q1~0.base=v_~q1~0.base_303, #memory_int=|v_#memory_int_521|, ~q2~0.base=v_~q2~0.base_266, ~q2_back~0=v_~q2_back~0_456} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:22,560 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 11:09:22,656 INFO L241 LiptonReduction]: Total number of compositions: 10 [2022-12-13 11:09:22,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1974 [2022-12-13 11:09:22,657 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 190 transitions, 3761 flow [2022-12-13 11:09:22,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:22,658 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:22,658 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:22,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 11:09:22,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:09:22,868 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:09:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:22,868 INFO L85 PathProgramCache]: Analyzing trace with hash 762169050, now seen corresponding path program 1 times [2022-12-13 11:09:22,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:22,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658990611] [2022-12-13 11:09:22,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 11:09:22,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:09:22,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658990611] [2022-12-13 11:09:22,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658990611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:09:22,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:09:22,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:09:22,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514834598] [2022-12-13 11:09:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:09:22,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:09:22,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:09:22,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:09:22,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:09:22,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 11:09:22,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 190 transitions, 3761 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:22,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:09:22,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 11:09:22,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:09:23,234 INFO L130 PetriNetUnfolder]: 542/1029 cut-off events. [2022-12-13 11:09:23,234 INFO L131 PetriNetUnfolder]: For 17074/17074 co-relation queries the response was YES. [2022-12-13 11:09:23,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9053 conditions, 1029 events. 542/1029 cut-off events. For 17074/17074 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5503 event pairs, 221 based on Foata normal form. 4/1028 useless extension candidates. Maximal degree in co-relation 8944. Up to 773 conditions per place. [2022-12-13 11:09:23,244 INFO L137 encePairwiseOnDemand]: 46/51 looper letters, 211 selfloop transitions, 3 changer transitions 4/218 dead transitions. [2022-12-13 11:09:23,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 218 transitions, 4556 flow [2022-12-13 11:09:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:09:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:09:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 11:09:23,245 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 11:09:23,245 INFO L175 Difference]: Start difference. First operand has 141 places, 190 transitions, 3761 flow. Second operand 3 states and 68 transitions. [2022-12-13 11:09:23,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 218 transitions, 4556 flow [2022-12-13 11:09:23,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 218 transitions, 4135 flow, removed 87 selfloop flow, removed 15 redundant places. [2022-12-13 11:09:23,324 INFO L231 Difference]: Finished difference. Result has 127 places, 181 transitions, 3193 flow [2022-12-13 11:09:23,324 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3272, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3193, PETRI_PLACES=127, PETRI_TRANSITIONS=181} [2022-12-13 11:09:23,324 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 105 predicate places. [2022-12-13 11:09:23,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:09:23,325 INFO L89 Accepts]: Start accepts. Operand has 127 places, 181 transitions, 3193 flow [2022-12-13 11:09:23,325 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:09:23,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:09:23,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 181 transitions, 3193 flow [2022-12-13 11:09:23,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 181 transitions, 3193 flow [2022-12-13 11:09:23,389 INFO L130 PetriNetUnfolder]: 145/430 cut-off events. [2022-12-13 11:09:23,389 INFO L131 PetriNetUnfolder]: For 3681/3682 co-relation queries the response was YES. [2022-12-13 11:09:23,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3156 conditions, 430 events. 145/430 cut-off events. For 3681/3682 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2624 event pairs, 8 based on Foata normal form. 1/422 useless extension candidates. Maximal degree in co-relation 2902. Up to 118 conditions per place. [2022-12-13 11:09:23,395 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 181 transitions, 3193 flow [2022-12-13 11:09:23,395 INFO L226 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-13 11:09:23,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [822] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_503| v_~q2~0.base_260)) (.cse1 (select |v_#memory_int_503| v_~q1~0.base_291))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_305| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305|) (= (+ v_~q2_front~0_321 1) v_~q2_front~0_320) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243| (ite (and (< v_~q2_front~0_321 v_~n2~0_267) (< v_~q2_front~0_321 v_~q2_back~0_442) (<= 0 v_~q2_front~0_321)) 1 0)) (not (= 0 (ite (= (select .cse0 (+ v_~q2~0.offset_260 (* 4 v_~q2_back~0_443))) v_~i~0_403) 1 0))) (not (= 0 (ite (and (< v_~q2_back~0_443 v_~n2~0_267) (<= 0 v_~q2_back~0_443)) 1 0))) (= v_~j~0_369 (+ (select .cse0 (+ v_~q2~0.offset_260 (* v_~q2_front~0_321 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243|) (= (ite (and (< v_~q1_front~0_406 v_~n1~0_272) (< v_~q1_front~0_406 v_~q1_back~0_440) (<= 0 v_~q1_front~0_406)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_305|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305| 0)) (= v_~q1_back~0_440 (+ v_~q1_back~0_441 1)) (< v_~i~0_403 v_~N~0_277) (= (+ v_~q1_front~0_406 1) v_~q1_front~0_405) (= (+ v_~q2_back~0_443 1) v_~q2_back~0_442) (= (+ (select .cse1 (+ v_~q1~0.offset_291 (* v_~q1_front~0_406 4))) 1) v_~i~0_402) (not (= (ite (and (< v_~q1_back~0_441 v_~n1~0_272) (<= 0 v_~q1_back~0_441)) 1 0) 0)) (not (= (ite (= v_~j~0_370 (select .cse1 (+ (* v_~q1_back~0_441 4) v_~q1~0.offset_291))) 1 0) 0)) (< v_~j~0_370 v_~N~0_277))) InVars {~j~0=v_~j~0_370, ~q1~0.offset=v_~q1~0.offset_291, ~q1_front~0=v_~q1_front~0_406, ~n2~0=v_~n2~0_267, ~i~0=v_~i~0_403, ~n1~0=v_~n1~0_272, ~q2~0.offset=v_~q2~0.offset_260, ~q2_front~0=v_~q2_front~0_321, ~N~0=v_~N~0_277, ~q1_back~0=v_~q1_back~0_441, ~q1~0.base=v_~q1~0.base_291, #memory_int=|v_#memory_int_503|, ~q2~0.base=v_~q2~0.base_260, ~q2_back~0=v_~q2_back~0_443} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_174|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_141|, ~j~0=v_~j~0_369, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_135|, ~q1_front~0=v_~q1_front~0_405, ~n1~0=v_~n1~0_272, ~q2~0.offset=v_~q2~0.offset_260, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_135|, ~q1_back~0=v_~q1_back~0_440, ~q1~0.base=v_~q1~0.base_291, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_189|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305|, ~q2~0.base=v_~q2~0.base_260, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_183|, ~q2_back~0=v_~q2_back~0_442, ~q1~0.offset=v_~q1~0.offset_291, ~n2~0=v_~n2~0_267, ~i~0=v_~i~0_402, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_183|, ~q2_front~0=v_~q2_front~0_320, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_160|, ~N~0=v_~N~0_277, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_160|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_305|, #memory_int=|v_#memory_int_503|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_174|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [846] L65-1-->L52: Formula: (and (< v_~j~0_432 v_~N~0_317) (not (= (ite (and (< v_~q2_back~0_486 v_~n2~0_295) (<= 0 v_~q2_back~0_486)) 1 0) 0)) (= (+ v_~q2_back~0_486 1) v_~q2_back~0_485) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352| (ite (= (select (select |v_#memory_int_552| v_~q2~0.base_288) (+ v_~q2~0.offset_288 (* 4 v_~q2_back~0_486))) v_~i~0_443) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290| (ite (= v_~j~0_432 (select (select |v_#memory_int_552| v_~q1~0.base_333) (+ v_~q1~0.offset_333 (* v_~q1_back~0_520 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352| 0)) (= (+ v_~q1_back~0_520 1) v_~q1_back~0_519) (not (= (ite (and (<= 0 v_~q1_back~0_520) (< v_~q1_back~0_520 v_~n1~0_314)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290| 0)) (< v_~i~0_443 v_~N~0_317)) InVars {~j~0=v_~j~0_432, ~q1~0.offset=v_~q1~0.offset_333, ~n2~0=v_~n2~0_295, ~i~0=v_~i~0_443, ~q1_back~0=v_~q1_back~0_520, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_314, ~q1~0.base=v_~q1~0.base_333, #memory_int=|v_#memory_int_552|, ~q2~0.base=v_~q2~0.base_288, ~N~0=v_~N~0_317, ~q2_back~0=v_~q2_back~0_486} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_190|, ~j~0=v_~j~0_432, ~q1~0.offset=v_~q1~0.offset_333, ~n2~0=v_~n2~0_295, ~i~0=v_~i~0_443, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_314, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_198|, ~N~0=v_~N~0_317, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_198|, 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_352|, ~q1_back~0=v_~q1_back~0_519, ~q1~0.base=v_~q1~0.base_333, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|, #memory_int=|v_#memory_int_552|, ~q2~0.base=v_~q2~0.base_288, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_190|, ~q2_back~0=v_~q2_back~0_485} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 11:09:23,407 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,408 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,408 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,408 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,408 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,408 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,408 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,408 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,408 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,408 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,409 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,409 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:23,930 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:09:23,931 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 607 [2022-12-13 11:09:23,931 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 180 transitions, 3175 flow [2022-12-13 11:09:23,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:23,931 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:23,931 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:23,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 11:09:23,931 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:09:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1097185713, now seen corresponding path program 1 times [2022-12-13 11:09:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:23,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709125861] [2022-12-13 11:09:23,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:23,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:24,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:09:24,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709125861] [2022-12-13 11:09:24,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709125861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:09:24,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:09:24,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:09:24,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670516873] [2022-12-13 11:09:24,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:09:24,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:09:24,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:09:24,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:09:24,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:09:24,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 11:09:24,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 180 transitions, 3175 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:24,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:09:24,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 11:09:24,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:09:24,210 INFO L130 PetriNetUnfolder]: 374/752 cut-off events. [2022-12-13 11:09:24,210 INFO L131 PetriNetUnfolder]: For 10070/10070 co-relation queries the response was YES. [2022-12-13 11:09:24,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 752 events. 374/752 cut-off events. For 10070/10070 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3870 event pairs, 169 based on Foata normal form. 32/777 useless extension candidates. Maximal degree in co-relation 5345. Up to 599 conditions per place. [2022-12-13 11:09:24,216 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 129 selfloop transitions, 2 changer transitions 14/145 dead transitions. [2022-12-13 11:09:24,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 145 transitions, 2497 flow [2022-12-13 11:09:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:09:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:09:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-13 11:09:24,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2022-12-13 11:09:24,226 INFO L175 Difference]: Start difference. First operand has 124 places, 180 transitions, 3175 flow. Second operand 4 states and 58 transitions. [2022-12-13 11:09:24,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 145 transitions, 2497 flow [2022-12-13 11:09:24,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 145 transitions, 2181 flow, removed 36 selfloop flow, removed 19 redundant places. [2022-12-13 11:09:24,258 INFO L231 Difference]: Finished difference. Result has 105 places, 121 transitions, 1641 flow [2022-12-13 11:09:24,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1821, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1641, PETRI_PLACES=105, PETRI_TRANSITIONS=121} [2022-12-13 11:09:24,259 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 83 predicate places. [2022-12-13 11:09:24,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:09:24,259 INFO L89 Accepts]: Start accepts. Operand has 105 places, 121 transitions, 1641 flow [2022-12-13 11:09:24,261 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:09:24,261 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:09:24,261 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 121 transitions, 1641 flow [2022-12-13 11:09:24,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 121 transitions, 1641 flow [2022-12-13 11:09:24,303 INFO L130 PetriNetUnfolder]: 90/294 cut-off events. [2022-12-13 11:09:24,303 INFO L131 PetriNetUnfolder]: For 1330/1330 co-relation queries the response was YES. [2022-12-13 11:09:24,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 294 events. 90/294 cut-off events. For 1330/1330 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1624 event pairs, 6 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 1575. Up to 72 conditions per place. [2022-12-13 11:09:24,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 121 transitions, 1641 flow [2022-12-13 11:09:24,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-13 11:09:24,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:09:24,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:09:24,601 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 11:09:24,664 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:09:24,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 405 [2022-12-13 11:09:24,664 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 119 transitions, 1635 flow [2022-12-13 11:09:24,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:24,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:24,665 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:24,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 11:09:24,665 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:09:24,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:24,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1417988295, now seen corresponding path program 1 times [2022-12-13 11:09:24,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:24,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229204774] [2022-12-13 11:09:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:24,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:25,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:09:25,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229204774] [2022-12-13 11:09:25,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229204774] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:09:25,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106766059] [2022-12-13 11:09:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:25,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:09:25,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:09:25,819 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:09:25,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 11:09:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:25,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 11:09:25,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:09:25,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:09:26,006 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-13 11:09:26,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-13 11:09:26,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-12-13 11:09:26,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 21 [2022-12-13 11:09:26,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:09:26,065 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-12-13 11:09:26,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 42 [2022-12-13 11:09:26,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-13 11:09:26,085 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:09:26,087 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 91 [2022-12-13 11:09:26,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:09:26,270 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 11:09:26,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 189 [2022-12-13 11:09:26,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-13 11:09:26,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:09:26,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-12-13 11:09:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:26,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:09:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:26,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106766059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:09:26,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:09:26,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 11:09:26,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192694888] [2022-12-13 11:09:26,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:09:26,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:09:26,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:09:26,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:09:26,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:09:26,686 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 11:09:26,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 119 transitions, 1635 flow. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:26,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:09:26,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 11:09:26,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:09:27,791 INFO L130 PetriNetUnfolder]: 358/695 cut-off events. [2022-12-13 11:09:27,791 INFO L131 PetriNetUnfolder]: For 4402/4402 co-relation queries the response was YES. [2022-12-13 11:09:27,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 695 events. 358/695 cut-off events. For 4402/4402 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3349 event pairs, 44 based on Foata normal form. 6/694 useless extension candidates. Maximal degree in co-relation 4335. Up to 370 conditions per place. [2022-12-13 11:09:27,795 INFO L137 encePairwiseOnDemand]: 8/35 looper letters, 64 selfloop transitions, 72 changer transitions 24/160 dead transitions. [2022-12-13 11:09:27,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 160 transitions, 2251 flow [2022-12-13 11:09:27,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:09:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 11:09:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2022-12-13 11:09:27,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1934065934065934 [2022-12-13 11:09:27,796 INFO L175 Difference]: Start difference. First operand has 97 places, 119 transitions, 1635 flow. Second operand 13 states and 88 transitions. [2022-12-13 11:09:27,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 160 transitions, 2251 flow [2022-12-13 11:09:27,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 160 transitions, 2187 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-12-13 11:09:27,812 INFO L231 Difference]: Finished difference. Result has 107 places, 123 transitions, 1821 flow [2022-12-13 11:09:27,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1821, PETRI_PLACES=107, PETRI_TRANSITIONS=123} [2022-12-13 11:09:27,812 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 85 predicate places. [2022-12-13 11:09:27,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:09:27,812 INFO L89 Accepts]: Start accepts. Operand has 107 places, 123 transitions, 1821 flow [2022-12-13 11:09:27,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:09:27,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:09:27,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 123 transitions, 1821 flow [2022-12-13 11:09:27,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 123 transitions, 1821 flow [2022-12-13 11:09:27,844 INFO L130 PetriNetUnfolder]: 94/277 cut-off events. [2022-12-13 11:09:27,844 INFO L131 PetriNetUnfolder]: For 1635/1639 co-relation queries the response was YES. [2022-12-13 11:09:27,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 277 events. 94/277 cut-off events. For 1635/1639 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1404 event pairs, 4 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 1686. Up to 75 conditions per place. [2022-12-13 11:09:27,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 123 transitions, 1821 flow [2022-12-13 11:09:27,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-13 11:09:27,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:09:28,019 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:09:28,106 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:09:28,107 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-13 11:09:28,107 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 122 transitions, 1833 flow [2022-12-13 11:09:28,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:28,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:28,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:28,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 11:09:28,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 11:09:28,308 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:09:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1757370917, now seen corresponding path program 1 times [2022-12-13 11:09:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:28,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637896769] [2022-12-13 11:09:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:28,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:29,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:09:29,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637896769] [2022-12-13 11:09:29,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637896769] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:09:29,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987671940] [2022-12-13 11:09:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:29,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:09:29,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:09:29,438 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:09:29,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 11:09:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:29,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 11:09:29,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:09:29,714 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 11:09:29,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 11:09:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:29,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:09:29,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:09:29,922 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 130 [2022-12-13 11:09:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:30,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987671940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:09:30,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:09:30,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-13 11:09:30,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386956116] [2022-12-13 11:09:30,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:09:30,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 11:09:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:09:30,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 11:09:30,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-12-13 11:09:30,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 11:09:30,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 122 transitions, 1833 flow. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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-13 11:09:30,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:09:30,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 11:09:30,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:09:31,276 INFO L130 PetriNetUnfolder]: 347/658 cut-off events. [2022-12-13 11:09:31,277 INFO L131 PetriNetUnfolder]: For 5480/5480 co-relation queries the response was YES. [2022-12-13 11:09:31,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4594 conditions, 658 events. 347/658 cut-off events. For 5480/5480 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3084 event pairs, 22 based on Foata normal form. 5/658 useless extension candidates. Maximal degree in co-relation 4548. Up to 359 conditions per place. [2022-12-13 11:09:31,281 INFO L137 encePairwiseOnDemand]: 9/33 looper letters, 75 selfloop transitions, 87 changer transitions 16/178 dead transitions. [2022-12-13 11:09:31,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 178 transitions, 2518 flow [2022-12-13 11:09:31,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:09:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 11:09:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 116 transitions. [2022-12-13 11:09:31,282 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19528619528619529 [2022-12-13 11:09:31,282 INFO L175 Difference]: Start difference. First operand has 95 places, 122 transitions, 1833 flow. Second operand 18 states and 116 transitions. [2022-12-13 11:09:31,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 178 transitions, 2518 flow [2022-12-13 11:09:31,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 178 transitions, 2333 flow, removed 45 selfloop flow, removed 8 redundant places. [2022-12-13 11:09:31,299 INFO L231 Difference]: Finished difference. Result has 112 places, 132 transitions, 2096 flow [2022-12-13 11:09:31,299 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2096, PETRI_PLACES=112, PETRI_TRANSITIONS=132} [2022-12-13 11:09:31,299 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 90 predicate places. [2022-12-13 11:09:31,299 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:09:31,299 INFO L89 Accepts]: Start accepts. Operand has 112 places, 132 transitions, 2096 flow [2022-12-13 11:09:31,300 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:09:31,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:09:31,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 132 transitions, 2096 flow [2022-12-13 11:09:31,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 132 transitions, 2096 flow [2022-12-13 11:09:31,333 INFO L130 PetriNetUnfolder]: 95/275 cut-off events. [2022-12-13 11:09:31,333 INFO L131 PetriNetUnfolder]: For 1847/1847 co-relation queries the response was YES. [2022-12-13 11:09:31,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 275 events. 95/275 cut-off events. For 1847/1847 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1400 event pairs, 3 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 1810. Up to 80 conditions per place. [2022-12-13 11:09:31,335 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 132 transitions, 2096 flow [2022-12-13 11:09:31,335 INFO L226 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-13 11:09:31,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [802] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_472| v_~q2~0.base_232))) (and (= (+ v_~q2_back~0_381 1) v_~q2_back~0_380) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_221| 0)) (= v_~j~0_341 (+ (select .cse0 (+ (* v_~q2_front~0_296 4) v_~q2~0.offset_232)) 1)) (= (ite (= (select .cse0 (+ v_~q2~0.offset_232 (* 4 v_~q2_back~0_381))) v_~i~0_353) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_250|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_250| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_221|) (< v_~j~0_342 v_~N~0_247) (= (+ v_~q1_back~0_402 1) v_~q1_back~0_401) (= (+ v_~q2_front~0_296 1) v_~q2_front~0_295) (not (= (ite (and (< v_~q1_back~0_402 v_~n1~0_244) (<= 0 v_~q1_back~0_402)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221| (ite (and (< v_~q2_front~0_296 v_~n2~0_239) (< v_~q2_front~0_296 v_~q2_back~0_380) (<= 0 v_~q2_front~0_296)) 1 0)) (< v_~i~0_353 v_~N~0_247) (not (= (ite (and (< v_~q2_back~0_381 v_~n2~0_239) (<= 0 v_~q2_back~0_381)) 1 0) 0)) (not (= (ite (= v_~j~0_342 (select (select |v_#memory_int_472| v_~q1~0.base_263) (+ v_~q1~0.offset_263 (* v_~q1_back~0_402 4)))) 1 0) 0)))) InVars {~j~0=v_~j~0_342, ~q1~0.offset=v_~q1~0.offset_263, ~n2~0=v_~n2~0_239, ~i~0=v_~i~0_353, ~q2~0.offset=v_~q2~0.offset_232, ~n1~0=v_~n1~0_244, ~q2_front~0=v_~q2_front~0_296, ~N~0=v_~N~0_247, ~q1_back~0=v_~q1_back~0_402, ~q1~0.base=v_~q1~0.base_263, #memory_int=|v_#memory_int_472|, ~q2~0.base=v_~q2~0.base_232, ~q2_back~0=v_~q2_back~0_381} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_140|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_127|, ~j~0=v_~j~0_341, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_121|, ~q1~0.offset=v_~q1~0.offset_263, ~n2~0=v_~n2~0_239, ~i~0=v_~i~0_353, ~q2~0.offset=v_~q2~0.offset_232, ~n1~0=v_~n1~0_244, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221|, ~q2_front~0=v_~q2_front~0_295, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_148|, ~N~0=v_~N~0_247, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_148|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_121|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_221|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_250|, ~q1_back~0=v_~q1_back~0_401, ~q1~0.base=v_~q1~0.base_263, #memory_int=|v_#memory_int_472|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250|, ~q2~0.base=v_~q2~0.base_232, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_140|, ~q2_back~0=v_~q2_back~0_380} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:31,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:33,991 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:33,992 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:33,992 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:33,992 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:33,992 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:33,992 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:33,992 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:33,992 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:33,992 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:33,992 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:33,992 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:33,992 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:09:34,408 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:09:34,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3110 [2022-12-13 11:09:34,409 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 130 transitions, 2118 flow [2022-12-13 11:09:34,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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-13 11:09:34,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:34,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:34,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 11:09:34,614 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,SelfDestructingSolverStorable23 [2022-12-13 11:09:34,615 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:09:34,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:34,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1948331186, now seen corresponding path program 1 times [2022-12-13 11:09:34,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:34,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363282058] [2022-12-13 11:09:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:34,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:09:35,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363282058] [2022-12-13 11:09:35,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363282058] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:09:35,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275122354] [2022-12-13 11:09:35,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:35,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:09:35,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:09:35,648 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:09:35,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 11:09:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:35,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 11:09:35,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:09:35,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 11:09:35,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2022-12-13 11:09:35,796 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:09:35,796 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 11:09:35,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:09:36,016 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 11:09:36,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 20 [2022-12-13 11:09:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:36,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:09:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:36,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275122354] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:09:36,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:09:36,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 11:09:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665069061] [2022-12-13 11:09:36,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:09:36,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 11:09:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:09:36,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 11:09:36,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=391, Unknown=1, NotChecked=0, Total=462 [2022-12-13 11:09:36,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 11:09:36,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 130 transitions, 2118 flow. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-13 11:09:36,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:09:36,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 11:09:36,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:09:39,422 INFO L130 PetriNetUnfolder]: 451/855 cut-off events. [2022-12-13 11:09:39,422 INFO L131 PetriNetUnfolder]: For 8195/8195 co-relation queries the response was YES. [2022-12-13 11:09:39,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6222 conditions, 855 events. 451/855 cut-off events. For 8195/8195 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4275 event pairs, 29 based on Foata normal form. 3/854 useless extension candidates. Maximal degree in co-relation 6161. Up to 371 conditions per place. [2022-12-13 11:09:39,428 INFO L137 encePairwiseOnDemand]: 8/36 looper letters, 82 selfloop transitions, 132 changer transitions 24/238 dead transitions. [2022-12-13 11:09:39,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 238 transitions, 3633 flow [2022-12-13 11:09:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 11:09:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 11:09:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 152 transitions. [2022-12-13 11:09:39,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1688888888888889 [2022-12-13 11:09:39,429 INFO L175 Difference]: Start difference. First operand has 107 places, 130 transitions, 2118 flow. Second operand 25 states and 152 transitions. [2022-12-13 11:09:39,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 238 transitions, 3633 flow [2022-12-13 11:09:39,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 238 transitions, 3358 flow, removed 38 selfloop flow, removed 13 redundant places. [2022-12-13 11:09:39,455 INFO L231 Difference]: Finished difference. Result has 127 places, 170 transitions, 2939 flow [2022-12-13 11:09:39,456 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1896, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2939, PETRI_PLACES=127, PETRI_TRANSITIONS=170} [2022-12-13 11:09:39,456 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 105 predicate places. [2022-12-13 11:09:39,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:09:39,456 INFO L89 Accepts]: Start accepts. Operand has 127 places, 170 transitions, 2939 flow [2022-12-13 11:09:39,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:09:39,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:09:39,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 170 transitions, 2939 flow [2022-12-13 11:09:39,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 170 transitions, 2939 flow [2022-12-13 11:09:39,499 INFO L130 PetriNetUnfolder]: 115/335 cut-off events. [2022-12-13 11:09:39,499 INFO L131 PetriNetUnfolder]: For 2432/2433 co-relation queries the response was YES. [2022-12-13 11:09:39,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 335 events. 115/335 cut-off events. For 2432/2433 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1821 event pairs, 5 based on Foata normal form. 0/330 useless extension candidates. Maximal degree in co-relation 2439. Up to 105 conditions per place. [2022-12-13 11:09:39,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 170 transitions, 2939 flow [2022-12-13 11:09:39,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-13 11:09:39,511 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [860] L65-1-->L52: Formula: (let ((.cse1 (+ v_~q2_front~0_398 1)) (.cse0 (select |v_#memory_int_587| v_~q2~0.base_311)) (.cse2 (select |v_#memory_int_587| v_~q1~0.base_347))) (and (not (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_533) v_~q2~0.offset_311)) v_~i~0_478) 1 0) 0)) (= (+ v_~q1_back~0_544 1) v_~q1_back~0_543) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388|) (= (+ 2 v_~q2_back~0_533) v_~q2_back~0_531) (= v_~q1_front~0_498 (+ v_~q1_front~0_499 1)) (= v_~j~0_458 (+ (select .cse0 (+ v_~q2~0.offset_311 (* v_~q2_front~0_398 4))) 1)) (not (= (ite (and (<= 0 v_~q1_back~0_544) (< v_~q1_back~0_544 v_~n1~0_328)) 1 0) 0)) (< v_~i~0_478 v_~N~0_341) (not (= (ite (and (< v_~q2_back~0_531 (+ v_~n2~0_317 1)) (<= 1 v_~q2_back~0_531)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_310| (ite (and (< .cse1 v_~q2_back~0_531) (<= 0 v_~q2_front~0_398) (< v_~q2_front~0_398 v_~n2~0_317)) 1 0)) (= v_~i~0_477 (+ (select .cse2 (+ v_~q1~0.offset_347 (* v_~q1_front~0_499 4))) 1)) (= .cse1 v_~q2_front~0_397) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310| 0)) (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_531) v_~q2~0.offset_311 (- 4))) v_~i~0_477) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388|) (not (= (ite (= v_~j~0_459 (select .cse2 (+ v_~q1~0.offset_347 (* v_~q1_back~0_544 4)))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388| 0)) (< v_~i~0_477 v_~N~0_341) (not (= (ite (and (< v_~q1_front~0_499 v_~q1_back~0_543) (< v_~q1_front~0_499 v_~n1~0_328) (<= 0 v_~q1_front~0_499)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_310| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310|) (< v_~j~0_459 v_~N~0_341))) InVars {~j~0=v_~j~0_459, ~q1~0.offset=v_~q1~0.offset_347, ~n2~0=v_~n2~0_317, ~q1_front~0=v_~q1_front~0_499, ~i~0=v_~i~0_478, ~q2~0.offset=v_~q2~0.offset_311, ~n1~0=v_~n1~0_328, ~q2_front~0=v_~q2_front~0_398, ~N~0=v_~N~0_341, ~q1_back~0=v_~q1_back~0_544, ~q1~0.base=v_~q1~0.base_347, #memory_int=|v_#memory_int_587|, ~q2~0.base=v_~q2~0.base_311, ~q2_back~0=v_~q2_back~0_533} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_216|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_183|, ~j~0=v_~j~0_458, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_177|, ~q1_front~0=v_~q1_front~0_498, ~q2~0.offset=v_~q2~0.offset_311, ~n1~0=v_~n1~0_328, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_310|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_177|, ~q1_back~0=v_~q1_back~0_543, ~q1~0.base=v_~q1~0.base_347, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_239|, ~q2~0.base=v_~q2~0.base_311, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_233|, ~q2_back~0=v_~q2_back~0_531, ~q1~0.offset=v_~q1~0.offset_347, ~n2~0=v_~n2~0_317, ~i~0=v_~i~0_477, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_233|, ~q2_front~0=v_~q2_front~0_397, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_210|, ~N~0=v_~N~0_341, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_210|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388|, #memory_int=|v_#memory_int_587|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_216|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [857] L65-1-->L47-1: Formula: (and (= (+ (select (select |v_#memory_int_579| v_~q1~0.base_343) (+ v_~q1~0.offset_343 (* v_~q1_front~0_493 4))) 1) v_~i~0_473) (= |v_thread2Thread1of1ForFork1_#res#1.offset_63| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_63|) (= (ite (and (<= 0 v_~q1_front~0_493) (< v_~q1_front~0_493 v_~q1_back~0_539) (< v_~q1_front~0_493 v_~n1~0_324)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_386|) (not (< v_~j~0_454 v_~N~0_337)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_386| 0)) (= (+ v_~q1_front~0_493 1) v_~q1_front~0_492) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_386| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_386|)) InVars {~j~0=v_~j~0_454, ~q1~0.offset=v_~q1~0.offset_343, ~q1_front~0=v_~q1_front~0_493, ~q1_back~0=v_~q1_back~0_539, ~n1~0=v_~n1~0_324, ~q1~0.base=v_~q1~0.base_343, #memory_int=|v_#memory_int_579|, ~N~0=v_~N~0_337} OutVars{~j~0=v_~j~0_454, ~q1~0.offset=v_~q1~0.offset_343, ~q1_front~0=v_~q1_front~0_492, ~i~0=v_~i~0_473, ~n1~0=v_~n1~0_324, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_231|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_63|, ~N~0=v_~N~0_337, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_63|, ~q1_back~0=v_~q1_back~0_539, ~q1~0.base=v_~q1~0.base_343, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_237|, #memory_int=|v_#memory_int_579|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_386|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_231|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:40,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:40,601 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:40,680 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:40,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:41,372 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:41,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [869] L65-1-->L47-1: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_69| 0) (= (+ (select (select |v_#memory_int_608| v_~q1~0.base_365) (+ (* v_~q1_front~0_542 4) v_~q1~0.offset_365)) 1) v_~i~0_512) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_419| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_419|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_69|) (= (+ v_~q1_front~0_542 1) v_~q1_front~0_541) (not (< v_~j~0_483 v_~N~0_351)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_419| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_419| (ite (and (< v_~q1_front~0_542 v_~q1_back~0_570) (< v_~q1_front~0_542 v_~n1~0_346) (<= 0 v_~q1_front~0_542)) 1 0))) InVars {~j~0=v_~j~0_483, ~q1~0.offset=v_~q1~0.offset_365, ~q1_front~0=v_~q1_front~0_542, ~q1_back~0=v_~q1_back~0_570, ~n1~0=v_~n1~0_346, ~q1~0.base=v_~q1~0.base_365, #memory_int=|v_#memory_int_608|, ~N~0=v_~N~0_351} OutVars{~j~0=v_~j~0_483, ~q1~0.offset=v_~q1~0.offset_365, ~q1_front~0=v_~q1_front~0_541, ~i~0=v_~i~0_512, ~n1~0=v_~n1~0_346, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_259|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_69|, ~N~0=v_~N~0_351, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_419|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_69|, ~q1_back~0=v_~q1_back~0_570, ~q1~0.base=v_~q1~0.base_365, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_265|, #memory_int=|v_#memory_int_608|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_419|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_259|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:09:41,676 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 11:09:41,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2220 [2022-12-13 11:09:41,676 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 167 transitions, 2964 flow [2022-12-13 11:09:41,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-13 11:09:41,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:41,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:41,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 11:09:41,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:09:41,885 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:09:41,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:41,887 INFO L85 PathProgramCache]: Analyzing trace with hash 295414340, now seen corresponding path program 1 times [2022-12-13 11:09:41,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:41,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432664088] [2022-12-13 11:09:41,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:41,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:09:41,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432664088] [2022-12-13 11:09:41,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432664088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:09:41,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:09:41,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:09:41,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815743058] [2022-12-13 11:09:41,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:09:41,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:09:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:09:41,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:09:41,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:09:41,986 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 11:09:41,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 167 transitions, 2964 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:41,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:09:41,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 11:09:41,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:09:42,244 INFO L130 PetriNetUnfolder]: 421/785 cut-off events. [2022-12-13 11:09:42,244 INFO L131 PetriNetUnfolder]: For 9030/9030 co-relation queries the response was YES. [2022-12-13 11:09:42,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6318 conditions, 785 events. 421/785 cut-off events. For 9030/9030 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3769 event pairs, 158 based on Foata normal form. 4/782 useless extension candidates. Maximal degree in co-relation 6247. Up to 425 conditions per place. [2022-12-13 11:09:42,252 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 185 selfloop transitions, 4 changer transitions 2/191 dead transitions. [2022-12-13 11:09:42,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 191 transitions, 3611 flow [2022-12-13 11:09:42,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:09:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:09:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-13 11:09:42,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2022-12-13 11:09:42,254 INFO L175 Difference]: Start difference. First operand has 122 places, 167 transitions, 2964 flow. Second operand 3 states and 61 transitions. [2022-12-13 11:09:42,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 191 transitions, 3611 flow [2022-12-13 11:09:42,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 191 transitions, 3277 flow, removed 66 selfloop flow, removed 9 redundant places. [2022-12-13 11:09:42,296 INFO L231 Difference]: Finished difference. Result has 115 places, 162 transitions, 2533 flow [2022-12-13 11:09:42,296 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2573, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2533, PETRI_PLACES=115, PETRI_TRANSITIONS=162} [2022-12-13 11:09:42,297 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 93 predicate places. [2022-12-13 11:09:42,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:09:42,297 INFO L89 Accepts]: Start accepts. Operand has 115 places, 162 transitions, 2533 flow [2022-12-13 11:09:42,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:09:42,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:09:42,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 162 transitions, 2533 flow [2022-12-13 11:09:42,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 162 transitions, 2533 flow [2022-12-13 11:09:42,335 INFO L130 PetriNetUnfolder]: 114/330 cut-off events. [2022-12-13 11:09:42,336 INFO L131 PetriNetUnfolder]: For 1790/1791 co-relation queries the response was YES. [2022-12-13 11:09:42,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 330 events. 114/330 cut-off events. For 1790/1791 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1770 event pairs, 4 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 1986. Up to 96 conditions per place. [2022-12-13 11:09:42,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 162 transitions, 2533 flow [2022-12-13 11:09:42,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-13 11:09:42,340 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:09:42,341 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 11:09:42,341 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 162 transitions, 2533 flow [2022-12-13 11:09:42,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:42,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:42,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:42,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 11:09:42,342 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:09:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1942224435, now seen corresponding path program 1 times [2022-12-13 11:09:42,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:42,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610917086] [2022-12-13 11:09:42,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:09:43,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610917086] [2022-12-13 11:09:43,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610917086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:09:43,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395604831] [2022-12-13 11:09:43,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:43,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:09:43,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:09:43,572 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:09:43,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 11:09:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:09:43,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 11:09:43,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:09:43,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:09:43,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 11:09:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:09:44,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:09:44,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:09:44,453 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 280 [2022-12-13 11:10:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:10:06,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395604831] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:10:06,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:10:06,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 11:10:06,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712469579] [2022-12-13 11:10:06,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:10:06,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 11:10:06,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:06,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 11:10:06,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:10:06,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 11:10:06,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 162 transitions, 2533 flow. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:10:06,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:06,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 11:10:06,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:07,212 INFO L130 PetriNetUnfolder]: 439/833 cut-off events. [2022-12-13 11:10:07,212 INFO L131 PetriNetUnfolder]: For 6303/6303 co-relation queries the response was YES. [2022-12-13 11:10:07,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6017 conditions, 833 events. 439/833 cut-off events. For 6303/6303 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4198 event pairs, 31 based on Foata normal form. 13/843 useless extension candidates. Maximal degree in co-relation 5335. Up to 429 conditions per place. [2022-12-13 11:10:07,218 INFO L137 encePairwiseOnDemand]: 12/41 looper letters, 84 selfloop transitions, 121 changer transitions 16/221 dead transitions. [2022-12-13 11:10:07,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 221 transitions, 3365 flow [2022-12-13 11:10:07,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 11:10:07,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 11:10:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 130 transitions. [2022-12-13 11:10:07,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15853658536585366 [2022-12-13 11:10:07,219 INFO L175 Difference]: Start difference. First operand has 112 places, 162 transitions, 2533 flow. Second operand 20 states and 130 transitions. [2022-12-13 11:10:07,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 221 transitions, 3365 flow [2022-12-13 11:10:07,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 221 transitions, 3213 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-13 11:10:07,248 INFO L231 Difference]: Finished difference. Result has 131 places, 172 transitions, 2918 flow [2022-12-13 11:10:07,249 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2918, PETRI_PLACES=131, PETRI_TRANSITIONS=172} [2022-12-13 11:10:07,249 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 109 predicate places. [2022-12-13 11:10:07,249 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:07,249 INFO L89 Accepts]: Start accepts. Operand has 131 places, 172 transitions, 2918 flow [2022-12-13 11:10:07,250 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:07,250 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:07,250 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 172 transitions, 2918 flow [2022-12-13 11:10:07,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 172 transitions, 2918 flow [2022-12-13 11:10:07,290 INFO L130 PetriNetUnfolder]: 113/339 cut-off events. [2022-12-13 11:10:07,290 INFO L131 PetriNetUnfolder]: For 2300/2304 co-relation queries the response was YES. [2022-12-13 11:10:07,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 339 events. 113/339 cut-off events. For 2300/2304 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1871 event pairs, 3 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 2294. Up to 101 conditions per place. [2022-12-13 11:10:07,294 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 172 transitions, 2918 flow [2022-12-13 11:10:07,294 INFO L226 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-13 11:10:07,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:10:07,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [873] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_617| v_~q1~0.base_373))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_434| 0)) (= v_~q1_front~0_558 (+ v_~q1_front~0_559 1)) (< v_~j~0_492 v_~N~0_359) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_336| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_582) (< v_~q1_back~0_582 v_~n1~0_354)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_434| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_434|) (= (+ v_~q1_back~0_582 1) v_~q1_back~0_581) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_336|) (= (+ (select .cse0 (+ v_~q1~0.offset_373 (* v_~q1_front~0_559 4))) 1) v_~i~0_525) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336| (ite (= v_~j~0_492 (select .cse0 (+ v_~q1~0.offset_373 (* v_~q1_back~0_582 4)))) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_434| (ite (and (<= 0 v_~q1_front~0_559) (< v_~q1_front~0_559 v_~q1_back~0_581) (< v_~q1_front~0_559 v_~n1~0_354)) 1 0)))) InVars {~j~0=v_~j~0_492, ~q1~0.offset=v_~q1~0.offset_373, ~q1_front~0=v_~q1_front~0_559, ~q1_back~0=v_~q1_back~0_582, ~n1~0=v_~n1~0_354, ~q1~0.base=v_~q1~0.base_373, #memory_int=|v_#memory_int_617|, ~N~0=v_~N~0_359} OutVars{~j~0=v_~j~0_492, ~q1~0.offset=v_~q1~0.offset_373, ~q1_front~0=v_~q1_front~0_558, ~i~0=v_~i~0_525, ~n1~0=v_~n1~0_354, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_269|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_224|, ~N~0=v_~N~0_359, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_224|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_336|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_434|, ~q1_back~0=v_~q1_back~0_581, ~q1~0.base=v_~q1~0.base_373, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_275|, #memory_int=|v_#memory_int_617|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_434|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_269|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:10:07,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:10:07,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (not (< v_~i~0_In_3 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~i~0=v_~i~0_In_3, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_3, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:10:07,979 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:10:08,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:10:08,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:10:08,317 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 11:10:08,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1069 [2022-12-13 11:10:08,318 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 169 transitions, 2965 flow [2022-12-13 11:10:08,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:10:08,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:08,318 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:08,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 11:10:08,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 11:10:08,519 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:10:08,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1906946001, now seen corresponding path program 1 times [2022-12-13 11:10:08,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:08,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652037364] [2022-12-13 11:10:08,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:08,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:10:08,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:08,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652037364] [2022-12-13 11:10:08,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652037364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:10:08,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:10:08,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:10:08,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669070953] [2022-12-13 11:10:08,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:10:08,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:10:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:08,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:10:08,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:10:08,606 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 11:10:08,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 169 transitions, 2965 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:10:08,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:08,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 11:10:08,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:08,870 INFO L130 PetriNetUnfolder]: 363/709 cut-off events. [2022-12-13 11:10:08,870 INFO L131 PetriNetUnfolder]: For 7262/7262 co-relation queries the response was YES. [2022-12-13 11:10:08,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5472 conditions, 709 events. 363/709 cut-off events. For 7262/7262 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3411 event pairs, 52 based on Foata normal form. 22/728 useless extension candidates. Maximal degree in co-relation 5274. Up to 582 conditions per place. [2022-12-13 11:10:08,875 INFO L137 encePairwiseOnDemand]: 36/48 looper letters, 126 selfloop transitions, 18 changer transitions 15/159 dead transitions. [2022-12-13 11:10:08,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 159 transitions, 2948 flow [2022-12-13 11:10:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:10:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:10:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 11:10:08,876 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-13 11:10:08,876 INFO L175 Difference]: Start difference. First operand has 126 places, 169 transitions, 2965 flow. Second operand 3 states and 57 transitions. [2022-12-13 11:10:08,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 159 transitions, 2948 flow [2022-12-13 11:10:08,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 159 transitions, 2618 flow, removed 56 selfloop flow, removed 10 redundant places. [2022-12-13 11:10:08,899 INFO L231 Difference]: Finished difference. Result has 119 places, 143 transitions, 2139 flow [2022-12-13 11:10:08,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2139, PETRI_PLACES=119, PETRI_TRANSITIONS=143} [2022-12-13 11:10:08,900 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 97 predicate places. [2022-12-13 11:10:08,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:08,900 INFO L89 Accepts]: Start accepts. Operand has 119 places, 143 transitions, 2139 flow [2022-12-13 11:10:08,901 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:08,901 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:08,901 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 143 transitions, 2139 flow [2022-12-13 11:10:08,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 143 transitions, 2139 flow [2022-12-13 11:10:08,927 INFO L130 PetriNetUnfolder]: 92/286 cut-off events. [2022-12-13 11:10:08,927 INFO L131 PetriNetUnfolder]: For 1179/1183 co-relation queries the response was YES. [2022-12-13 11:10:08,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 286 events. 92/286 cut-off events. For 1179/1183 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1456 event pairs, 4 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 1631. Up to 75 conditions per place. [2022-12-13 11:10:08,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 143 transitions, 2139 flow [2022-12-13 11:10:08,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-13 11:10:08,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:10:09,131 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:09,131 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:09,131 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:09,131 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:09,132 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:09,132 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:09,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [883] L47-1-->L47-1: Formula: (and (= (+ v_~q1_front~0_579 1) v_~q1_front~0_578) (not (= (ite (and (<= 0 v_~q2_back~0_596) (< v_~q2_back~0_596 v_~n2~0_355)) 1 0) 0)) (< v_~i~0_546 v_~N~0_379) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_452| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_452|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_452| 0)) (not (= (ite (= v_~i~0_546 (select (select |v_#memory_int_637| v_~q2~0.base_349) (+ (* 4 v_~q2_back~0_596) v_~q2~0.offset_349))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_452| (ite (and (<= 0 v_~q1_front~0_579) (< v_~q1_front~0_579 v_~n1~0_366) (< v_~q1_front~0_579 v_~q1_back~0_601)) 1 0)) (= (+ (select (select |v_#memory_int_637| v_~q1~0.base_385) (+ v_~q1~0.offset_385 (* v_~q1_front~0_579 4))) 1) v_~i~0_545) (= (+ v_~q2_back~0_596 1) v_~q2_back~0_595)) InVars {~q1~0.offset=v_~q1~0.offset_385, ~q1_front~0=v_~q1_front~0_579, ~n2~0=v_~n2~0_355, ~q1_back~0=v_~q1_back~0_601, ~i~0=v_~i~0_546, ~n1~0=v_~n1~0_366, ~q2~0.offset=v_~q2~0.offset_349, ~q1~0.base=v_~q1~0.base_385, #memory_int=|v_#memory_int_637|, ~q2~0.base=v_~q2~0.base_349, ~N~0=v_~N~0_379, ~q2_back~0=v_~q2_back~0_596} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_244|, ~q1~0.offset=v_~q1~0.offset_385, ~q1_front~0=v_~q1_front~0_578, ~n2~0=v_~n2~0_355, ~i~0=v_~i~0_545, ~n1~0=v_~n1~0_366, ~q2~0.offset=v_~q2~0.offset_349, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_279|, ~N~0=v_~N~0_379, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_452|, ~q1_back~0=v_~q1_back~0_601, ~q1~0.base=v_~q1~0.base_385, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_285|, #memory_int=|v_#memory_int_637|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_452|, ~q2~0.base=v_~q2~0.base_349, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_279|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_244|, ~q2_back~0=v_~q2_back~0_595} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:10:09,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (not (< v_~i~0_In_3 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~i~0=v_~i~0_In_3, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_3, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:10:09,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (not (< v_~i~0_In_3 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~i~0=v_~i~0_In_3, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_3, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:10:09,622 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (not (< v_~i~0_In_3 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~i~0=v_~i~0_In_3, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_3, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:10:09,694 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (not (< v_~i~0_In_3 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~i~0=v_~i~0_In_3, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_3, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:10:09,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 11:10:09,829 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 11:10:09,977 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:10:10,151 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:10:10,255 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 11:10:10,367 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 11:10:10,457 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 11:10:10,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 11:10:10,641 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 11:10:10,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1742 [2022-12-13 11:10:10,642 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 137 transitions, 2194 flow [2022-12-13 11:10:10,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:10:10,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:10,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:10,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 11:10:10,642 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:10:10,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:10,643 INFO L85 PathProgramCache]: Analyzing trace with hash 386977351, now seen corresponding path program 1 times [2022-12-13 11:10:10,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:10,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559740902] [2022-12-13 11:10:10,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:10,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:10:11,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:11,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559740902] [2022-12-13 11:10:11,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559740902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:10:11,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500069462] [2022-12-13 11:10:11,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:11,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:10:11,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:10:11,835 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:10:11,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 11:10:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:11,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 11:10:11,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:10:12,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:10:12,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 11:10:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:10:12,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:10:12,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:10:12,334 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 128 [2022-12-13 11:10:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:10:12,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500069462] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:10:12,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:10:12,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-13 11:10:12,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635183893] [2022-12-13 11:10:12,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:10:12,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 11:10:12,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:10:12,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 11:10:12,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-12-13 11:10:12,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 11:10:12,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 137 transitions, 2194 flow. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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-13 11:10:12,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:10:12,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 11:10:12,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:10:14,297 INFO L130 PetriNetUnfolder]: 376/698 cut-off events. [2022-12-13 11:10:14,298 INFO L131 PetriNetUnfolder]: For 5249/5249 co-relation queries the response was YES. [2022-12-13 11:10:14,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 698 events. 376/698 cut-off events. For 5249/5249 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3182 event pairs, 30 based on Foata normal form. 2/695 useless extension candidates. Maximal degree in co-relation 4653. Up to 369 conditions per place. [2022-12-13 11:10:14,302 INFO L137 encePairwiseOnDemand]: 19/58 looper letters, 78 selfloop transitions, 114 changer transitions 11/203 dead transitions. [2022-12-13 11:10:14,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 203 transitions, 3222 flow [2022-12-13 11:10:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:10:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 11:10:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 131 transitions. [2022-12-13 11:10:14,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12547892720306514 [2022-12-13 11:10:14,304 INFO L175 Difference]: Start difference. First operand has 108 places, 137 transitions, 2194 flow. Second operand 18 states and 131 transitions. [2022-12-13 11:10:14,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 203 transitions, 3222 flow [2022-12-13 11:10:14,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 203 transitions, 2950 flow, removed 57 selfloop flow, removed 10 redundant places. [2022-12-13 11:10:14,324 INFO L231 Difference]: Finished difference. Result has 124 places, 164 transitions, 2801 flow [2022-12-13 11:10:14,324 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2801, PETRI_PLACES=124, PETRI_TRANSITIONS=164} [2022-12-13 11:10:14,325 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 102 predicate places. [2022-12-13 11:10:14,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:10:14,325 INFO L89 Accepts]: Start accepts. Operand has 124 places, 164 transitions, 2801 flow [2022-12-13 11:10:14,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:10:14,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:10:14,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 164 transitions, 2801 flow [2022-12-13 11:10:14,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 164 transitions, 2801 flow [2022-12-13 11:10:14,363 INFO L130 PetriNetUnfolder]: 106/289 cut-off events. [2022-12-13 11:10:14,363 INFO L131 PetriNetUnfolder]: For 1738/1738 co-relation queries the response was YES. [2022-12-13 11:10:14,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 289 events. 106/289 cut-off events. For 1738/1738 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1386 event pairs, 3 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 2103. Up to 85 conditions per place. [2022-12-13 11:10:14,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 164 transitions, 2801 flow [2022-12-13 11:10:14,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-13 11:10:20,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 11:10:20,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 11:10:20,468 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,468 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,468 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,468 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,469 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,469 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,469 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,469 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,655 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,656 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,656 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,656 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,656 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,656 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,656 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,656 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,840 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,840 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,840 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,840 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,840 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,840 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,841 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:20,841 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 11:10:21,104 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:10:21,106 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6781 [2022-12-13 11:10:21,106 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 161 transitions, 2813 flow [2022-12-13 11:10:21,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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-13 11:10:21,106 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:10:21,106 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:10:21,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 11:10:21,311 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,SelfDestructingSolverStorable28 [2022-12-13 11:10:21,312 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:10:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:10:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1477702776, now seen corresponding path program 1 times [2022-12-13 11:10:21,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:10:21,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627161696] [2022-12-13 11:10:21,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:10:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:10:22,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:10:22,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627161696] [2022-12-13 11:10:22,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627161696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:10:22,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540325923] [2022-12-13 11:10:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:10:22,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:10:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:10:22,088 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:10:22,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 11:10:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:10:22,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 11:10:22,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:10:22,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-13 11:10:22,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 11:10:22,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 11:10:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:10:22,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:10:22,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:10:22,669 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2022-12-13 11:10:22,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:10:22,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 11:10:22,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:10:22,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 11:11:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:04,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540325923] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:04,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:04,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 11:11:04,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206438319] [2022-12-13 11:11:04,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:04,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:11:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:04,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:11:04,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:11:04,090 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-13 11:11:04,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 161 transitions, 2813 flow. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:04,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:04,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-13 11:11:04,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:05,207 INFO L130 PetriNetUnfolder]: 366/672 cut-off events. [2022-12-13 11:11:05,207 INFO L131 PetriNetUnfolder]: For 5529/5529 co-relation queries the response was YES. [2022-12-13 11:11:05,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5362 conditions, 672 events. 366/672 cut-off events. For 5529/5529 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3031 event pairs, 22 based on Foata normal form. 3/668 useless extension candidates. Maximal degree in co-relation 5296. Up to 391 conditions per place. [2022-12-13 11:11:05,211 INFO L137 encePairwiseOnDemand]: 22/61 looper letters, 69 selfloop transitions, 117 changer transitions 7/193 dead transitions. [2022-12-13 11:11:05,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 193 transitions, 3372 flow [2022-12-13 11:11:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:11:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 11:11:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2022-12-13 11:11:05,212 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11782786885245902 [2022-12-13 11:11:05,213 INFO L175 Difference]: Start difference. First operand has 117 places, 161 transitions, 2813 flow. Second operand 16 states and 115 transitions. [2022-12-13 11:11:05,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 193 transitions, 3372 flow [2022-12-13 11:11:05,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 193 transitions, 3291 flow, removed 33 selfloop flow, removed 6 redundant places. [2022-12-13 11:11:05,238 INFO L231 Difference]: Finished difference. Result has 127 places, 163 transitions, 3013 flow [2022-12-13 11:11:05,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3013, PETRI_PLACES=127, PETRI_TRANSITIONS=163} [2022-12-13 11:11:05,239 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 105 predicate places. [2022-12-13 11:11:05,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:05,239 INFO L89 Accepts]: Start accepts. Operand has 127 places, 163 transitions, 3013 flow [2022-12-13 11:11:05,240 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:05,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:05,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 163 transitions, 3013 flow [2022-12-13 11:11:05,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 163 transitions, 3013 flow [2022-12-13 11:11:05,271 INFO L130 PetriNetUnfolder]: 107/289 cut-off events. [2022-12-13 11:11:05,271 INFO L131 PetriNetUnfolder]: For 1909/1909 co-relation queries the response was YES. [2022-12-13 11:11:05,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 289 events. 107/289 cut-off events. For 1909/1909 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1397 event pairs, 4 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 2217. Up to 85 conditions per place. [2022-12-13 11:11:05,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 163 transitions, 3013 flow [2022-12-13 11:11:05,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-13 11:11:05,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:11:09,568 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [894] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_661| v_~q1~0.base_393))) (and (< v_~j~0_528 v_~N~0_399) (= (+ v_~q1_front~0_591 1) v_~q1_front~0_590) (not (= (ite (and (< v_~q1_back~0_612 v_~n1~0_374) (<= 0 v_~q1_back~0_612)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_466| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_466|) (= (+ v_~q1_back~0_612 1) v_~q1_back~0_611) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370| (ite (= v_~j~0_528 (select .cse0 (+ v_~q1~0.offset_393 (* v_~q1_back~0_612 4)))) 1 0)) (= (+ (select .cse0 (+ v_~q1~0.offset_393 (* v_~q1_front~0_591 4))) 1) v_~i~0_569) (= (ite (and (<= 0 v_~q1_front~0_591) (< v_~q1_front~0_591 v_~q1_back~0_611) (< v_~q1_front~0_591 v_~n1~0_374)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_466|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_466| 0)))) InVars {~j~0=v_~j~0_528, ~q1~0.offset=v_~q1~0.offset_393, ~q1_front~0=v_~q1_front~0_591, ~q1_back~0=v_~q1_back~0_612, ~n1~0=v_~n1~0_374, ~q1~0.base=v_~q1~0.base_393, #memory_int=|v_#memory_int_661|, ~N~0=v_~N~0_399} OutVars{~j~0=v_~j~0_528, ~q1~0.offset=v_~q1~0.offset_393, ~q1_front~0=v_~q1_front~0_590, ~i~0=v_~i~0_569, ~n1~0=v_~n1~0_374, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_285|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_234|, ~N~0=v_~N~0_399, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_234|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_466|, ~q1_back~0=v_~q1_back~0_611, ~q1~0.base=v_~q1~0.base_393, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_291|, #memory_int=|v_#memory_int_661|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_466|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_285|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:11:09,702 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:11:09,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4463 [2022-12-13 11:11:09,703 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 162 transitions, 3049 flow [2022-12-13 11:11:09,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:09,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:09,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:09,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 11:11:09,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:09,907 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:11:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1851890791, now seen corresponding path program 1 times [2022-12-13 11:11:09,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:09,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131746046] [2022-12-13 11:11:09,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:09,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:11,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131746046] [2022-12-13 11:11:11,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131746046] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:11,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190313811] [2022-12-13 11:11:11,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:11,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:11,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:11:11,405 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:11:11,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 11:11:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:11,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 11:11:11,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:11,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-13 11:11:11,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 11:11:11,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 11:11:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:11,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:12,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:12,079 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2022-12-13 11:11:12,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:12,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 11:11:12,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:12,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 11:11:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:47,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190313811] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:47,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:47,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 11:11:47,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241266821] [2022-12-13 11:11:47,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:47,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 11:11:47,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:47,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 11:11:47,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:11:47,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 11:11:47,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 162 transitions, 3049 flow. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:47,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:11:47,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 11:11:47,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:11:49,227 INFO L130 PetriNetUnfolder]: 471/864 cut-off events. [2022-12-13 11:11:49,227 INFO L131 PetriNetUnfolder]: For 8926/8926 co-relation queries the response was YES. [2022-12-13 11:11:49,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7128 conditions, 864 events. 471/864 cut-off events. For 8926/8926 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4213 event pairs, 28 based on Foata normal form. 12/869 useless extension candidates. Maximal degree in co-relation 7070. Up to 423 conditions per place. [2022-12-13 11:11:49,233 INFO L137 encePairwiseOnDemand]: 17/63 looper letters, 78 selfloop transitions, 146 changer transitions 17/241 dead transitions. [2022-12-13 11:11:49,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 241 transitions, 4463 flow [2022-12-13 11:11:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 11:11:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 11:11:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 153 transitions. [2022-12-13 11:11:49,234 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12142857142857143 [2022-12-13 11:11:49,234 INFO L175 Difference]: Start difference. First operand has 124 places, 162 transitions, 3049 flow. Second operand 20 states and 153 transitions. [2022-12-13 11:11:49,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 241 transitions, 4463 flow [2022-12-13 11:11:49,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 241 transitions, 4345 flow, removed 24 selfloop flow, removed 7 redundant places. [2022-12-13 11:11:49,267 INFO L231 Difference]: Finished difference. Result has 144 places, 192 transitions, 4128 flow [2022-12-13 11:11:49,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2962, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4128, PETRI_PLACES=144, PETRI_TRANSITIONS=192} [2022-12-13 11:11:49,267 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 122 predicate places. [2022-12-13 11:11:49,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:11:49,267 INFO L89 Accepts]: Start accepts. Operand has 144 places, 192 transitions, 4128 flow [2022-12-13 11:11:49,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:11:49,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:11:49,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 192 transitions, 4128 flow [2022-12-13 11:11:49,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 192 transitions, 4128 flow [2022-12-13 11:11:49,307 INFO L130 PetriNetUnfolder]: 130/354 cut-off events. [2022-12-13 11:11:49,307 INFO L131 PetriNetUnfolder]: For 3280/3283 co-relation queries the response was YES. [2022-12-13 11:11:49,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 354 events. 130/354 cut-off events. For 3280/3283 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1853 event pairs, 6 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 3037. Up to 110 conditions per place. [2022-12-13 11:11:49,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 192 transitions, 4128 flow [2022-12-13 11:11:49,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-13 11:11:49,311 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:11:49,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 11:11:49,312 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 192 transitions, 4128 flow [2022-12-13 11:11:49,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:11:49,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:11:49,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:49,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 11:11:49,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:49,520 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:11:49,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:49,520 INFO L85 PathProgramCache]: Analyzing trace with hash 184241834, now seen corresponding path program 1 times [2022-12-13 11:11:49,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:49,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896612855] [2022-12-13 11:11:49,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:49,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:50,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:50,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896612855] [2022-12-13 11:11:50,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896612855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:50,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507173936] [2022-12-13 11:11:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:50,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:11:50,250 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:11:50,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 11:11:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:50,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 11:11:50,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:50,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-13 11:11:50,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 11:11:50,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 11:11:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:50,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:50,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:50,760 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2022-12-13 11:11:50,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:50,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 11:11:50,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:11:50,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 11:12:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:40,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507173936] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:40,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:40,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 11:12:40,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335201606] [2022-12-13 11:12:40,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:40,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:12:40,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:40,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:12:40,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:12:40,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-13 11:12:40,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 192 transitions, 4128 flow. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:40,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:40,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-13 11:12:40,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:41,401 INFO L130 PetriNetUnfolder]: 480/873 cut-off events. [2022-12-13 11:12:41,401 INFO L131 PetriNetUnfolder]: For 11472/11472 co-relation queries the response was YES. [2022-12-13 11:12:41,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7962 conditions, 873 events. 480/873 cut-off events. For 11472/11472 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4193 event pairs, 37 based on Foata normal form. 5/869 useless extension candidates. Maximal degree in co-relation 7889. Up to 493 conditions per place. [2022-12-13 11:12:41,407 INFO L137 encePairwiseOnDemand]: 25/61 looper letters, 95 selfloop transitions, 137 changer transitions 6/238 dead transitions. [2022-12-13 11:12:41,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 238 transitions, 5075 flow [2022-12-13 11:12:41,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:12:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 11:12:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 118 transitions. [2022-12-13 11:12:41,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12090163934426229 [2022-12-13 11:12:41,410 INFO L175 Difference]: Start difference. First operand has 139 places, 192 transitions, 4128 flow. Second operand 16 states and 118 transitions. [2022-12-13 11:12:41,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 238 transitions, 5075 flow [2022-12-13 11:12:41,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 238 transitions, 4819 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-13 11:12:41,453 INFO L231 Difference]: Finished difference. Result has 152 places, 208 transitions, 4692 flow [2022-12-13 11:12:41,453 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=3888, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4692, PETRI_PLACES=152, PETRI_TRANSITIONS=208} [2022-12-13 11:12:41,454 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 130 predicate places. [2022-12-13 11:12:41,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:41,454 INFO L89 Accepts]: Start accepts. Operand has 152 places, 208 transitions, 4692 flow [2022-12-13 11:12:41,455 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:41,455 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:41,455 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 208 transitions, 4692 flow [2022-12-13 11:12:41,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 208 transitions, 4692 flow [2022-12-13 11:12:41,495 INFO L130 PetriNetUnfolder]: 137/372 cut-off events. [2022-12-13 11:12:41,495 INFO L131 PetriNetUnfolder]: For 4536/4543 co-relation queries the response was YES. [2022-12-13 11:12:41,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3465 conditions, 372 events. 137/372 cut-off events. For 4536/4543 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1988 event pairs, 3 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 3189. Up to 104 conditions per place. [2022-12-13 11:12:41,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 208 transitions, 4692 flow [2022-12-13 11:12:41,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-13 11:12:41,515 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:12:41,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:12:41,667 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:12:41,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:12:41,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:12:41,887 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:12:41,888 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 434 [2022-12-13 11:12:41,888 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 207 transitions, 4738 flow [2022-12-13 11:12:41,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:41,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:41,888 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:41,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 11:12:42,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:42,089 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1336107222, now seen corresponding path program 1 times [2022-12-13 11:12:42,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:42,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812613990] [2022-12-13 11:12:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:42,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812613990] [2022-12-13 11:12:42,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812613990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:42,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:42,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:12:42,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984039104] [2022-12-13 11:12:42,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:42,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:42,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:42,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:42,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-13 11:12:42,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 207 transitions, 4738 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:42,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:42,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-13 11:12:42,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:42,498 INFO L130 PetriNetUnfolder]: 393/750 cut-off events. [2022-12-13 11:12:42,499 INFO L131 PetriNetUnfolder]: For 12749/12749 co-relation queries the response was YES. [2022-12-13 11:12:42,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7183 conditions, 750 events. 393/750 cut-off events. For 12749/12749 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3646 event pairs, 117 based on Foata normal form. 46/787 useless extension candidates. Maximal degree in co-relation 6906. Up to 532 conditions per place. [2022-12-13 11:12:42,504 INFO L137 encePairwiseOnDemand]: 47/66 looper letters, 179 selfloop transitions, 9 changer transitions 20/208 dead transitions. [2022-12-13 11:12:42,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 208 transitions, 4910 flow [2022-12-13 11:12:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:12:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 11:12:42,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32954545454545453 [2022-12-13 11:12:42,504 INFO L175 Difference]: Start difference. First operand has 151 places, 207 transitions, 4738 flow. Second operand 4 states and 87 transitions. [2022-12-13 11:12:42,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 208 transitions, 4910 flow [2022-12-13 11:12:42,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 208 transitions, 4735 flow, removed 21 selfloop flow, removed 9 redundant places. [2022-12-13 11:12:42,548 INFO L231 Difference]: Finished difference. Result has 145 places, 172 transitions, 3718 flow [2022-12-13 11:12:42,548 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=3983, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3718, PETRI_PLACES=145, PETRI_TRANSITIONS=172} [2022-12-13 11:12:42,549 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 123 predicate places. [2022-12-13 11:12:42,549 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:42,549 INFO L89 Accepts]: Start accepts. Operand has 145 places, 172 transitions, 3718 flow [2022-12-13 11:12:42,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:42,550 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:42,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 172 transitions, 3718 flow [2022-12-13 11:12:42,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 172 transitions, 3718 flow [2022-12-13 11:12:42,583 INFO L130 PetriNetUnfolder]: 105/288 cut-off events. [2022-12-13 11:12:42,584 INFO L131 PetriNetUnfolder]: For 3145/3151 co-relation queries the response was YES. [2022-12-13 11:12:42,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2635 conditions, 288 events. 105/288 cut-off events. For 3145/3151 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1402 event pairs, 2 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 2573. Up to 81 conditions per place. [2022-12-13 11:12:42,588 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 172 transitions, 3718 flow [2022-12-13 11:12:42,588 INFO L226 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-13 11:12:42,588 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:12:42,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 11:12:42,589 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 172 transitions, 3718 flow [2022-12-13 11:12:42,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:42,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:42,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:42,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 11:12:42,590 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:42,590 INFO L85 PathProgramCache]: Analyzing trace with hash -125974382, now seen corresponding path program 1 times [2022-12-13 11:12:42,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:42,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243613767] [2022-12-13 11:12:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:42,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:43,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:43,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243613767] [2022-12-13 11:12:43,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243613767] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:43,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634749769] [2022-12-13 11:12:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:43,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:43,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:12:43,212 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:43,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 11:12:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:43,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 11:12:43,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:43,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2022-12-13 11:12:43,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 11:12:43,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 11:12:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:43,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:43,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:43,809 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2022-12-13 11:12:43,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:43,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 11:12:43,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:43,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 11:13:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:35,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634749769] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:13:35,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:13:35,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 11:13:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215586170] [2022-12-13 11:13:35,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:13:35,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:13:35,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:13:35,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:13:35,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 11:13:35,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 172 transitions, 3718 flow. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:35,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:35,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 11:13:35,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:36,917 INFO L130 PetriNetUnfolder]: 382/701 cut-off events. [2022-12-13 11:13:36,917 INFO L131 PetriNetUnfolder]: For 10380/10380 co-relation queries the response was YES. [2022-12-13 11:13:36,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6703 conditions, 701 events. 382/701 cut-off events. For 10380/10380 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3196 event pairs, 18 based on Foata normal form. 1/695 useless extension candidates. Maximal degree in co-relation 6636. Up to 389 conditions per place. [2022-12-13 11:13:36,923 INFO L137 encePairwiseOnDemand]: 15/49 looper letters, 72 selfloop transitions, 129 changer transitions 8/209 dead transitions. [2022-12-13 11:13:36,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 209 transitions, 4483 flow [2022-12-13 11:13:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:13:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 11:13:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2022-12-13 11:13:36,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13137755102040816 [2022-12-13 11:13:36,924 INFO L175 Difference]: Start difference. First operand has 140 places, 172 transitions, 3718 flow. Second operand 16 states and 103 transitions. [2022-12-13 11:13:36,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 209 transitions, 4483 flow [2022-12-13 11:13:36,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 209 transitions, 4302 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-13 11:13:36,962 INFO L231 Difference]: Finished difference. Result has 152 places, 180 transitions, 4100 flow [2022-12-13 11:13:36,962 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3554, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4100, PETRI_PLACES=152, PETRI_TRANSITIONS=180} [2022-12-13 11:13:36,962 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 130 predicate places. [2022-12-13 11:13:36,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:36,963 INFO L89 Accepts]: Start accepts. Operand has 152 places, 180 transitions, 4100 flow [2022-12-13 11:13:36,963 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:36,963 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:36,963 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 180 transitions, 4100 flow [2022-12-13 11:13:36,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 180 transitions, 4100 flow [2022-12-13 11:13:36,993 INFO L130 PetriNetUnfolder]: 109/293 cut-off events. [2022-12-13 11:13:36,994 INFO L131 PetriNetUnfolder]: For 3357/3361 co-relation queries the response was YES. [2022-12-13 11:13:36,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2830 conditions, 293 events. 109/293 cut-off events. For 3357/3361 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1414 event pairs, 3 based on Foata normal form. 1/288 useless extension candidates. Maximal degree in co-relation 2773. Up to 87 conditions per place. [2022-12-13 11:13:36,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 180 transitions, 4100 flow [2022-12-13 11:13:36,998 INFO L226 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-13 11:13:37,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [893] L65-1-->L65-1: Formula: (and (< v_~j~0_525 v_~N~0_397) (= (+ v_~q1_back~0_608 1) v_~q1_back~0_607) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366| (ite (and (< v_~q2_front~0_480 v_~n2~0_373) (< v_~q2_front~0_480 v_~q2_back~0_625) (<= 0 v_~q2_front~0_480)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366| 0)) (not (= (ite (= v_~j~0_525 (select (select |v_#memory_int_659| v_~q1~0.base_391) (+ v_~q1~0.offset_391 (* v_~q1_back~0_608 4)))) 1 0) 0)) (= v_~q2_front~0_479 (+ v_~q2_front~0_480 1)) (= v_~j~0_524 (+ (select (select |v_#memory_int_659| v_~q2~0.base_367) (+ v_~q2~0.offset_367 (* v_~q2_front~0_480 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|) (not (= (ite (and (<= 0 v_~q1_back~0_608) (< v_~q1_back~0_608 v_~n1~0_372)) 1 0) 0))) InVars {~j~0=v_~j~0_525, ~q1~0.offset=v_~q1~0.offset_391, ~n2~0=v_~n2~0_373, ~q1_back~0=v_~q1_back~0_608, ~q2~0.offset=v_~q2~0.offset_367, ~n1~0=v_~n1~0_372, ~q1~0.base=v_~q1~0.base_391, #memory_int=|v_#memory_int_659|, ~q2_front~0=v_~q2_front~0_480, ~q2~0.base=v_~q2~0.base_367, ~N~0=v_~N~0_397, ~q2_back~0=v_~q2_back~0_625} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_227|, ~j~0=v_~j~0_524, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_221|, ~q1~0.offset=v_~q1~0.offset_391, ~n2~0=v_~n2~0_373, ~q2~0.offset=v_~q2~0.offset_367, ~n1~0=v_~n1~0_372, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366|, ~q2_front~0=v_~q2_front~0_479, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_232|, ~N~0=v_~N~0_397, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_232|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_221|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|, ~q1_back~0=v_~q1_back~0_607, ~q1~0.base=v_~q1~0.base_391, #memory_int=|v_#memory_int_659|, ~q2~0.base=v_~q2~0.base_367, ~q2_back~0=v_~q2_back~0_625} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:13:37,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [893] L65-1-->L65-1: Formula: (and (< v_~j~0_525 v_~N~0_397) (= (+ v_~q1_back~0_608 1) v_~q1_back~0_607) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366| (ite (and (< v_~q2_front~0_480 v_~n2~0_373) (< v_~q2_front~0_480 v_~q2_back~0_625) (<= 0 v_~q2_front~0_480)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366| 0)) (not (= (ite (= v_~j~0_525 (select (select |v_#memory_int_659| v_~q1~0.base_391) (+ v_~q1~0.offset_391 (* v_~q1_back~0_608 4)))) 1 0) 0)) (= v_~q2_front~0_479 (+ v_~q2_front~0_480 1)) (= v_~j~0_524 (+ (select (select |v_#memory_int_659| v_~q2~0.base_367) (+ v_~q2~0.offset_367 (* v_~q2_front~0_480 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|) (not (= (ite (and (<= 0 v_~q1_back~0_608) (< v_~q1_back~0_608 v_~n1~0_372)) 1 0) 0))) InVars {~j~0=v_~j~0_525, ~q1~0.offset=v_~q1~0.offset_391, ~n2~0=v_~n2~0_373, ~q1_back~0=v_~q1_back~0_608, ~q2~0.offset=v_~q2~0.offset_367, ~n1~0=v_~n1~0_372, ~q1~0.base=v_~q1~0.base_391, #memory_int=|v_#memory_int_659|, ~q2_front~0=v_~q2_front~0_480, ~q2~0.base=v_~q2~0.base_367, ~N~0=v_~N~0_397, ~q2_back~0=v_~q2_back~0_625} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_227|, ~j~0=v_~j~0_524, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_221|, ~q1~0.offset=v_~q1~0.offset_391, ~n2~0=v_~n2~0_373, ~q2~0.offset=v_~q2~0.offset_367, ~n1~0=v_~n1~0_372, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366|, ~q2_front~0=v_~q2_front~0_479, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_232|, ~N~0=v_~N~0_397, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_232|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_221|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|, ~q1_back~0=v_~q1_back~0_607, ~q1~0.base=v_~q1~0.base_391, #memory_int=|v_#memory_int_659|, ~q2~0.base=v_~q2~0.base_367, ~q2_back~0=v_~q2_back~0_625} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:13:37,266 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:13:37,269 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 306 [2022-12-13 11:13:37,269 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 179 transitions, 4097 flow [2022-12-13 11:13:37,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:37,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:37,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:37,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 11:13:37,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-13 11:13:37,470 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:13:37,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2101800305, now seen corresponding path program 1 times [2022-12-13 11:13:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:37,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194810325] [2022-12-13 11:13:37,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:38,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:38,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194810325] [2022-12-13 11:13:38,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194810325] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:13:38,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136500502] [2022-12-13 11:13:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:38,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:38,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:13:38,256 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:13:38,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 11:13:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:38,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 11:13:38,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:13:38,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-13 11:13:38,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 11:13:38,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 11:13:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:38,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:13:38,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:38,763 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2022-12-13 11:13:38,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:38,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 11:13:38,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:38,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 11:14:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:09,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136500502] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:09,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:09,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-13 11:14:09,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914934951] [2022-12-13 11:14:09,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:09,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 11:14:09,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:09,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 11:14:09,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:14:09,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 11:14:09,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 179 transitions, 4097 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:09,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:09,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 11:14:09,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:09,992 INFO L130 PetriNetUnfolder]: 386/711 cut-off events. [2022-12-13 11:14:09,992 INFO L131 PetriNetUnfolder]: For 11582/11582 co-relation queries the response was YES. [2022-12-13 11:14:09,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6954 conditions, 711 events. 386/711 cut-off events. For 11582/11582 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3236 event pairs, 34 based on Foata normal form. 3/708 useless extension candidates. Maximal degree in co-relation 6892. Up to 401 conditions per place. [2022-12-13 11:14:09,997 INFO L137 encePairwiseOnDemand]: 19/49 looper letters, 85 selfloop transitions, 104 changer transitions 19/208 dead transitions. [2022-12-13 11:14:09,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 208 transitions, 4672 flow [2022-12-13 11:14:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:14:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 11:14:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2022-12-13 11:14:09,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15070643642072212 [2022-12-13 11:14:09,998 INFO L175 Difference]: Start difference. First operand has 148 places, 179 transitions, 4097 flow. Second operand 13 states and 96 transitions. [2022-12-13 11:14:09,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 208 transitions, 4672 flow [2022-12-13 11:14:10,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 208 transitions, 4512 flow, removed 20 selfloop flow, removed 11 redundant places. [2022-12-13 11:14:10,037 INFO L231 Difference]: Finished difference. Result has 151 places, 173 transitions, 3998 flow [2022-12-13 11:14:10,037 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3948, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3998, PETRI_PLACES=151, PETRI_TRANSITIONS=173} [2022-12-13 11:14:10,037 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 129 predicate places. [2022-12-13 11:14:10,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:10,037 INFO L89 Accepts]: Start accepts. Operand has 151 places, 173 transitions, 3998 flow [2022-12-13 11:14:10,038 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:10,038 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:10,038 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 173 transitions, 3998 flow [2022-12-13 11:14:10,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 173 transitions, 3998 flow [2022-12-13 11:14:10,066 INFO L130 PetriNetUnfolder]: 107/279 cut-off events. [2022-12-13 11:14:10,066 INFO L131 PetriNetUnfolder]: For 3408/3416 co-relation queries the response was YES. [2022-12-13 11:14:10,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2788 conditions, 279 events. 107/279 cut-off events. For 3408/3416 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1292 event pairs, 3 based on Foata normal form. 1/274 useless extension candidates. Maximal degree in co-relation 2731. Up to 85 conditions per place. [2022-12-13 11:14:10,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 173 transitions, 3998 flow [2022-12-13 11:14:10,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-13 11:14:19,200 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:14:19,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9163 [2022-12-13 11:14:19,201 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 172 transitions, 4038 flow [2022-12-13 11:14:19,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:19,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:19,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:19,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 11:14:19,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 11:14:19,401 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:14:19,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash 565019692, now seen corresponding path program 1 times [2022-12-13 11:14:19,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:19,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751785016] [2022-12-13 11:14:19,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:20,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:20,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751785016] [2022-12-13 11:14:20,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751785016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:20,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285761010] [2022-12-13 11:14:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:20,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:20,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:14:20,181 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:14:20,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 11:14:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:20,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 11:14:20,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:20,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-13 11:14:20,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 11:14:20,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 22 [2022-12-13 11:14:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:20,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:20,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:20,725 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 280 treesize of output 436 [2022-12-13 11:14:20,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:20,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 222 [2022-12-13 11:14:20,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:20,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 186 [2022-12-13 11:15:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:15:17,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285761010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:15:17,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:15:17,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 11:15:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301185169] [2022-12-13 11:15:17,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:15:17,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 11:15:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:15:17,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 11:15:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:15:17,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 11:15:17,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 172 transitions, 4038 flow. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:15:17,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:15:17,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 11:15:17,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:15:18,532 INFO L130 PetriNetUnfolder]: 386/706 cut-off events. [2022-12-13 11:15:18,532 INFO L131 PetriNetUnfolder]: For 12061/12061 co-relation queries the response was YES. [2022-12-13 11:15:18,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7110 conditions, 706 events. 386/706 cut-off events. For 12061/12061 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3199 event pairs, 31 based on Foata normal form. 1/701 useless extension candidates. Maximal degree in co-relation 7048. Up to 473 conditions per place. [2022-12-13 11:15:18,537 INFO L137 encePairwiseOnDemand]: 19/45 looper letters, 104 selfloop transitions, 94 changer transitions 12/210 dead transitions. [2022-12-13 11:15:18,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 210 transitions, 4771 flow [2022-12-13 11:15:18,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:15:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 11:15:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 99 transitions. [2022-12-13 11:15:18,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14666666666666667 [2022-12-13 11:15:18,538 INFO L175 Difference]: Start difference. First operand has 143 places, 172 transitions, 4038 flow. Second operand 15 states and 99 transitions. [2022-12-13 11:15:18,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 210 transitions, 4771 flow [2022-12-13 11:15:18,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 210 transitions, 4499 flow, removed 26 selfloop flow, removed 13 redundant places. [2022-12-13 11:15:18,575 INFO L231 Difference]: Finished difference. Result has 147 places, 177 transitions, 4080 flow [2022-12-13 11:15:18,575 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3790, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4080, PETRI_PLACES=147, PETRI_TRANSITIONS=177} [2022-12-13 11:15:18,576 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 125 predicate places. [2022-12-13 11:15:18,576 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:15:18,576 INFO L89 Accepts]: Start accepts. Operand has 147 places, 177 transitions, 4080 flow [2022-12-13 11:15:18,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:15:18,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:15:18,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 177 transitions, 4080 flow [2022-12-13 11:15:18,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 177 transitions, 4080 flow [2022-12-13 11:15:18,605 INFO L130 PetriNetUnfolder]: 108/292 cut-off events. [2022-12-13 11:15:18,606 INFO L131 PetriNetUnfolder]: For 3384/3388 co-relation queries the response was YES. [2022-12-13 11:15:18,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 292 events. 108/292 cut-off events. For 3384/3388 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1410 event pairs, 4 based on Foata normal form. 1/286 useless extension candidates. Maximal degree in co-relation 2730. Up to 87 conditions per place. [2022-12-13 11:15:18,608 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 177 transitions, 4080 flow [2022-12-13 11:15:18,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-13 11:15:18,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:15:18,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:15:18,760 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:15:18,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-13 11:15:18,761 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 176 transitions, 4079 flow [2022-12-13 11:15:18,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:15:18,761 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:15:18,761 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:15:18,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 11:15:18,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:15:18,967 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:15:18,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:15:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1682140155, now seen corresponding path program 1 times [2022-12-13 11:15:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:15:18,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114062343] [2022-12-13 11:15:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:15:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:15:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:15:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:15:19,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:15:19,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114062343] [2022-12-13 11:15:19,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114062343] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:15:19,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810131268] [2022-12-13 11:15:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:15:19,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:15:19,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:15:19,779 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:15:19,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 11:15:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:15:19,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 11:15:19,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:15:19,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:15:19,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 11:15:20,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:15:20,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 11:15:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:15:20,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:15:20,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:15:20,441 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 396 [2022-12-13 11:15:20,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:15:20,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 11:15:20,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:15:20,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 11:18:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:18:40,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810131268] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:18:40,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:18:40,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 11:18:40,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418851399] [2022-12-13 11:18:40,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:18:40,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 11:18:40,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:18:40,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 11:18:40,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-12-13 11:18:40,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 11:18:40,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 176 transitions, 4079 flow. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-13 11:18:40,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:18:40,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 11:18:40,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:18:42,004 INFO L130 PetriNetUnfolder]: 456/853 cut-off events. [2022-12-13 11:18:42,005 INFO L131 PetriNetUnfolder]: For 14970/14970 co-relation queries the response was YES. [2022-12-13 11:18:42,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8083 conditions, 853 events. 456/853 cut-off events. For 14970/14970 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4254 event pairs, 29 based on Foata normal form. 5/852 useless extension candidates. Maximal degree in co-relation 8021. Up to 391 conditions per place. [2022-12-13 11:18:42,010 INFO L137 encePairwiseOnDemand]: 15/46 looper letters, 83 selfloop transitions, 139 changer transitions 43/265 dead transitions. [2022-12-13 11:18:42,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 265 transitions, 5561 flow [2022-12-13 11:18:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 11:18:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 11:18:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 156 transitions. [2022-12-13 11:18:42,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13043478260869565 [2022-12-13 11:18:42,011 INFO L175 Difference]: Start difference. First operand has 144 places, 176 transitions, 4079 flow. Second operand 26 states and 156 transitions. [2022-12-13 11:18:42,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 265 transitions, 5561 flow [2022-12-13 11:18:42,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 265 transitions, 5458 flow, removed 14 selfloop flow, removed 10 redundant places. [2022-12-13 11:18:42,059 INFO L231 Difference]: Finished difference. Result has 171 places, 192 transitions, 4855 flow [2022-12-13 11:18:42,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3978, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4855, PETRI_PLACES=171, PETRI_TRANSITIONS=192} [2022-12-13 11:18:42,059 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 149 predicate places. [2022-12-13 11:18:42,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:18:42,059 INFO L89 Accepts]: Start accepts. Operand has 171 places, 192 transitions, 4855 flow [2022-12-13 11:18:42,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:18:42,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:18:42,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 192 transitions, 4855 flow [2022-12-13 11:18:42,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 192 transitions, 4855 flow [2022-12-13 11:18:42,095 INFO L130 PetriNetUnfolder]: 122/307 cut-off events. [2022-12-13 11:18:42,095 INFO L131 PetriNetUnfolder]: For 5511/5519 co-relation queries the response was YES. [2022-12-13 11:18:42,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3436 conditions, 307 events. 122/307 cut-off events. For 5511/5519 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1472 event pairs, 5 based on Foata normal form. 2/304 useless extension candidates. Maximal degree in co-relation 3362. Up to 91 conditions per place. [2022-12-13 11:18:42,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 192 transitions, 4855 flow [2022-12-13 11:18:42,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-13 11:18:42,108 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:18:42,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:18:42,358 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:18:42,439 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [876] L65-1-->L65-1: Formula: (and (< v_~j~0_501 v_~N~0_365) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_344| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344|) (not (= (ite (= v_~j~0_501 (select (select |v_#memory_int_623| v_~q1~0.base_379) (+ v_~q1~0.offset_379 (* v_~q1_back~0_594 4)))) 1 0) 0)) (= (+ v_~q2_front~0_440 1) v_~q2_front~0_439) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_344| (ite (and (<= 0 v_~q2_front~0_440) (< v_~q2_front~0_440 v_~n2~0_343) (< v_~q2_front~0_440 v_~q2_back~0_575)) 1 0)) (= (+ v_~q1_back~0_594 1) v_~q1_back~0_593) (not (= (ite (and (<= 0 v_~q1_back~0_594) (< v_~q1_back~0_594 v_~n1~0_360)) 1 0) 0)) (= v_~j~0_500 (+ (select (select |v_#memory_int_623| v_~q2~0.base_337) (+ v_~q2~0.offset_337 (* v_~q2_front~0_440 4))) 1))) InVars {~j~0=v_~j~0_501, ~q1~0.offset=v_~q1~0.offset_379, ~n2~0=v_~n2~0_343, ~q1_back~0=v_~q1_back~0_594, ~q2~0.offset=v_~q2~0.offset_337, ~n1~0=v_~n1~0_360, ~q1~0.base=v_~q1~0.base_379, #memory_int=|v_#memory_int_623|, ~q2_front~0=v_~q2_front~0_440, ~q2~0.base=v_~q2~0.base_337, ~N~0=v_~N~0_365, ~q2_back~0=v_~q2_back~0_575} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_207|, ~j~0=v_~j~0_500, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_201|, ~q1~0.offset=v_~q1~0.offset_379, ~n2~0=v_~n2~0_343, ~q2~0.offset=v_~q2~0.offset_337, ~n1~0=v_~n1~0_360, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_344|, ~q2_front~0=v_~q2_front~0_439, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_230|, ~N~0=v_~N~0_365, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_230|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_201|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344|, ~q1_back~0=v_~q1_back~0_593, ~q1~0.base=v_~q1~0.base_379, #memory_int=|v_#memory_int_623|, ~q2~0.base=v_~q2~0.base_337, ~q2_back~0=v_~q2_back~0_575} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:18:42,568 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 11:18:42,569 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 510 [2022-12-13 11:18:42,569 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 189 transitions, 4869 flow [2022-12-13 11:18:42,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-13 11:18:42,569 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:18:42,570 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:18:42,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 11:18:42,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:18:42,779 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:18:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:18:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash 834276783, now seen corresponding path program 1 times [2022-12-13 11:18:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:18:42,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739258847] [2022-12-13 11:18:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:18:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:18:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:18:43,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739258847] [2022-12-13 11:18:43,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739258847] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:18:43,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001393678] [2022-12-13 11:18:43,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:43,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:18:43,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:18:43,732 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:18:43,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 11:18:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:43,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 11:18:43,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:18:43,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:18:43,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 11:18:44,082 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 11:18:44,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 20 [2022-12-13 11:18:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:18:44,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:18:44,523 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-13 11:18:44,523 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 352 [2022-12-13 11:18:44,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:18:44,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 11:18:44,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:18:44,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 11:19:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:19:30,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001393678] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:19:30,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:19:30,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 11:19:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833964223] [2022-12-13 11:19:30,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:19:30,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 11:19:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:30,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 11:19:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-12-13 11:19:30,319 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 11:19:30,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 189 transitions, 4869 flow. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-13 11:19:30,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:19:30,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 11:19:30,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:19:34,104 INFO L130 PetriNetUnfolder]: 488/897 cut-off events. [2022-12-13 11:19:34,104 INFO L131 PetriNetUnfolder]: For 21643/21643 co-relation queries the response was YES. [2022-12-13 11:19:34,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9816 conditions, 897 events. 488/897 cut-off events. For 21643/21643 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4405 event pairs, 35 based on Foata normal form. 3/895 useless extension candidates. Maximal degree in co-relation 9737. Up to 397 conditions per place. [2022-12-13 11:19:34,112 INFO L137 encePairwiseOnDemand]: 17/46 looper letters, 97 selfloop transitions, 162 changer transitions 40/299 dead transitions. [2022-12-13 11:19:34,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 299 transitions, 6929 flow [2022-12-13 11:19:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:19:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 11:19:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 157 transitions. [2022-12-13 11:19:34,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12640901771336555 [2022-12-13 11:19:34,113 INFO L175 Difference]: Start difference. First operand has 157 places, 189 transitions, 4869 flow. Second operand 27 states and 157 transitions. [2022-12-13 11:19:34,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 299 transitions, 6929 flow [2022-12-13 11:19:34,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 299 transitions, 6439 flow, removed 81 selfloop flow, removed 15 redundant places. [2022-12-13 11:19:34,187 INFO L231 Difference]: Finished difference. Result has 179 places, 224 transitions, 5830 flow [2022-12-13 11:19:34,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4465, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=5830, PETRI_PLACES=179, PETRI_TRANSITIONS=224} [2022-12-13 11:19:34,188 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 157 predicate places. [2022-12-13 11:19:34,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:19:34,188 INFO L89 Accepts]: Start accepts. Operand has 179 places, 224 transitions, 5830 flow [2022-12-13 11:19:34,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:19:34,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:19:34,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 224 transitions, 5830 flow [2022-12-13 11:19:34,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 224 transitions, 5830 flow [2022-12-13 11:19:34,234 INFO L130 PetriNetUnfolder]: 135/355 cut-off events. [2022-12-13 11:19:34,234 INFO L131 PetriNetUnfolder]: For 6724/6734 co-relation queries the response was YES. [2022-12-13 11:19:34,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3888 conditions, 355 events. 135/355 cut-off events. For 6724/6734 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1817 event pairs, 6 based on Foata normal form. 1/351 useless extension candidates. Maximal degree in co-relation 3811. Up to 99 conditions per place. [2022-12-13 11:19:34,247 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 224 transitions, 5830 flow [2022-12-13 11:19:34,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-13 11:19:34,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 11:19:40,095 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [937] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_794| v_~q1~0.base_467))) (and (not (= (ite (and (<= 0 v_~q1_back~0_721) (< v_~q1_back~0_721 v_~n1~0_446)) 1 0) 0)) (= v_~q1_back~0_720 (+ v_~q1_back~0_721 1)) (= (+ v_~q1_front~0_712 1) v_~q1_front~0_711) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_450| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_450| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_450|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_567| 0)) (< v_~j~0_630 v_~N~0_475) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_450| (ite (= v_~j~0_630 (select .cse0 (+ v_~q1~0.offset_467 (* v_~q1_back~0_721 4)))) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_567| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_567|) (= (+ (select .cse0 (+ v_~q1~0.offset_467 (* v_~q1_front~0_712 4))) 1) v_~i~0_658) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_567| (ite (and (<= 0 v_~q1_front~0_712) (< v_~q1_front~0_712 v_~n1~0_446) (< v_~q1_front~0_712 v_~q1_back~0_720)) 1 0)))) InVars {~j~0=v_~j~0_630, ~q1~0.offset=v_~q1~0.offset_467, ~q1_front~0=v_~q1_front~0_712, ~q1_back~0=v_~q1_back~0_721, ~n1~0=v_~n1~0_446, ~q1~0.base=v_~q1~0.base_467, #memory_int=|v_#memory_int_794|, ~N~0=v_~N~0_475} OutVars{~j~0=v_~j~0_630, ~q1~0.offset=v_~q1~0.offset_467, ~q1_front~0=v_~q1_front~0_711, ~i~0=v_~i~0_658, ~n1~0=v_~n1~0_446, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_355|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_450|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_280|, ~N~0=v_~N~0_475, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_280|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_450|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_567|, ~q1_back~0=v_~q1_back~0_720, ~q1~0.base=v_~q1~0.base_467, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_361|, #memory_int=|v_#memory_int_794|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_567|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_355|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 11:19:40,393 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:19:40,394 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6206 [2022-12-13 11:19:40,394 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 221 transitions, 5842 flow [2022-12-13 11:19:40,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-13 11:19:40,394 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:19:40,394 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:19:40,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 11:19:40,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 11:19:40,595 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:19:40,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:19:40,595 INFO L85 PathProgramCache]: Analyzing trace with hash -539733173, now seen corresponding path program 1 times [2022-12-13 11:19:40,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:19:40,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345102451] [2022-12-13 11:19:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:19:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:19:40,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:40,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345102451] [2022-12-13 11:19:40,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345102451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:19:40,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:19:40,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:19:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560647609] [2022-12-13 11:19:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:19:40,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:19:40,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:40,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:19:40,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:19:40,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 11:19:40,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 221 transitions, 5842 flow. Second operand has 4 states, 4 states have (on average 3.5) 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-13 11:19:40,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:19:40,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 11:19:40,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:19:41,001 INFO L130 PetriNetUnfolder]: 527/971 cut-off events. [2022-12-13 11:19:41,002 INFO L131 PetriNetUnfolder]: For 28857/28857 co-relation queries the response was YES. [2022-12-13 11:19:41,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11041 conditions, 971 events. 527/971 cut-off events. For 28857/28857 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4768 event pairs, 85 based on Foata normal form. 60/1027 useless extension candidates. Maximal degree in co-relation 10940. Up to 425 conditions per place. [2022-12-13 11:19:41,009 INFO L137 encePairwiseOnDemand]: 26/50 looper letters, 171 selfloop transitions, 82 changer transitions 8/261 dead transitions. [2022-12-13 11:19:41,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 261 transitions, 7408 flow [2022-12-13 11:19:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:19:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:19:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-13 11:19:41,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.415 [2022-12-13 11:19:41,010 INFO L175 Difference]: Start difference. First operand has 168 places, 221 transitions, 5842 flow. Second operand 4 states and 83 transitions. [2022-12-13 11:19:41,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 261 transitions, 7408 flow [2022-12-13 11:19:41,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 261 transitions, 7111 flow, removed 47 selfloop flow, removed 14 redundant places. [2022-12-13 11:19:41,104 INFO L231 Difference]: Finished difference. Result has 158 places, 215 transitions, 5895 flow [2022-12-13 11:19:41,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5052, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5895, PETRI_PLACES=158, PETRI_TRANSITIONS=215} [2022-12-13 11:19:41,105 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 136 predicate places. [2022-12-13 11:19:41,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:19:41,106 INFO L89 Accepts]: Start accepts. Operand has 158 places, 215 transitions, 5895 flow [2022-12-13 11:19:41,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:19:41,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:19:41,107 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 215 transitions, 5895 flow [2022-12-13 11:19:41,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 215 transitions, 5895 flow [2022-12-13 11:19:41,167 INFO L130 PetriNetUnfolder]: 142/390 cut-off events. [2022-12-13 11:19:41,167 INFO L131 PetriNetUnfolder]: For 8013/8028 co-relation queries the response was YES. [2022-12-13 11:19:41,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4413 conditions, 390 events. 142/390 cut-off events. For 8013/8028 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2071 event pairs, 7 based on Foata normal form. 3/387 useless extension candidates. Maximal degree in co-relation 4208. Up to 104 conditions per place. [2022-12-13 11:19:41,173 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 215 transitions, 5895 flow [2022-12-13 11:19:41,173 INFO L226 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-13 11:19:41,174 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:19:41,174 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-13 11:19:41,174 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 215 transitions, 5895 flow [2022-12-13 11:19:41,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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-13 11:19:41,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:19:41,175 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:19:41,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 11:19:41,175 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:19:41,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:19:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2011255617, now seen corresponding path program 1 times [2022-12-13 11:19:41,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:19:41,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519232668] [2022-12-13 11:19:41,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:41,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:19:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:19:41,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:41,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519232668] [2022-12-13 11:19:41,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519232668] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:19:41,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669129071] [2022-12-13 11:19:41,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:41,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:19:41,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:19:41,939 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:19:41,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 11:19:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:42,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 11:19:42,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:19:42,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-13 11:19:42,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 11:19:42,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2022-12-13 11:19:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:19:42,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:19:42,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:19:42,506 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 280 treesize of output 436 [2022-12-13 11:19:42,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:19:42,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 204 [2022-12-13 11:19:42,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:19:42,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 186 Received shutdown request... [2022-12-13 11:20:36,526 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 11:20:36,528 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 11:20:36,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 11:20:36,559 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 11:20:36,726 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,SelfDestructingSolverStorable39 [2022-12-13 11:20:36,727 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-2-5-1 context. [2022-12-13 11:20:36,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 11:20:36,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 11:20:36,729 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:20:36,732 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:20:36,733 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:20:36,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:20:36 BasicIcfg [2022-12-13 11:20:36,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:20:36,735 INFO L158 Benchmark]: Toolchain (without parser) took 780957.64ms. Allocated memory was 216.0MB in the beginning and 626.0MB in the end (delta: 410.0MB). Free memory was 191.3MB in the beginning and 393.2MB in the end (delta: -201.9MB). Peak memory consumption was 440.0MB. Max. memory is 8.0GB. [2022-12-13 11:20:36,735 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 216.0MB. Free memory was 192.9MB in the beginning and 192.8MB in the end (delta: 104.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:20:36,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.30ms. Allocated memory is still 216.0MB. Free memory was 190.8MB in the beginning and 178.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 11:20:36,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.24ms. Allocated memory is still 216.0MB. Free memory was 178.2MB in the beginning and 176.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:20:36,736 INFO L158 Benchmark]: Boogie Preprocessor took 49.43ms. Allocated memory is still 216.0MB. Free memory was 176.1MB in the beginning and 174.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:20:36,736 INFO L158 Benchmark]: RCFGBuilder took 714.38ms. Allocated memory is still 216.0MB. Free memory was 174.5MB in the beginning and 145.7MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 11:20:36,736 INFO L158 Benchmark]: TraceAbstraction took 779876.81ms. Allocated memory was 216.0MB in the beginning and 626.0MB in the end (delta: 410.0MB). Free memory was 144.6MB in the beginning and 393.2MB in the end (delta: -248.6MB). Peak memory consumption was 393.9MB. Max. memory is 8.0GB. [2022-12-13 11:20:36,738 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 216.0MB. Free memory was 192.9MB in the beginning and 192.8MB in the end (delta: 104.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.30ms. Allocated memory is still 216.0MB. Free memory was 190.8MB in the beginning and 178.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.24ms. Allocated memory is still 216.0MB. Free memory was 178.2MB in the beginning and 176.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.43ms. Allocated memory is still 216.0MB. Free memory was 176.1MB in the beginning and 174.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 714.38ms. Allocated memory is still 216.0MB. Free memory was 174.5MB in the beginning and 145.7MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 779876.81ms. Allocated memory was 216.0MB in the beginning and 626.0MB in the end (delta: 410.0MB). Free memory was 144.6MB in the beginning and 393.2MB in the end (delta: -248.6MB). Peak memory consumption was 393.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 147 PlacesBefore, 22 PlacesAfterwards, 153 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 106 TrivialYvCompositions, 19 ConcurrentYvCompositions, 9 ChoiceCompositions, 134 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 301, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 299, independent: 291, independent conditional: 0, independent unconditional: 291, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 299, independent: 291, independent conditional: 0, independent unconditional: 291, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 299, independent: 288, independent conditional: 0, independent unconditional: 288, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 299, unknown conditional: 299, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 295, Positive conditional cache size: 295, Positive unconditional cache size: 0, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 21 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 4, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 5, Positive conditional cache size: 5, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 5, Positive conditional cache size: 5, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 32 PlacesBefore, 31 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 5, Positive conditional cache size: 5, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 9, Positive conditional cache size: 9, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], 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): 16, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 36 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.9s, 72 PlacesBefore, 64 PlacesAfterwards, 114 TransitionsBefore, 106 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 12 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 30, Positive conditional cache size: 30, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 77 PlacesBefore, 73 PlacesAfterwards, 133 TransitionsBefore, 129 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 8, independent conditional: 8, 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): 47, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 88 PlacesBefore, 87 PlacesAfterwards, 150 TransitionsBefore, 149 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 42, Positive conditional cache size: 42, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 75 PlacesBefore, 75 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.4s, 83 PlacesBefore, 83 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, 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): 55, Positive cache size: 49, Positive conditional cache size: 49, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 100 PlacesBefore, 96 PlacesAfterwards, 158 TransitionsBefore, 154 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 58, Positive conditional cache size: 58, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 95 PlacesBefore, 95 PlacesAfterwards, 156 TransitionsBefore, 156 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 62, Positive conditional cache size: 62, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 134 PlacesBefore, 128 PlacesAfterwards, 216 TransitionsBefore, 210 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 76, Positive conditional cache size: 76, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 145 PlacesBefore, 144 PlacesAfterwards, 221 TransitionsBefore, 220 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 3, independent conditional: 3, 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): 93, Positive cache size: 87, Positive conditional cache size: 87, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 193 TransitionsBefore, 193 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 87, Positive conditional cache size: 87, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 123 PlacesBefore, 123 PlacesAfterwards, 185 TransitionsBefore, 185 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 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): 96, Positive cache size: 90, Positive conditional cache size: 90, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 148 PlacesBefore, 141 PlacesAfterwards, 197 TransitionsBefore, 190 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 104, Positive conditional cache size: 104, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 125 PlacesBefore, 124 PlacesAfterwards, 181 TransitionsBefore, 180 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 105, Positive conditional cache size: 105, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 99 PlacesBefore, 97 PlacesAfterwards, 121 TransitionsBefore, 119 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 106, Positive conditional cache size: 106, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 96 PlacesBefore, 95 PlacesAfterwards, 123 TransitionsBefore, 122 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 107, Positive conditional cache size: 107, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 110 PlacesBefore, 107 PlacesAfterwards, 132 TransitionsBefore, 130 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 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): 116, Positive cache size: 110, Positive conditional cache size: 110, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 124 PlacesBefore, 122 PlacesAfterwards, 170 TransitionsBefore, 167 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 116, Positive conditional cache size: 116, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 162 TransitionsBefore, 162 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 116, Positive conditional cache size: 116, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 128 PlacesBefore, 126 PlacesAfterwards, 172 TransitionsBefore, 169 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 124, Positive conditional cache size: 124, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 115 PlacesBefore, 108 PlacesAfterwards, 143 TransitionsBefore, 137 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 120 PlacesBefore, 117 PlacesAfterwards, 164 TransitionsBefore, 161 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 150, Positive conditional cache size: 150, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 125 PlacesBefore, 124 PlacesAfterwards, 163 TransitionsBefore, 162 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 152, Positive conditional cache size: 152, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 139 PlacesBefore, 139 PlacesAfterwards, 192 TransitionsBefore, 192 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 152, Positive conditional cache size: 152, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 152 PlacesBefore, 151 PlacesAfterwards, 208 TransitionsBefore, 207 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 154, Positive conditional cache size: 154, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 140 PlacesBefore, 140 PlacesAfterwards, 172 TransitionsBefore, 172 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 154, Positive conditional cache size: 154, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 150 PlacesBefore, 148 PlacesAfterwards, 180 TransitionsBefore, 179 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 156, Positive conditional cache size: 156, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1s, 144 PlacesBefore, 143 PlacesAfterwards, 173 TransitionsBefore, 172 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 156, Positive conditional cache size: 156, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 145 PlacesBefore, 144 PlacesAfterwards, 177 TransitionsBefore, 176 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 158, Positive conditional cache size: 158, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 159 PlacesBefore, 157 PlacesAfterwards, 192 TransitionsBefore, 189 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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): 170, Positive cache size: 164, Positive conditional cache size: 164, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 171 PlacesBefore, 168 PlacesAfterwards, 224 TransitionsBefore, 221 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 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): 173, Positive cache size: 167, Positive conditional cache size: 167, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 157 PlacesBefore, 157 PlacesAfterwards, 215 TransitionsBefore, 215 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 167, Positive conditional cache size: 167, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-2-5-1 context. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-2-5-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-2-5-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 171 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: 779.7s, OverallIterations: 40, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 55.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 84 mSolverCounterUnknown, 3562 SdHoareTripleChecker+Valid, 19.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3562 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 17.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1766 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17212 IncrementalHoareTripleChecker+Invalid, 19062 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1766 mSolverCounterUnsat, 0 mSDtfsCounter, 17212 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1072 GetRequests, 347 SyntacticMatches, 21 SemanticMatches, 704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4049 ImplicationChecksByTransitivity, 38.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5895occurred in iteration=39, InterpolantAutomatonStates: 520, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 572.9s InterpolantComputationTime, 830 NumberOfCodeBlocks, 830 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1044 ConstructedInterpolants, 79 QuantifiedInterpolants, 33180 SizeOfPredicates, 463 NumberOfNonLiveVariables, 5488 ConjunctsInSsa, 874 ConjunctsInUnsatCore, 86 InterpolantComputations, 16 PerfectInterpolantSequences, 25/125 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