/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:27:03,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:27:03,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:27:03,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:27:03,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:27:03,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:27:03,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:27:03,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:27:03,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:27:03,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:27:03,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:27:03,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:27:03,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:27:03,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:27:03,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:27:03,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:27:03,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:27:03,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:27:03,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:27:03,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:27:03,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:27:03,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:27:03,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:27:03,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:27:03,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:27:03,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:27:03,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:27:03,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:27:03,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:27:03,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:27:03,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:27:03,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:27:03,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:27:03,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:27:03,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:27:03,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:27:03,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:27:03,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:27:03,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:27:03,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:27:03,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:27:03,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:27:03,458 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:27:03,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:27:03,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:27:03,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:27:03,460 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:27:03,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:27:03,460 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:27:03,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:27:03,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:27:03,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:27:03,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:27:03,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:27:03,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:27:03,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:27:03,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:27:03,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:27:03,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:27:03,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:27:03,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:27:03,462 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:27:03,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:27:03,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:27:03,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:27:03,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:27:03,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:27:03,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:27:03,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:27:03,463 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:27:03,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:27:03,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:27:03,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:27:03,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:27:03,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:27:03,763 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:27:03,764 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-06 00:27:04,788 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:27:05,020 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:27:05,020 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-12-06 00:27:05,026 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f22dedd/331bec9b9f754ed9a47515e1d9700163/FLAG95b1d59b2 [2022-12-06 00:27:05,040 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f22dedd/331bec9b9f754ed9a47515e1d9700163 [2022-12-06 00:27:05,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:27:05,043 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:27:05,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:27:05,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:27:05,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:27:05,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8be2159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05, skipping insertion in model container [2022-12-06 00:27:05,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:27:05,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:27:05,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:27:05,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:27:05,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:27:05,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:27:05,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:27:05,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:27:05,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:27:05,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:27:05,197 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-06 00:27:05,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:27:05,213 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:27:05,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:27:05,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:27:05,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:27:05,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:27:05,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:27:05,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:27:05,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:27:05,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:27:05,228 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-06 00:27:05,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:27:05,239 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:27:05,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05 WrapperNode [2022-12-06 00:27:05,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:27:05,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:27:05,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:27:05,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:27:05,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,282 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 200 [2022-12-06 00:27:05,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:27:05,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:27:05,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:27:05,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:27:05,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,300 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:27:05,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:27:05,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:27:05,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:27:05,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (1/1) ... [2022-12-06 00:27:05,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:27:05,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:27:05,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:27:05,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:27:05,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:27:05,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:27:05,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:27:05,377 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:27:05,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:27:05,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:27:05,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:27:05,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:27:05,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:27:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:27:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:27:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:27:05,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:27:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:27:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:27:05,379 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:27:05,490 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:27:05,492 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:27:05,791 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:27:05,888 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:27:05,889 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 00:27:05,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:27:05 BoogieIcfgContainer [2022-12-06 00:27:05,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:27:05,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:27:05,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:27:05,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:27:05,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:27:05" (1/3) ... [2022-12-06 00:27:05,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64970b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:27:05, skipping insertion in model container [2022-12-06 00:27:05,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:05" (2/3) ... [2022-12-06 00:27:05,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64970b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:27:05, skipping insertion in model container [2022-12-06 00:27:05,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:27:05" (3/3) ... [2022-12-06 00:27:05,899 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-12-06 00:27:05,910 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:27:05,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:27:05,911 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:27:05,971 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:27:06,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 163 transitions, 342 flow [2022-12-06 00:27:06,083 INFO L130 PetriNetUnfolder]: 13/161 cut-off events. [2022-12-06 00:27:06,083 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:27:06,088 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-06 00:27:06,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 163 transitions, 342 flow [2022-12-06 00:27:06,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 153 transitions, 318 flow [2022-12-06 00:27:06,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:06,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-06 00:27:06,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 153 transitions, 318 flow [2022-12-06 00:27:06,162 INFO L130 PetriNetUnfolder]: 13/153 cut-off events. [2022-12-06 00:27:06,162 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:27:06,162 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-06 00:27:06,164 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-06 00:27:06,164 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 00:27:11,438 INFO L203 LiptonReduction]: Total number of compositions: 134 [2022-12-06 00:27:11,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:27:11,455 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;@38095a2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:27:11,455 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:27:11,458 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-06 00:27:11,458 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:27:11,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:11,459 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:11,459 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:11,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash -737479510, now seen corresponding path program 1 times [2022-12-06 00:27:11,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:11,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436144468] [2022-12-06 00:27:11,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:11,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:11,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436144468] [2022-12-06 00:27:11,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436144468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:27:11,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:27:11,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:27:11,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352995949] [2022-12-06 00:27:11,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:27:11,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:27:11,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:11,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:27:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:27:11,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:27:11,838 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-06 00:27:11,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:11,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:27:11,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:11,899 INFO L130 PetriNetUnfolder]: 81/147 cut-off events. [2022-12-06 00:27:11,899 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 00:27:11,900 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-06 00:27:11,902 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2022-12-06 00:27:11,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2022-12-06 00:27:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:27:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:27:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 00:27:11,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 00:27:11,910 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 32 transitions. [2022-12-06 00:27:11,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2022-12-06 00:27:11,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:27:11,914 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2022-12-06 00:27:11,915 INFO L276 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-06 00:27:11,917 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2022-12-06 00:27:11,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:11,918 INFO L89 Accepts]: Start accepts. Operand has 21 places, 21 transitions, 61 flow [2022-12-06 00:27:11,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:11,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:11,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-06 00:27:11,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 21 transitions, 61 flow [2022-12-06 00:27:11,936 INFO L130 PetriNetUnfolder]: 7/31 cut-off events. [2022-12-06 00:27:11,936 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:27:11,937 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-06 00:27:11,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-06 00:27:11,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 00:27:11,946 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:27:11,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 00:27:11,948 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2022-12-06 00:27:11,949 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-06 00:27:11,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:11,953 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:11,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:27:11,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:11,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:11,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1426168016, now seen corresponding path program 1 times [2022-12-06 00:27:11,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:11,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207197090] [2022-12-06 00:27:11,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:11,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:12,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:12,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207197090] [2022-12-06 00:27:12,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207197090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:27:12,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:27:12,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:27:12,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155300884] [2022-12-06 00:27:12,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:27:12,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:27:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:12,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:27:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:27:12,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:27:12,056 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-06 00:27:12,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:12,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:27:12,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:12,135 INFO L130 PetriNetUnfolder]: 77/143 cut-off events. [2022-12-06 00:27:12,135 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 00:27:12,136 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-06 00:27:12,136 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 27 selfloop transitions, 7 changer transitions 5/39 dead transitions. [2022-12-06 00:27:12,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 39 transitions, 185 flow [2022-12-06 00:27:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:27:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:27:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 00:27:12,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 00:27:12,140 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 4 states and 40 transitions. [2022-12-06 00:27:12,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 39 transitions, 185 flow [2022-12-06 00:27:12,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 39 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:27:12,141 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 99 flow [2022-12-06 00:27:12,141 INFO L276 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-06 00:27:12,141 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2022-12-06 00:27:12,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:12,142 INFO L89 Accepts]: Start accepts. Operand has 25 places, 25 transitions, 99 flow [2022-12-06 00:27:12,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:12,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:12,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 25 transitions, 99 flow [2022-12-06 00:27:12,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 99 flow [2022-12-06 00:27:12,172 INFO L130 PetriNetUnfolder]: 14/46 cut-off events. [2022-12-06 00:27:12,173 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-12-06 00:27:12,174 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 111 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-06 00:27:12,175 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 99 flow [2022-12-06 00:27:12,175 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 00:27:12,185 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:27:12,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 00:27:12,187 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 99 flow [2022-12-06 00:27:12,187 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-06 00:27:12,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:12,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:12,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:27:12,187 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1982189810, now seen corresponding path program 2 times [2022-12-06 00:27:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:12,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693801410] [2022-12-06 00:27:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:12,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:12,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:12,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693801410] [2022-12-06 00:27:12,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693801410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:27:12,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:27:12,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:27:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458012075] [2022-12-06 00:27:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:27:12,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:27:12,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:12,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:27:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:27:12,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:27:12,291 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-06 00:27:12,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:12,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:27:12,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:12,365 INFO L130 PetriNetUnfolder]: 88/162 cut-off events. [2022-12-06 00:27:12,366 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-06 00:27:12,367 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 490 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-06 00:27:12,370 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 32 selfloop transitions, 7 changer transitions 6/45 dead transitions. [2022-12-06 00:27:12,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 45 transitions, 244 flow [2022-12-06 00:27:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:27:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:27:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 00:27:12,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 00:27:12,372 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 99 flow. Second operand 5 states and 45 transitions. [2022-12-06 00:27:12,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 45 transitions, 244 flow [2022-12-06 00:27:12,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 45 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:27:12,374 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 122 flow [2022-12-06 00:27:12,375 INFO L276 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-06 00:27:12,376 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2022-12-06 00:27:12,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:12,376 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 122 flow [2022-12-06 00:27:12,377 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:12,377 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:12,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 122 flow [2022-12-06 00:27:12,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 122 flow [2022-12-06 00:27:12,384 INFO L130 PetriNetUnfolder]: 17/53 cut-off events. [2022-12-06 00:27:12,384 INFO L131 PetriNetUnfolder]: For 23/26 co-relation queries the response was YES. [2022-12-06 00:27:12,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 53 events. 17/53 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 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-06 00:27:12,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 122 flow [2022-12-06 00:27:12,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 00:27:12,386 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:27:12,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 00:27:12,388 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 122 flow [2022-12-06 00:27:12,388 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-06 00:27:12,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:12,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:12,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:27:12,388 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 552214239, now seen corresponding path program 1 times [2022-12-06 00:27:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:12,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648493382] [2022-12-06 00:27:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:12,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:12,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648493382] [2022-12-06 00:27:12,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648493382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:27:12,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:27:12,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:27:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015660721] [2022-12-06 00:27:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:27:12,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:27:12,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:12,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:27:12,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:27:12,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:27:12,494 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-06 00:27:12,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:12,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:27:12,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:12,550 INFO L130 PetriNetUnfolder]: 84/167 cut-off events. [2022-12-06 00:27:12,551 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-06 00:27:12,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 167 events. 84/167 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 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-06 00:27:12,552 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 25 selfloop transitions, 2 changer transitions 11/38 dead transitions. [2022-12-06 00:27:12,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 242 flow [2022-12-06 00:27:12,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:27:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:27:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 00:27:12,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2022-12-06 00:27:12,554 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 122 flow. Second operand 4 states and 33 transitions. [2022-12-06 00:27:12,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 242 flow [2022-12-06 00:27:12,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 229 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 00:27:12,556 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 130 flow [2022-12-06 00:27:12,557 INFO L276 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-06 00:27:12,558 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2022-12-06 00:27:12,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:12,558 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 130 flow [2022-12-06 00:27:12,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:12,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:12,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 130 flow [2022-12-06 00:27:12,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 130 flow [2022-12-06 00:27:12,566 INFO L130 PetriNetUnfolder]: 20/59 cut-off events. [2022-12-06 00:27:12,566 INFO L131 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-12-06 00:27:12,566 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 154 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-06 00:27:12,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 130 flow [2022-12-06 00:27:12,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 00:27:12,827 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:27:12,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-06 00:27:12,828 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 126 flow [2022-12-06 00:27:12,828 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-06 00:27:12,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:12,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:12,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:27:12,829 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:12,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1761523476, now seen corresponding path program 1 times [2022-12-06 00:27:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:12,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073168652] [2022-12-06 00:27:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:12,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:12,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073168652] [2022-12-06 00:27:12,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073168652] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:27:12,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203355734] [2022-12-06 00:27:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:12,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:27:12,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:27:12,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:27:12,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 00:27:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:12,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 00:27:12,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:27:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:13,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:27:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:13,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203355734] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:27:13,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:27:13,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 00:27:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920570339] [2022-12-06 00:27:13,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:27:13,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:27:13,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:13,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:27:13,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:27:13,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:27:13,023 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.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:13,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:13,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:27:13,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:13,125 INFO L130 PetriNetUnfolder]: 109/207 cut-off events. [2022-12-06 00:27:13,125 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-06 00:27:13,125 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 17. Compared 682 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-06 00:27:13,126 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 47 selfloop transitions, 15 changer transitions 4/66 dead transitions. [2022-12-06 00:27:13,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 66 transitions, 406 flow [2022-12-06 00:27:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:27:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:27:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-12-06 00:27:13,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38011695906432746 [2022-12-06 00:27:13,127 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 126 flow. Second operand 9 states and 65 transitions. [2022-12-06 00:27:13,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 66 transitions, 406 flow [2022-12-06 00:27:13,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 66 transitions, 396 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 00:27:13,130 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 218 flow [2022-12-06 00:27:13,130 INFO L276 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-06 00:27:13,130 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2022-12-06 00:27:13,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:13,130 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 218 flow [2022-12-06 00:27:13,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:13,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:13,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 218 flow [2022-12-06 00:27:13,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 218 flow [2022-12-06 00:27:13,137 INFO L130 PetriNetUnfolder]: 19/64 cut-off events. [2022-12-06 00:27:13,137 INFO L131 PetriNetUnfolder]: For 78/82 co-relation queries the response was YES. [2022-12-06 00:27:13,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 64 events. 19/64 cut-off events. For 78/82 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 172 event pairs, 2 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 179. Up to 20 conditions per place. [2022-12-06 00:27:13,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 218 flow [2022-12-06 00:27:13,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 00:27:13,229 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-06 00:27:13,329 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~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_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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-06 00:27:13,400 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:27:13,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 00:27:13,401 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 224 flow [2022-12-06 00:27:13,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:13,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:13,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:13,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 00:27:13,601 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-06 00:27:13,602 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:13,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:13,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2005601282, now seen corresponding path program 2 times [2022-12-06 00:27:13,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:13,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221377836] [2022-12-06 00:27:13,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:13,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:13,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221377836] [2022-12-06 00:27:13,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221377836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:27:13,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:27:13,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:27:13,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948106463] [2022-12-06 00:27:13,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:27:13,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:27:13,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:13,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:27:13,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:27:13,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:27:13,674 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-06 00:27:13,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:13,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:27:13,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:13,726 INFO L130 PetriNetUnfolder]: 99/176 cut-off events. [2022-12-06 00:27:13,726 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2022-12-06 00:27:13,727 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 17. Compared 504 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-06 00:27:13,727 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 30 selfloop transitions, 4 changer transitions 3/37 dead transitions. [2022-12-06 00:27:13,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 304 flow [2022-12-06 00:27:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:27:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:27:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 00:27:13,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 00:27:13,728 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 224 flow. Second operand 4 states and 32 transitions. [2022-12-06 00:27:13,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 304 flow [2022-12-06 00:27:13,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 276 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 00:27:13,730 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 183 flow [2022-12-06 00:27:13,731 INFO L276 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-06 00:27:13,731 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 20 predicate places. [2022-12-06 00:27:13,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:13,731 INFO L89 Accepts]: Start accepts. Operand has 42 places, 30 transitions, 183 flow [2022-12-06 00:27:13,732 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:13,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:13,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 183 flow [2022-12-06 00:27:13,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 183 flow [2022-12-06 00:27:13,737 INFO L130 PetriNetUnfolder]: 19/52 cut-off events. [2022-12-06 00:27:13,737 INFO L131 PetriNetUnfolder]: For 72/76 co-relation queries the response was YES. [2022-12-06 00:27:13,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 52 events. 19/52 cut-off events. For 72/76 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 116 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-06 00:27:13,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 183 flow [2022-12-06 00:27:13,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 00:27:13,740 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:27:13,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 00:27:13,741 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 183 flow [2022-12-06 00:27:13,741 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-06 00:27:13,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:13,741 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:13,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:27:13,741 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:13,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:13,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2130273651, now seen corresponding path program 1 times [2022-12-06 00:27:13,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:13,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34635677] [2022-12-06 00:27:13,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:13,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:13,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34635677] [2022-12-06 00:27:13,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34635677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:27:13,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:27:13,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:27:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317874984] [2022-12-06 00:27:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:27:13,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:27:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:27:13,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:27:13,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:27:13,803 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-06 00:27:13,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:13,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:27:13,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:13,856 INFO L130 PetriNetUnfolder]: 101/185 cut-off events. [2022-12-06 00:27:13,856 INFO L131 PetriNetUnfolder]: For 484/484 co-relation queries the response was YES. [2022-12-06 00:27:13,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 185 events. 101/185 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 488 event pairs, 50 based on Foata normal form. 10/191 useless extension candidates. Maximal degree in co-relation 530. Up to 171 conditions per place. [2022-12-06 00:27:13,857 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 29 selfloop transitions, 2 changer transitions 8/39 dead transitions. [2022-12-06 00:27:13,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 287 flow [2022-12-06 00:27:13,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:27:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:27:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 00:27:13,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2022-12-06 00:27:13,858 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 183 flow. Second operand 4 states and 35 transitions. [2022-12-06 00:27:13,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 287 flow [2022-12-06 00:27:13,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 260 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-06 00:27:13,860 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 179 flow [2022-12-06 00:27:13,860 INFO L276 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-06 00:27:13,860 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 15 predicate places. [2022-12-06 00:27:13,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:13,861 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 179 flow [2022-12-06 00:27:13,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:13,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:13,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 179 flow [2022-12-06 00:27:13,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 179 flow [2022-12-06 00:27:13,866 INFO L130 PetriNetUnfolder]: 20/54 cut-off events. [2022-12-06 00:27:13,866 INFO L131 PetriNetUnfolder]: For 42/46 co-relation queries the response was YES. [2022-12-06 00:27:13,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 54 events. 20/54 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 116 event pairs, 2 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 157. Up to 17 conditions per place. [2022-12-06 00:27:13,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 179 flow [2022-12-06 00:27:13,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 00:27:14,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:27:14,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 899 [2022-12-06 00:27:14,759 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 175 flow [2022-12-06 00:27:14,759 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-06 00:27:14,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:14,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:14,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:27:14,760 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash -898511417, now seen corresponding path program 1 times [2022-12-06 00:27:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:14,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020536780] [2022-12-06 00:27:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:14,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:15,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:15,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020536780] [2022-12-06 00:27:15,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020536780] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:27:15,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476661350] [2022-12-06 00:27:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:15,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:27:15,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:27:15,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:27:15,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 00:27:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:15,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 00:27:15,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:27:15,924 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-06 00:27:15,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:27:15,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:27:15,941 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:27:15,941 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-06 00:27:16,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:27:16,007 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 00:27:16,008 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-06 00:27:16,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:27:16,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:27:16,239 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 00:27:16,239 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-06 00:27:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:16,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:27:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:17,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476661350] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:27:17,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:27:17,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-06 00:27:17,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568473307] [2022-12-06 00:27:17,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:27:17,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 00:27:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:17,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 00:27:17,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=648, Unknown=10, NotChecked=0, Total=756 [2022-12-06 00:27:17,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:27:17,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 175 flow. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:17,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:17,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:27:17,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:20,129 INFO L130 PetriNetUnfolder]: 325/576 cut-off events. [2022-12-06 00:27:20,129 INFO L131 PetriNetUnfolder]: For 868/868 co-relation queries the response was YES. [2022-12-06 00:27:20,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 576 events. 325/576 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2470 event pairs, 14 based on Foata normal form. 11/580 useless extension candidates. Maximal degree in co-relation 2178. Up to 200 conditions per place. [2022-12-06 00:27:20,134 INFO L137 encePairwiseOnDemand]: 6/22 looper letters, 91 selfloop transitions, 82 changer transitions 16/189 dead transitions. [2022-12-06 00:27:20,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 189 transitions, 1322 flow [2022-12-06 00:27:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 00:27:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 00:27:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 179 transitions. [2022-12-06 00:27:20,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2624633431085044 [2022-12-06 00:27:20,137 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 175 flow. Second operand 31 states and 179 transitions. [2022-12-06 00:27:20,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 189 transitions, 1322 flow [2022-12-06 00:27:20,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 189 transitions, 1294 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 00:27:20,142 INFO L231 Difference]: Finished difference. Result has 78 places, 108 transitions, 987 flow [2022-12-06 00:27:20,143 INFO L276 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=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=987, PETRI_PLACES=78, PETRI_TRANSITIONS=108} [2022-12-06 00:27:20,160 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 56 predicate places. [2022-12-06 00:27:20,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:20,161 INFO L89 Accepts]: Start accepts. Operand has 78 places, 108 transitions, 987 flow [2022-12-06 00:27:20,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:20,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:20,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 108 transitions, 987 flow [2022-12-06 00:27:20,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 108 transitions, 987 flow [2022-12-06 00:27:20,189 INFO L130 PetriNetUnfolder]: 94/237 cut-off events. [2022-12-06 00:27:20,189 INFO L131 PetriNetUnfolder]: For 824/828 co-relation queries the response was YES. [2022-12-06 00:27:20,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 237 events. 94/237 cut-off events. For 824/828 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1052 event pairs, 5 based on Foata normal form. 2/238 useless extension candidates. Maximal degree in co-relation 1006. Up to 76 conditions per place. [2022-12-06 00:27:20,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 108 transitions, 987 flow [2022-12-06 00:27:20,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-06 00:27:20,226 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-06 00:27:23,138 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-06 00:27:23,297 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L52-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_92) (< v_~q1_front~0_125 v_~q1_back~0_133)) 1 0) 0)) (< v_~i~0_135 v_~N~0_86) (not (= (ite (and (<= 0 v_~q2_back~0_139) (< v_~q2_back~0_139 v_~n2~0_100)) 1 0) 0)) (= v_~q2_back~0_138 (+ v_~q2_back~0_139 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (= (ite (= (select (select |v_#memory_int_235| v_~q2~0.base_87) (+ v_~q2~0.offset_87 (* 4 v_~q2_back~0_139))) v_~i~0_135) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| 0)) (= (+ (select (select |v_#memory_int_235| v_~q1~0.base_101) (+ v_~q1~0.offset_101 (* v_~q1_front~0_125 4))) 1) v_~i~0_135)) InVars {~q1~0.offset=v_~q1~0.offset_101, ~n2~0=v_~n2~0_100, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_133, ~q2~0.offset=v_~q2~0.offset_87, ~n1~0=v_~n1~0_92, ~q1~0.base=v_~q1~0.base_101, #memory_int=|v_#memory_int_235|, ~q2~0.base=v_~q2~0.base_87, ~N~0=v_~N~0_86, ~q2_back~0=v_~q2_back~0_139} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, ~q1~0.offset=v_~q1~0.offset_101, ~n2~0=v_~n2~0_100, ~q1_front~0=v_~q1_front~0_124, ~i~0=v_~i~0_135, ~q2~0.offset=v_~q2~0.offset_87, ~n1~0=v_~n1~0_92, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_37|, ~N~0=v_~N~0_86, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, ~q1_back~0=v_~q1_back~0_133, ~q1~0.base=v_~q1~0.base_101, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_43|, ~q2~0.base=v_~q2~0.base_87, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_37|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_29|, ~q2_back~0=v_~q2_back~0_138} 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] 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-06 00:27:23,410 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:23,411 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:23,411 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:23,411 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:23,411 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:23,411 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:23,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} 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-06 00:27:25,289 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:25,289 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:25,388 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-06 00:27:25,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} 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-06 00:27:31,959 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} 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-06 00:27:32,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] 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-06 00:27:32,101 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-06 00:27:32,141 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 [717] L65-1-->L47-1: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_17| 0) (= (ite (and (< v_~q1_front~0_147 v_~q1_back~0_145) (<= 0 v_~q1_front~0_147) (< v_~q1_front~0_147 v_~n1~0_104)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (not (< v_~j~0_137 v_~N~0_100)) (= (+ (select (select |v_#memory_int_257| v_~q1~0.base_115) (+ (* v_~q1_front~0_147 4) v_~q1~0.offset_115)) 1) v_~i~0_153) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_17|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| 0)) (= v_~q1_front~0_146 (+ v_~q1_front~0_147 1))) InVars {~j~0=v_~j~0_137, ~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_147, ~q1_back~0=v_~q1_back~0_145, ~n1~0=v_~n1~0_104, ~q1~0.base=v_~q1~0.base_115, #memory_int=|v_#memory_int_257|, ~N~0=v_~N~0_100} OutVars{~j~0=v_~j~0_137, ~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_146, ~i~0=v_~i~0_153, ~n1~0=v_~n1~0_104, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_47|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_17|, ~N~0=v_~N~0_100, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_17|, ~q1_back~0=v_~q1_back~0_145, ~q1~0.base=v_~q1~0.base_115, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_53|, #memory_int=|v_#memory_int_257|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_47|} 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-06 00:27:32,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~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_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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-06 00:27:32,259 INFO L203 LiptonReduction]: Total number of compositions: 14 [2022-12-06 00:27:32,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12105 [2022-12-06 00:27:32,265 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 102 transitions, 1081 flow [2022-12-06 00:27:32,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:32,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:32,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:32,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 00:27:32,470 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-06 00:27:32,471 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:32,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:32,471 INFO L85 PathProgramCache]: Analyzing trace with hash 354599695, now seen corresponding path program 1 times [2022-12-06 00:27:32,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:32,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763855887] [2022-12-06 00:27:32,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:32,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:33,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:33,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763855887] [2022-12-06 00:27:33,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763855887] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:27:33,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204277458] [2022-12-06 00:27:33,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:33,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:27:33,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:27:33,239 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:27:33,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 00:27:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:33,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 00:27:33,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:27:33,366 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 1686 treesize of output 1654 [2022-12-06 00:27:33,379 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 14 treesize of output 14 [2022-12-06 00:27:33,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:27:33,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:27:33,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:27:33,703 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 00:27:33,704 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-06 00:27:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:33,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:27:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:34,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204277458] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:27:34,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:27:34,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-06 00:27:34,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704631586] [2022-12-06 00:27:34,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:27:34,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 00:27:34,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:34,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 00:27:34,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=427, Unknown=3, NotChecked=0, Total=506 [2022-12-06 00:27:34,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:27:34,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 102 transitions, 1081 flow. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:34,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:34,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:27:34,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:36,720 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~q2_front~0 4)) (.cse17 (* c_~q2_back~0 4))) (let ((.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q2_back~0 c_~n2~0))) (.cse2 (not (< c_~q1_back~0 c_~n1~0))) (.cse3 (not (<= 0 c_~q2_back~0))) (.cse11 (+ c_~i~0 1)) (.cse19 (+ .cse17 c_~q2~0.offset)) (.cse22 (+ c_~q2~0.offset .cse16)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (or .cse0 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 .cse3 (let ((.cse7 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230))) (let ((.cse4 (select .cse9 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse4 .cse5))) (forall ((~q2~0.base Int)) (let ((.cse6 (select .cse9 ~q2~0.base))) (or (not (= c_~i~0 (select .cse6 .cse7))) (< (select .cse6 .cse8) c_~i~0)))) (< (select .cse4 .cse10) .cse11))))) (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230))) (let ((.cse12 (select .cse15 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse12 .cse5))) (forall ((~q2~0.base Int)) (let ((.cse14 (select .cse15 ~q2~0.base))) (let ((.cse13 (select .cse14 .cse8))) (or (< .cse13 (+ (select .cse12 .cse10) 1)) (not (= c_~i~0 (select .cse14 .cse7))) (< .cse13 c_~i~0)))))))))))) (<= c_~j~0 1) (or .cse0 .cse1 .cse2 .cse3 (and (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230))) (let ((.cse21 (select .cse23 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse18 (select .cse23 ~q2~0.base))) (let ((.cse20 (select .cse18 .cse22))) (or (not (= (select .cse18 .cse19) c_~i~0)) (< .cse20 c_~i~0) (< .cse20 (+ (select .cse21 .cse10) 1)))))) (not (= c_~j~0 (select .cse21 .cse5))))))) (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230))) (let ((.cse26 (select .cse25 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse24 (select .cse25 ~q2~0.base))) (or (not (= (select .cse24 .cse19) c_~i~0)) (< (select .cse24 .cse22) c_~i~0)))) (< (select .cse26 .cse10) .cse11) (not (= c_~j~0 (select .cse26 .cse5))))))))) (= c_~i~0 1) (let ((.cse27 (select |c_#memory_int| c_~q1~0.base))) (or (not (= (select .cse27 .cse5) c_~j~0)) .cse0 .cse1 .cse2 .cse3 (let ((.cse28 (select .cse27 .cse10))) (and (or (< .cse28 .cse11) (forall ((~q2~0.base Int)) (let ((.cse29 (select |c_#memory_int| ~q2~0.base))) (or (< (select .cse29 .cse22) c_~i~0) (not (= (select .cse29 .cse19) c_~i~0)))))) (forall ((~q2~0.base Int)) (let ((.cse31 (select |c_#memory_int| ~q2~0.base))) (let ((.cse30 (select .cse31 .cse22))) (or (< .cse30 c_~i~0) (< .cse30 (+ .cse28 1)) (not (= (select .cse31 .cse19) c_~i~0)))))))))) (<= 1 c_~j~0)))) is different from false [2022-12-06 00:27:37,786 INFO L130 PetriNetUnfolder]: 579/981 cut-off events. [2022-12-06 00:27:37,786 INFO L131 PetriNetUnfolder]: For 4650/4650 co-relation queries the response was YES. [2022-12-06 00:27:37,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5587 conditions, 981 events. 579/981 cut-off events. For 4650/4650 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4610 event pairs, 9 based on Foata normal form. 8/985 useless extension candidates. Maximal degree in co-relation 5410. Up to 509 conditions per place. [2022-12-06 00:27:37,794 INFO L137 encePairwiseOnDemand]: 8/41 looper letters, 119 selfloop transitions, 168 changer transitions 17/304 dead transitions. [2022-12-06 00:27:37,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 304 transitions, 3537 flow [2022-12-06 00:27:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 00:27:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 00:27:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 207 transitions. [2022-12-06 00:27:37,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16829268292682928 [2022-12-06 00:27:37,796 INFO L175 Difference]: Start difference. First operand has 70 places, 102 transitions, 1081 flow. Second operand 30 states and 207 transitions. [2022-12-06 00:27:37,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 304 transitions, 3537 flow [2022-12-06 00:27:37,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 304 transitions, 2997 flow, removed 258 selfloop flow, removed 4 redundant places. [2022-12-06 00:27:37,819 INFO L231 Difference]: Finished difference. Result has 108 places, 230 transitions, 2782 flow [2022-12-06 00:27:37,819 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2782, PETRI_PLACES=108, PETRI_TRANSITIONS=230} [2022-12-06 00:27:37,820 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 86 predicate places. [2022-12-06 00:27:37,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:37,820 INFO L89 Accepts]: Start accepts. Operand has 108 places, 230 transitions, 2782 flow [2022-12-06 00:27:37,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:37,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:37,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 230 transitions, 2782 flow [2022-12-06 00:27:37,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 230 transitions, 2782 flow [2022-12-06 00:27:37,864 INFO L130 PetriNetUnfolder]: 225/495 cut-off events. [2022-12-06 00:27:37,864 INFO L131 PetriNetUnfolder]: For 2535/2546 co-relation queries the response was YES. [2022-12-06 00:27:37,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 495 events. 225/495 cut-off events. For 2535/2546 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2596 event pairs, 14 based on Foata normal form. 8/489 useless extension candidates. Maximal degree in co-relation 2538. Up to 177 conditions per place. [2022-12-06 00:27:37,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 230 transitions, 2782 flow [2022-12-06 00:27:37,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 506 [2022-12-06 00:27:37,878 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-06 00:27:38,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} 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-06 00:27:38,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [708] L52-->L65-1: Formula: (and (= (+ (select (select |v_#memory_int_233| v_~q1~0.base_99) (+ v_~q1~0.offset_99 (* v_~q1_front~0_121 4))) 1) v_~i~0_133) (= (+ v_~q2_front~0_118 1) v_~q2_front~0_117) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= (ite (and (<= 0 v_~q2_front~0_118) (< v_~q2_front~0_118 v_~n2~0_98) (< v_~q2_front~0_118 v_~q2_back~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~j~0_127 (+ (select (select |v_#memory_int_233| v_~q2~0.base_85) (+ v_~q2~0.offset_85 (* v_~q2_front~0_118 4))) 1)) (= (ite (and (<= 0 v_~q1_front~0_121) (< v_~q1_front~0_121 v_~q1_back~0_131) (< v_~q1_front~0_121 v_~n1~0_90)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~q1_front~0_120 (+ v_~q1_front~0_121 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| 0))) InVars {~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_121, ~q1_back~0=v_~q1_back~0_131, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, ~q2_front~0=v_~q2_front~0_118, ~q2~0.base=v_~q2~0.base_85, ~q2_back~0=v_~q2_back~0_136} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_38|, ~j~0=v_~j~0_127, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_32|, ~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_120, ~i~0=v_~i~0_133, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, ~q2_front~0=v_~q2_front~0_117, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_32|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~q1_back~0=v_~q1_back~0_131, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~q2~0.base=v_~q2~0.base_85, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_35|, ~q2_back~0=v_~q2_back~0_136} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~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_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 00:27:38,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [708] L52-->L65-1: Formula: (and (= (+ (select (select |v_#memory_int_233| v_~q1~0.base_99) (+ v_~q1~0.offset_99 (* v_~q1_front~0_121 4))) 1) v_~i~0_133) (= (+ v_~q2_front~0_118 1) v_~q2_front~0_117) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= (ite (and (<= 0 v_~q2_front~0_118) (< v_~q2_front~0_118 v_~n2~0_98) (< v_~q2_front~0_118 v_~q2_back~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~j~0_127 (+ (select (select |v_#memory_int_233| v_~q2~0.base_85) (+ v_~q2~0.offset_85 (* v_~q2_front~0_118 4))) 1)) (= (ite (and (<= 0 v_~q1_front~0_121) (< v_~q1_front~0_121 v_~q1_back~0_131) (< v_~q1_front~0_121 v_~n1~0_90)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~q1_front~0_120 (+ v_~q1_front~0_121 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| 0))) InVars {~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_121, ~q1_back~0=v_~q1_back~0_131, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, ~q2_front~0=v_~q2_front~0_118, ~q2~0.base=v_~q2~0.base_85, ~q2_back~0=v_~q2_back~0_136} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_38|, ~j~0=v_~j~0_127, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_32|, ~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_120, ~i~0=v_~i~0_133, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, ~q2_front~0=v_~q2_front~0_117, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_32|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~q1_back~0=v_~q1_back~0_131, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~q2~0.base=v_~q2~0.base_85, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_35|, ~q2_back~0=v_~q2_back~0_136} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] [2022-12-06 00:27:38,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [708] L52-->L65-1: Formula: (and (= (+ (select (select |v_#memory_int_233| v_~q1~0.base_99) (+ v_~q1~0.offset_99 (* v_~q1_front~0_121 4))) 1) v_~i~0_133) (= (+ v_~q2_front~0_118 1) v_~q2_front~0_117) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= (ite (and (<= 0 v_~q2_front~0_118) (< v_~q2_front~0_118 v_~n2~0_98) (< v_~q2_front~0_118 v_~q2_back~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~j~0_127 (+ (select (select |v_#memory_int_233| v_~q2~0.base_85) (+ v_~q2~0.offset_85 (* v_~q2_front~0_118 4))) 1)) (= (ite (and (<= 0 v_~q1_front~0_121) (< v_~q1_front~0_121 v_~q1_back~0_131) (< v_~q1_front~0_121 v_~n1~0_90)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~q1_front~0_120 (+ v_~q1_front~0_121 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| 0))) InVars {~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_121, ~q1_back~0=v_~q1_back~0_131, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, ~q2_front~0=v_~q2_front~0_118, ~q2~0.base=v_~q2~0.base_85, ~q2_back~0=v_~q2_back~0_136} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_38|, ~j~0=v_~j~0_127, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_32|, ~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_120, ~i~0=v_~i~0_133, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, ~q2_front~0=v_~q2_front~0_117, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_32|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~q1_back~0=v_~q1_back~0_131, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~q2~0.base=v_~q2~0.base_85, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_35|, ~q2_back~0=v_~q2_back~0_136} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#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-06 00:27:38,709 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-06 00:27:38,796 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-06 00:27:39,150 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:39,151 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:39,342 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-06 00:27:39,413 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} 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-06 00:27:39,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} 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-06 00:27:39,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} 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-06 00:27:39,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} 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-06 00:27:39,856 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:39,856 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:39,857 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:39,857 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:39,857 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:39,857 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:39,857 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:39,857 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:40,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| 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_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, 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_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~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_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} 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-06 00:27:40,262 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:40,263 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:40,263 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:40,263 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:40,263 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:40,263 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:40,263 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:40,263 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:40,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [743] L47-1-->L97-3: Formula: (and (= (ite (= (select (select |v_#memory_int_335| v_~q2~0.base_144) (+ v_~q2~0.offset_144 (* 4 v_~q2_back~0_220))) v_~i~0_206) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_126|) (= (store |v_#memory_int_335| |v_ULTIMATE.start_main_~#t2~0#1.base_61| (store (select |v_#memory_int_335| |v_ULTIMATE.start_main_~#t2~0#1.base_61|) |v_ULTIMATE.start_main_~#t2~0#1.offset_61| |v_ULTIMATE.start_main_#t~pre20#1_69|)) |v_#memory_int_334|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_126| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_126|) (not (= (ite (and (<= 0 v_~q2_back~0_220) (< v_~q2_back~0_220 v_~n2~0_154)) 1 0) 0)) (= (+ v_~q2_back~0_220 1) v_~q2_back~0_219) (< v_~i~0_206 v_~N~0_146) (= (+ |v_#pthreadsForks_64| 1) |v_#pthreadsForks_63|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_126| 0)) (= |v_#pthreadsForks_64| |v_ULTIMATE.start_main_#t~pre20#1_69|)) InVars {#pthreadsForks=|v_#pthreadsForks_64|, ~n2~0=v_~n2~0_154, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ~i~0=v_~i~0_206, ~q2~0.offset=v_~q2~0.offset_144, #memory_int=|v_#memory_int_335|, ~q2~0.base=v_~q2~0.base_144, ~N~0=v_~N~0_146, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_61|, ~q2_back~0=v_~q2_back~0_220} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_67|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_57|, ~n2~0=v_~n2~0_154, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ~i~0=v_~i~0_206, ~q2~0.offset=v_~q2~0.offset_144, ~N~0=v_~N~0_146, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_126|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_69|, #pthreadsForks=|v_#pthreadsForks_63|, #memory_int=|v_#memory_int_334|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_126|, ~q2~0.base=v_~q2~0.base_144, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_50|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_61|, ~q2_back~0=v_~q2_back~0_219} 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-06 00:27:40,638 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} 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-06 00:27:40,760 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-06 00:27:42,274 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| 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_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, 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_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~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_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} 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-06 00:27:42,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| 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_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, 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_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~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_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} 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 [745] L70-->L70: Formula: (and (= v_~q2_front~0_180 (+ v_~q2_front~0_181 1)) (= (ite (= v_~j~0_184 (select (select |v_#memory_int_340| v_~q1~0.base_163) (+ (* v_~q1_back~0_201 4) v_~q1~0.offset_163))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_201) (< v_~q1_back~0_201 v_~n1~0_150)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_90|) (not (= (ite (and (<= 0 v_~q2_front~0_181) (< v_~q2_front~0_181 v_~q2_back~0_227) (< v_~q2_front~0_181 v_~n2~0_158)) 1 0) 0)) (= (+ v_~q1_back~0_201 1) v_~q1_back~0_200) (< v_~j~0_184 v_~N~0_150) (= v_~j~0_184 (+ (select (select |v_#memory_int_340| v_~q2~0.base_148) (+ (* v_~q2_front~0_181 4) v_~q2~0.offset_148)) 1))) InVars {~q1~0.offset=v_~q1~0.offset_163, ~n2~0=v_~n2~0_158, ~q1_back~0=v_~q1_back~0_201, ~n1~0=v_~n1~0_150, ~q2~0.offset=v_~q2~0.offset_148, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_340|, ~q2_front~0=v_~q2_front~0_181, ~q2~0.base=v_~q2~0.base_148, ~N~0=v_~N~0_150, ~q2_back~0=v_~q2_back~0_227} OutVars{~j~0=v_~j~0_184, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_64|, ~q1~0.offset=v_~q1~0.offset_163, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_58|, ~n2~0=v_~n2~0_158, ~n1~0=v_~n1~0_150, ~q2~0.offset=v_~q2~0.offset_148, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_90|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_38|, ~q2_front~0=v_~q2_front~0_180, ~N~0=v_~N~0_150, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_38|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, ~q1_back~0=v_~q1_back~0_200, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_340|, ~q2~0.base=v_~q2~0.base_148, ~q2_back~0=v_~q2_back~0_227} 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-06 00:27:42,414 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,414 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,415 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,415 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,415 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,415 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,415 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,415 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,570 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| 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_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, 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_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~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_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} 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 [746] L70-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_342| v_~q1~0.base_165))) (and (= (+ v_~q1_back~0_205 1) v_~q1_back~0_204) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132| 0)) (not (= (ite (and (< v_~q2_front~0_185 v_~n2~0_160) (< v_~q2_front~0_185 v_~q2_back~0_229) (<= 0 v_~q2_front~0_185)) 1 0) 0)) (= (+ v_~q1_front~0_224 1) v_~q1_front~0_223) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| 0)) (= (ite (= v_~j~0_186 (select .cse0 (+ (* v_~q1_back~0_205 4) v_~q1~0.offset_165))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= v_~j~0_186 (+ (select (select |v_#memory_int_342| v_~q2~0.base_150) (+ v_~q2~0.offset_150 (* v_~q2_front~0_185 4))) 1)) (not (= (ite (and (<= 0 v_~q1_back~0_205) (< v_~q1_back~0_205 v_~n1~0_152)) 1 0) 0)) (= (ite (and (<= 0 v_~q1_front~0_224) (< v_~q1_front~0_224 v_~n1~0_152) (< v_~q1_front~0_224 v_~q1_back~0_204)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132|) (= (+ (select .cse0 (+ (* v_~q1_front~0_224 4) v_~q1~0.offset_165)) 1) v_~i~0_212) (= (+ v_~q2_front~0_185 1) v_~q2_front~0_184) (< v_~j~0_186 v_~N~0_152) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132|))) InVars {~q1~0.offset=v_~q1~0.offset_165, ~q1_front~0=v_~q1_front~0_224, ~n2~0=v_~n2~0_160, ~q1_back~0=v_~q1_back~0_205, ~n1~0=v_~n1~0_152, ~q2~0.offset=v_~q2~0.offset_150, ~q1~0.base=v_~q1~0.base_165, #memory_int=|v_#memory_int_342|, ~q2_front~0=v_~q2_front~0_185, ~q2~0.base=v_~q2~0.base_150, ~N~0=v_~N~0_152, ~q2_back~0=v_~q2_back~0_229} OutVars{~j~0=v_~j~0_186, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_66|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_60|, ~q1_front~0=v_~q1_front~0_223, ~n1~0=v_~n1~0_152, ~q2~0.offset=v_~q2~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_60|, ~q1_back~0=v_~q1_back~0_204, ~q1~0.base=v_~q1~0.base_165, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_89|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132|, ~q2~0.base=v_~q2~0.base_150, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_83|, ~q2_back~0=v_~q2_back~0_229, ~q1~0.offset=v_~q1~0.offset_165, ~n2~0=v_~n2~0_160, ~i~0=v_~i~0_212, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_83|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_40|, ~q2_front~0=v_~q2_front~0_184, ~N~0=v_~N~0_152, 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_94|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132|, #memory_int=|v_#memory_int_342|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#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_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:27:42,571 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,571 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,571 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,571 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,571 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,571 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,571 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,571 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| 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_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, 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_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~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_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} 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 [748] L70-->L65-1: Formula: (let ((.cse1 (select |v_#memory_int_344| v_~q2~0.base_152))) (let ((.cse0 (+ (select .cse1 (+ v_~q2~0.offset_152 (* v_~q2_front~0_190 4))) 1))) (and (not (= (ite (= .cse0 (select (select |v_#memory_int_344| v_~q1~0.base_167) (+ (* v_~q1_back~0_209 4) v_~q1~0.offset_167))) 1 0) 0)) (= (+ v_~q1_back~0_209 1) v_~q1_back~0_208) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_98|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< v_~q2_front~0_190 v_~n2~0_162) (< v_~q2_front~0_190 v_~q2_back~0_231) (<= 0 v_~q2_front~0_190)) 1 0) 0)) (< .cse0 v_~N~0_154) (= (ite (and (<= 1 v_~q2_front~0_188) (< v_~q2_front~0_188 (+ v_~q2_back~0_231 1)) (< v_~q2_front~0_188 (+ v_~n2~0_162 1))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_98|) (not (= (ite (and (<= 0 v_~q1_back~0_209) (< v_~q1_back~0_209 v_~n1~0_154)) 1 0) 0)) (= v_~j~0_188 (+ (select .cse1 (+ (* v_~q2_front~0_188 4) v_~q2~0.offset_152 (- 4))) 1)) (= (+ 2 v_~q2_front~0_190) v_~q2_front~0_188)))) InVars {~q1~0.offset=v_~q1~0.offset_167, ~n2~0=v_~n2~0_162, ~q1_back~0=v_~q1_back~0_209, ~q2~0.offset=v_~q2~0.offset_152, ~n1~0=v_~n1~0_154, ~q1~0.base=v_~q1~0.base_167, #memory_int=|v_#memory_int_344|, ~q2_front~0=v_~q2_front~0_190, ~q2~0.base=v_~q2~0.base_152, ~N~0=v_~N~0_154, ~q2_back~0=v_~q2_back~0_231} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_68|, ~j~0=v_~j~0_188, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_62|, ~q1~0.offset=v_~q1~0.offset_167, ~n2~0=v_~n2~0_162, ~q2~0.offset=v_~q2~0.offset_152, ~n1~0=v_~n1~0_154, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_98|, ~q2_front~0=v_~q2_front~0_188, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_42|, ~N~0=v_~N~0_154, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_42|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_62|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98|, ~q1_back~0=v_~q1_back~0_208, ~q1~0.base=v_~q1~0.base_167, #memory_int=|v_#memory_int_344|, ~q2~0.base=v_~q2~0.base_152, ~q2_back~0=v_~q2_back~0_231} 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-06 00:27:42,757 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,757 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,757 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,757 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,757 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,757 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,757 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,757 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:42,921 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| 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_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, 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_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~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_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} 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 [749] L70-->L47-1: Formula: (and (= (+ v_~q2_front~0_195 1) v_~q2_front~0_194) (= (ite (and (<= 0 v_~q2_front~0_195) (< v_~q2_front~0_195 v_~n2~0_164) (< v_~q2_front~0_195 v_~q2_back~0_233)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134| (ite (and (< v_~q1_front~0_228 v_~q1_back~0_212) (<= 0 v_~q1_front~0_228) (< v_~q1_front~0_228 v_~n1~0_156)) 1 0)) (not (< v_~j~0_192 v_~N~0_156)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_33| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_33|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_102|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_102| 0)) (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|) (= (+ v_~q1_front~0_228 1) v_~q1_front~0_227) (= v_~j~0_192 (+ (select (select |v_#memory_int_346| v_~q2~0.base_154) (+ v_~q2~0.offset_154 (* v_~q2_front~0_195 4))) 1)) (= (+ (select (select |v_#memory_int_346| v_~q1~0.base_169) (+ v_~q1~0.offset_169 (* v_~q1_front~0_228 4))) 1) v_~i~0_214)) InVars {~q1~0.offset=v_~q1~0.offset_169, ~q1_front~0=v_~q1_front~0_228, ~n2~0=v_~n2~0_164, ~q1_back~0=v_~q1_back~0_212, ~n1~0=v_~n1~0_156, ~q2~0.offset=v_~q2~0.offset_154, ~q1~0.base=v_~q1~0.base_169, #memory_int=|v_#memory_int_346|, ~q2_front~0=v_~q2_front~0_195, ~q2~0.base=v_~q2~0.base_154, ~N~0=v_~N~0_156, ~q2_back~0=v_~q2_back~0_233} OutVars{~j~0=v_~j~0_192, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_72|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_66|, ~q1_front~0=v_~q1_front~0_227, ~n1~0=v_~n1~0_156, ~q2~0.offset=v_~q2~0.offset_154, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_66|, ~q1_back~0=v_~q1_back~0_212, ~q1~0.base=v_~q1~0.base_169, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_91|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, ~q2~0.base=v_~q2~0.base_154, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_85|, ~q2_back~0=v_~q2_back~0_233, ~q1~0.offset=v_~q1~0.offset_169, ~n2~0=v_~n2~0_164, ~i~0=v_~i~0_214, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_85|, ~q2_front~0=v_~q2_front~0_194, ~N~0=v_~N~0_156, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_33|, #memory_int=|v_#memory_int_346|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:27:43,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| 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_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, 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_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~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_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} 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 [750] L70-->L47-1: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136|) (= v_~q2_front~0_198 (+ v_~q2_front~0_199 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| (ite (and (< v_~q2_front~0_199 v_~q2_back~0_235) (< v_~q2_front~0_199 v_~n2~0_166) (<= 0 v_~q2_front~0_199)) 1 0)) (= (+ (select (select |v_#memory_int_348| v_~q1~0.base_171) (+ (* v_~q1_front~0_232 4) v_~q1~0.offset_171)) 1) v_~i~0_216) (= (ite (and (< v_~q1_front~0_232 v_~n1~0_158) (<= 0 v_~q1_front~0_232) (< v_~q1_front~0_232 v_~q1_back~0_214)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|) (= v_~q1_front~0_231 (+ v_~q1_front~0_232 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136| 0)) (= v_~j~0_194 (+ (select (select |v_#memory_int_348| v_~q2~0.base_156) (+ (* v_~q2_front~0_199 4) v_~q2~0.offset_156)) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|)) InVars {~q1~0.offset=v_~q1~0.offset_171, ~q1_front~0=v_~q1_front~0_232, ~n2~0=v_~n2~0_166, ~q1_back~0=v_~q1_back~0_214, ~n1~0=v_~n1~0_158, ~q2~0.offset=v_~q2~0.offset_156, ~q1~0.base=v_~q1~0.base_171, #memory_int=|v_#memory_int_348|, ~q2_front~0=v_~q2_front~0_199, ~q2~0.base=v_~q2~0.base_156, ~q2_back~0=v_~q2_back~0_235} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_74|, ~j~0=v_~j~0_194, ~q1~0.offset=v_~q1~0.offset_171, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_68|, ~q1_front~0=v_~q1_front~0_231, ~n2~0=v_~n2~0_166, ~i~0=v_~i~0_216, ~n1~0=v_~n1~0_158, ~q2~0.offset=v_~q2~0.offset_156, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_87|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104|, ~q2_front~0=v_~q2_front~0_198, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_68|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|, ~q1_back~0=v_~q1_back~0_214, ~q1~0.base=v_~q1~0.base_171, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_93|, #memory_int=|v_#memory_int_348|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136|, ~q2~0.base=v_~q2~0.base_156, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_87|, ~q2_back~0=v_~q2_back~0_235} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:27:43,722 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,723 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,723 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,723 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,723 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,723 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,723 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,723 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,980 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,980 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,980 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,980 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,981 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,981 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,981 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:43,981 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,339 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,339 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,339 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,339 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,339 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,340 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,340 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,340 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,599 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,599 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,599 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,599 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,599 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,599 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,600 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,600 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,954 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,954 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,954 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,954 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,954 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,954 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,954 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:44,954 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:45,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [720] L52-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_267| v_~q2~0.base_105))) (and (= (+ v_~q1_front~0_157 1) v_~q1_front~0_156) (not (= (ite (and (<= 0 v_~q2_back~0_169) (< v_~q2_back~0_169 v_~n2~0_118)) 1 0) 0)) (= v_~i~0_159 (+ (select (select |v_#memory_int_267| v_~q1~0.base_121) (+ (* v_~q1_front~0_157 4) v_~q1~0.offset_121)) 1)) (< v_~i~0_159 v_~N~0_106) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (not (= (ite (and (<= 0 v_~q1_front~0_157) (< v_~q1_front~0_157 v_~n1~0_110) (< v_~q1_front~0_157 v_~q1_back~0_151)) 1 0) 0)) (= (ite (and (<= 0 v_~q2_front~0_136) (< v_~q2_front~0_136 v_~q2_back~0_168) (< v_~q2_front~0_136 v_~n2~0_118)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|) (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_169) v_~q2~0.offset_105)) v_~i~0_159) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| 0)) (= (+ v_~q2_front~0_136 1) v_~q2_front~0_135) (= (+ v_~q2_back~0_169 1) v_~q2_back~0_168) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|) (= v_~j~0_141 (+ (select .cse0 (+ (* v_~q2_front~0_136 4) v_~q2~0.offset_105)) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_121, ~n2~0=v_~n2~0_118, ~q1_front~0=v_~q1_front~0_157, ~q1_back~0=v_~q1_back~0_151, ~q2~0.offset=v_~q2~0.offset_105, ~n1~0=v_~n1~0_110, ~q1~0.base=v_~q1~0.base_121, #memory_int=|v_#memory_int_267|, ~q2_front~0=v_~q2_front~0_136, ~q2~0.base=v_~q2~0.base_105, ~N~0=v_~N~0_106, ~q2_back~0=v_~q2_back~0_169} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_41|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_44|, ~j~0=v_~j~0_141, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_38|, ~q1_front~0=v_~q1_front~0_156, ~q2~0.offset=v_~q2~0.offset_105, ~n1~0=v_~n1~0_110, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_38|, ~q1_back~0=v_~q1_back~0_151, ~q1~0.base=v_~q1~0.base_121, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_57|, ~q2~0.base=v_~q2~0.base_105, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_51|, ~q2_back~0=v_~q2_back~0_168, ~q1~0.offset=v_~q1~0.offset_121, ~n2~0=v_~n2~0_118, ~i~0=v_~i~0_159, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_51|, ~q2_front~0=v_~q2_front~0_135, ~N~0=v_~N~0_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, #memory_int=|v_#memory_int_267|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_41|} 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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#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-06 00:27:45,145 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:45,145 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:45,146 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:45,146 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:45,146 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:45,146 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:45,146 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:45,146 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:27:45,305 INFO L203 LiptonReduction]: Total number of compositions: 14 [2022-12-06 00:27:45,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7486 [2022-12-06 00:27:45,306 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 224 transitions, 2994 flow [2022-12-06 00:27:45,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:45,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:45,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:45,311 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-06 00:27:45,506 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-06 00:27:45,507 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1240262921, now seen corresponding path program 1 times [2022-12-06 00:27:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:45,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401701503] [2022-12-06 00:27:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:45,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:45,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:45,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401701503] [2022-12-06 00:27:45,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401701503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:27:45,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:27:45,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:27:45,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699575826] [2022-12-06 00:27:45,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:27:45,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:27:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:45,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:27:45,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:27:45,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 00:27:45,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 224 transitions, 2994 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-06 00:27:45,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:45,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 00:27:45,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:45,888 INFO L130 PetriNetUnfolder]: 605/1095 cut-off events. [2022-12-06 00:27:45,888 INFO L131 PetriNetUnfolder]: For 10122/10122 co-relation queries the response was YES. [2022-12-06 00:27:45,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 1095 events. 605/1095 cut-off events. For 10122/10122 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5808 event pairs, 189 based on Foata normal form. 94/1185 useless extension candidates. Maximal degree in co-relation 6906. Up to 648 conditions per place. [2022-12-06 00:27:45,896 INFO L137 encePairwiseOnDemand]: 33/68 looper letters, 216 selfloop transitions, 16 changer transitions 11/243 dead transitions. [2022-12-06 00:27:45,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 243 transitions, 3612 flow [2022-12-06 00:27:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:27:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:27:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-06 00:27:45,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3492647058823529 [2022-12-06 00:27:45,897 INFO L175 Difference]: Start difference. First operand has 97 places, 224 transitions, 2994 flow. Second operand 4 states and 95 transitions. [2022-12-06 00:27:45,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 243 transitions, 3612 flow [2022-12-06 00:27:45,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 243 transitions, 3365 flow, removed 106 selfloop flow, removed 5 redundant places. [2022-12-06 00:27:45,934 INFO L231 Difference]: Finished difference. Result has 95 places, 191 transitions, 2339 flow [2022-12-06 00:27:45,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2386, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2339, PETRI_PLACES=95, PETRI_TRANSITIONS=191} [2022-12-06 00:27:45,935 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 73 predicate places. [2022-12-06 00:27:45,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:45,935 INFO L89 Accepts]: Start accepts. Operand has 95 places, 191 transitions, 2339 flow [2022-12-06 00:27:45,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:45,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:45,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 191 transitions, 2339 flow [2022-12-06 00:27:45,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 191 transitions, 2339 flow [2022-12-06 00:27:45,979 INFO L130 PetriNetUnfolder]: 197/497 cut-off events. [2022-12-06 00:27:45,979 INFO L131 PetriNetUnfolder]: For 2592/2612 co-relation queries the response was YES. [2022-12-06 00:27:45,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 497 events. 197/497 cut-off events. For 2592/2612 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2952 event pairs, 19 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 2640. Up to 171 conditions per place. [2022-12-06 00:27:45,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 191 transitions, 2339 flow [2022-12-06 00:27:45,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 00:27:45,984 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:27:45,985 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 00:27:45,985 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 191 transitions, 2339 flow [2022-12-06 00:27:45,985 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-06 00:27:45,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:45,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:45,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:27:45,986 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:45,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:45,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1374695909, now seen corresponding path program 1 times [2022-12-06 00:27:45,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:45,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126126941] [2022-12-06 00:27:45,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:45,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:46,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:46,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126126941] [2022-12-06 00:27:46,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126126941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:27:46,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:27:46,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:27:46,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567617579] [2022-12-06 00:27:46,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:27:46,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:27:46,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:46,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:27:46,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:27:46,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 00:27:46,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 191 transitions, 2339 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-06 00:27:46,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:46,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 00:27:46,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:46,286 INFO L130 PetriNetUnfolder]: 828/1494 cut-off events. [2022-12-06 00:27:46,286 INFO L131 PetriNetUnfolder]: For 9994/9994 co-relation queries the response was YES. [2022-12-06 00:27:46,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9357 conditions, 1494 events. 828/1494 cut-off events. For 9994/9994 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8419 event pairs, 286 based on Foata normal form. 10/1500 useless extension candidates. Maximal degree in co-relation 9324. Up to 749 conditions per place. [2022-12-06 00:27:46,302 INFO L137 encePairwiseOnDemand]: 49/55 looper letters, 261 selfloop transitions, 2 changer transitions 1/264 dead transitions. [2022-12-06 00:27:46,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 264 transitions, 3668 flow [2022-12-06 00:27:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:27:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:27:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-06 00:27:46,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2022-12-06 00:27:46,303 INFO L175 Difference]: Start difference. First operand has 91 places, 191 transitions, 2339 flow. Second operand 3 states and 81 transitions. [2022-12-06 00:27:46,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 264 transitions, 3668 flow [2022-12-06 00:27:46,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 264 transitions, 3626 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 00:27:46,343 INFO L231 Difference]: Finished difference. Result has 89 places, 186 transitions, 2235 flow [2022-12-06 00:27:46,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2227, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2235, PETRI_PLACES=89, PETRI_TRANSITIONS=186} [2022-12-06 00:27:46,343 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 67 predicate places. [2022-12-06 00:27:46,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:46,343 INFO L89 Accepts]: Start accepts. Operand has 89 places, 186 transitions, 2235 flow [2022-12-06 00:27:46,344 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:46,344 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:46,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 186 transitions, 2235 flow [2022-12-06 00:27:46,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 186 transitions, 2235 flow [2022-12-06 00:27:46,402 INFO L130 PetriNetUnfolder]: 267/696 cut-off events. [2022-12-06 00:27:46,403 INFO L131 PetriNetUnfolder]: For 3389/3406 co-relation queries the response was YES. [2022-12-06 00:27:46,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3707 conditions, 696 events. 267/696 cut-off events. For 3389/3406 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 4727 event pairs, 28 based on Foata normal form. 2/674 useless extension candidates. Maximal degree in co-relation 3269. Up to 247 conditions per place. [2022-12-06 00:27:46,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 186 transitions, 2235 flow [2022-12-06 00:27:46,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 418 [2022-12-06 00:27:46,409 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:27:46,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 00:27:46,412 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 186 transitions, 2235 flow [2022-12-06 00:27:46,412 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-06 00:27:46,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:46,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:46,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:27:46,412 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1232746138, now seen corresponding path program 1 times [2022-12-06 00:27:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:46,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167036118] [2022-12-06 00:27:46,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:46,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:46,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:46,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167036118] [2022-12-06 00:27:46,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167036118] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:27:46,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383084121] [2022-12-06 00:27:46,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:46,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:27:46,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:27:46,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:27:46,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 00:27:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:46,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:27:46,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:27:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:27:46,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:27:46,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383084121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:27:46,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:27:46,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-06 00:27:46,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334823799] [2022-12-06 00:27:46,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:27:46,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:27:46,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:46,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:27:46,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:27:46,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 00:27:46,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 186 transitions, 2235 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-06 00:27:46,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:46,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 00:27:46,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:46,899 INFO L130 PetriNetUnfolder]: 801/1488 cut-off events. [2022-12-06 00:27:46,899 INFO L131 PetriNetUnfolder]: For 9773/9773 co-relation queries the response was YES. [2022-12-06 00:27:46,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9231 conditions, 1488 events. 801/1488 cut-off events. For 9773/9773 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 8608 event pairs, 290 based on Foata normal form. 43/1528 useless extension candidates. Maximal degree in co-relation 8216. Up to 1331 conditions per place. [2022-12-06 00:27:46,910 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 158 selfloop transitions, 22 changer transitions 15/195 dead transitions. [2022-12-06 00:27:46,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 195 transitions, 2713 flow [2022-12-06 00:27:46,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:27:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:27:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 00:27:46,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2022-12-06 00:27:46,912 INFO L175 Difference]: Start difference. First operand has 88 places, 186 transitions, 2235 flow. Second operand 3 states and 67 transitions. [2022-12-06 00:27:46,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 195 transitions, 2713 flow [2022-12-06 00:27:46,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 195 transitions, 2693 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 00:27:46,948 INFO L231 Difference]: Finished difference. Result has 90 places, 170 transitions, 2081 flow [2022-12-06 00:27:46,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2115, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2081, PETRI_PLACES=90, PETRI_TRANSITIONS=170} [2022-12-06 00:27:46,949 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 68 predicate places. [2022-12-06 00:27:46,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:46,949 INFO L89 Accepts]: Start accepts. Operand has 90 places, 170 transitions, 2081 flow [2022-12-06 00:27:46,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:46,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:46,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 170 transitions, 2081 flow [2022-12-06 00:27:46,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 170 transitions, 2081 flow [2022-12-06 00:27:47,002 INFO L130 PetriNetUnfolder]: 248/661 cut-off events. [2022-12-06 00:27:47,003 INFO L131 PetriNetUnfolder]: For 3203/3213 co-relation queries the response was YES. [2022-12-06 00:27:47,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3501 conditions, 661 events. 248/661 cut-off events. For 3203/3213 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4445 event pairs, 29 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 3169. Up to 232 conditions per place. [2022-12-06 00:27:47,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 170 transitions, 2081 flow [2022-12-06 00:27:47,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 00:27:47,008 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:27:47,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 00:27:47,009 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 170 transitions, 2081 flow [2022-12-06 00:27:47,009 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-06 00:27:47,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:47,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:47,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 00:27:47,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:27:47,215 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:47,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:47,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2124023537, now seen corresponding path program 1 times [2022-12-06 00:27:47,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:47,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268185645] [2022-12-06 00:27:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:47,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:27:47,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:47,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268185645] [2022-12-06 00:27:47,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268185645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:27:47,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:27:47,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:27:47,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591259989] [2022-12-06 00:27:47,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:27:47,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:27:47,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:47,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:27:47,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:27:47,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:27:47,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 170 transitions, 2081 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-06 00:27:47,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:47,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:27:47,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:47,465 INFO L130 PetriNetUnfolder]: 604/1118 cut-off events. [2022-12-06 00:27:47,465 INFO L131 PetriNetUnfolder]: For 7324/7324 co-relation queries the response was YES. [2022-12-06 00:27:47,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7068 conditions, 1118 events. 604/1118 cut-off events. For 7324/7324 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6072 event pairs, 57 based on Foata normal form. 26/1141 useless extension candidates. Maximal degree in co-relation 6380. Up to 1027 conditions per place. [2022-12-06 00:27:47,474 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 136 selfloop transitions, 17 changer transitions 0/153 dead transitions. [2022-12-06 00:27:47,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 153 transitions, 2170 flow [2022-12-06 00:27:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:27:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:27:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 00:27:47,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3900709219858156 [2022-12-06 00:27:47,475 INFO L175 Difference]: Start difference. First operand has 88 places, 170 transitions, 2081 flow. Second operand 3 states and 55 transitions. [2022-12-06 00:27:47,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 153 transitions, 2170 flow [2022-12-06 00:27:47,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 153 transitions, 2023 flow, removed 34 selfloop flow, removed 8 redundant places. [2022-12-06 00:27:47,504 INFO L231 Difference]: Finished difference. Result has 81 places, 148 transitions, 1743 flow [2022-12-06 00:27:47,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1743, PETRI_PLACES=81, PETRI_TRANSITIONS=148} [2022-12-06 00:27:47,505 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 59 predicate places. [2022-12-06 00:27:47,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:47,505 INFO L89 Accepts]: Start accepts. Operand has 81 places, 148 transitions, 1743 flow [2022-12-06 00:27:47,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:47,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:47,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 148 transitions, 1743 flow [2022-12-06 00:27:47,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 148 transitions, 1743 flow [2022-12-06 00:27:47,566 INFO L130 PetriNetUnfolder]: 190/522 cut-off events. [2022-12-06 00:27:47,566 INFO L131 PetriNetUnfolder]: For 1734/1740 co-relation queries the response was YES. [2022-12-06 00:27:47,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2555 conditions, 522 events. 190/522 cut-off events. For 1734/1740 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3347 event pairs, 28 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 2022. Up to 181 conditions per place. [2022-12-06 00:27:47,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 148 transitions, 1743 flow [2022-12-06 00:27:47,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-06 00:27:47,571 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-06 00:27:47,630 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-06 00:27:47,687 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:27:47,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:27:47,688 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 148 transitions, 1749 flow [2022-12-06 00:27:47,688 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-06 00:27:47,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:47,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:47,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:27:47,689 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:27:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash 412015095, now seen corresponding path program 1 times [2022-12-06 00:27:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:47,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096289802] [2022-12-06 00:27:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:47,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:48,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:48,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096289802] [2022-12-06 00:27:48,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096289802] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:27:48,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339055969] [2022-12-06 00:27:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:48,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:27:48,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:27:48,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:27:48,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 00:27:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:48,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 00:27:48,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:27:48,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:27:48,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:27:48,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:27:48,945 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:27:48,946 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-06 00:27:48,949 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-06 00:27:48,956 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-06 00:27:48,991 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-06 00:27:49,082 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 56 treesize of output 20 [2022-12-06 00:27:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:49,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:27:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:49,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339055969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:27:49,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:27:49,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 00:27:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412330061] [2022-12-06 00:27:49,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:27:49,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:27:49,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:49,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:27:49,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2022-12-06 00:27:49,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:27:49,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 148 transitions, 1749 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-06 00:27:49,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:49,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:27:49,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:55,914 WARN L233 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 124 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:28:08,965 INFO L130 PetriNetUnfolder]: 640/1185 cut-off events. [2022-12-06 00:28:08,965 INFO L131 PetriNetUnfolder]: For 5676/5676 co-relation queries the response was YES. [2022-12-06 00:28:08,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6975 conditions, 1185 events. 640/1185 cut-off events. For 5676/5676 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6511 event pairs, 22 based on Foata normal form. 1/1183 useless extension candidates. Maximal degree in co-relation 5554. Up to 612 conditions per place. [2022-12-06 00:28:08,979 INFO L137 encePairwiseOnDemand]: 10/47 looper letters, 70 selfloop transitions, 138 changer transitions 17/225 dead transitions. [2022-12-06 00:28:08,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 225 transitions, 2774 flow [2022-12-06 00:28:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 00:28:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 00:28:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 136 transitions. [2022-12-06 00:28:08,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12056737588652482 [2022-12-06 00:28:08,981 INFO L175 Difference]: Start difference. First operand has 81 places, 148 transitions, 1749 flow. Second operand 24 states and 136 transitions. [2022-12-06 00:28:08,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 225 transitions, 2774 flow [2022-12-06 00:28:08,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 225 transitions, 2749 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 00:28:09,004 INFO L231 Difference]: Finished difference. Result has 110 places, 175 transitions, 2468 flow [2022-12-06 00:28:09,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2468, PETRI_PLACES=110, PETRI_TRANSITIONS=175} [2022-12-06 00:28:09,005 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 88 predicate places. [2022-12-06 00:28:09,005 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:09,005 INFO L89 Accepts]: Start accepts. Operand has 110 places, 175 transitions, 2468 flow [2022-12-06 00:28:09,006 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:09,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:09,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 175 transitions, 2468 flow [2022-12-06 00:28:09,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 175 transitions, 2468 flow [2022-12-06 00:28:09,061 INFO L130 PetriNetUnfolder]: 201/543 cut-off events. [2022-12-06 00:28:09,062 INFO L131 PetriNetUnfolder]: For 2667/2675 co-relation queries the response was YES. [2022-12-06 00:28:09,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3120 conditions, 543 events. 201/543 cut-off events. For 2667/2675 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3404 event pairs, 25 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 3063. Up to 188 conditions per place. [2022-12-06 00:28:09,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 175 transitions, 2468 flow [2022-12-06 00:28:09,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 00:28:12,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [794] L65-1-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_427| v_~q1~0.base_233))) (and (= (+ v_~q2_back~0_347 1) v_~q2_back~0_346) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_235| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_235|) (< v_~j~0_286 v_~N~0_222) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_186| (ite (= v_~j~0_286 (select .cse0 (+ v_~q1~0.offset_233 (* v_~q1_back~0_326 4)))) 1 0)) (< v_~i~0_316 v_~N~0_222) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_326) (< v_~q1_back~0_326 v_~n1~0_220)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_29| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_186| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|) (not (< v_~i~0_315 v_~N~0_222)) (= |v_thread1Thread1of1ForFork0_#res#1.base_29| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_235| 0)) (= (+ v_~q1_back~0_326 1) v_~q1_back~0_325) (not (= (ite (= v_~i~0_316 (select (select |v_#memory_int_427| v_~q2~0.base_212) (+ v_~q2~0.offset_212 (* 4 v_~q2_back~0_347)))) 1 0) 0)) (= (+ v_~q1_front~0_341 1) v_~q1_front~0_340) (= (ite (and (< v_~q1_front~0_341 v_~q1_back~0_325) (< v_~q1_front~0_341 v_~n1~0_220) (<= 0 v_~q1_front~0_341)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_235|) (not (= (ite (and (<= 0 v_~q2_back~0_347) (< v_~q2_back~0_347 v_~n2~0_220)) 1 0) 0)) (= v_~i~0_315 (+ (select .cse0 (+ v_~q1~0.offset_233 (* v_~q1_front~0_341 4))) 1)))) InVars {~j~0=v_~j~0_286, ~q1~0.offset=v_~q1~0.offset_233, ~q1_front~0=v_~q1_front~0_341, ~n2~0=v_~n2~0_220, ~i~0=v_~i~0_316, ~n1~0=v_~n1~0_220, ~q2~0.offset=v_~q2~0.offset_212, ~N~0=v_~N~0_222, ~q1_back~0=v_~q1_back~0_326, ~q1~0.base=v_~q1~0.base_233, #memory_int=|v_#memory_int_427|, ~q2~0.base=v_~q2~0.base_212, ~q2_back~0=v_~q2_back~0_347} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_117|, ~j~0=v_~j~0_286, ~q1_front~0=v_~q1_front~0_340, ~n1~0=v_~n1~0_220, ~q2~0.offset=v_~q2~0.offset_212, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_186|, ~q1_back~0=v_~q1_back~0_325, ~q1~0.base=v_~q1~0.base_233, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_151|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_235|, ~q2~0.base=v_~q2~0.base_212, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_145|, ~q2_back~0=v_~q2_back~0_346, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_29|, ~q1~0.offset=v_~q1~0.offset_233, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_29|, ~n2~0=v_~n2~0_220, ~i~0=v_~i~0_315, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_145|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_94|, ~N~0=v_~N~0_222, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_94|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_235|, #memory_int=|v_#memory_int_427|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_117|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, thread1Thread1of1ForFork0_#res#1.offset, ~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, 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-06 00:28:13,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [758] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_362| v_~q2~0.base_162))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_154| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_154|) (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_248) v_~q2~0.offset_162)) v_~i~0_234) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_154|) (< v_~i~0_234 v_~N~0_170) (< v_~j~0_211 v_~N~0_170) (= v_~q1_back~0_232 (+ v_~q1_back~0_233 1)) (= v_~q2_front~0_206 (+ v_~q2_front~0_207 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_154| 0)) (= v_~j~0_210 (+ (select .cse0 (+ v_~q2~0.offset_162 (* v_~q2_front~0_207 4))) 1)) (not (= (ite (= v_~j~0_211 (select (select |v_#memory_int_362| v_~q1~0.base_185) (+ (* v_~q1_back~0_233 4) v_~q1~0.offset_185))) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_233 v_~n1~0_172) (<= 0 v_~q1_back~0_233)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_112| 0)) (= (+ v_~q2_back~0_248 1) v_~q2_back~0_247) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_112| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_112|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_112| (ite (and (< v_~q2_front~0_207 v_~q2_back~0_247) (< v_~q2_front~0_207 v_~n2~0_172) (<= 0 v_~q2_front~0_207)) 1 0)) (not (= (ite (and (<= 0 v_~q2_back~0_248) (< v_~q2_back~0_248 v_~n2~0_172)) 1 0) 0)))) InVars {~j~0=v_~j~0_211, ~q1~0.offset=v_~q1~0.offset_185, ~n2~0=v_~n2~0_172, ~i~0=v_~i~0_234, ~q2~0.offset=v_~q2~0.offset_162, ~n1~0=v_~n1~0_172, ~q2_front~0=v_~q2_front~0_207, ~N~0=v_~N~0_170, ~q1_back~0=v_~q1_back~0_233, ~q1~0.base=v_~q1~0.base_185, #memory_int=|v_#memory_int_362|, ~q2~0.base=v_~q2~0.base_162, ~q2_back~0=v_~q2_back~0_248} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_67|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_78|, ~j~0=v_~j~0_210, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_72|, ~q1~0.offset=v_~q1~0.offset_185, ~n2~0=v_~n2~0_172, ~i~0=v_~i~0_234, ~q2~0.offset=v_~q2~0.offset_162, ~n1~0=v_~n1~0_172, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_112|, ~q2_front~0=v_~q2_front~0_206, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_48|, ~N~0=v_~N~0_170, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_48|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_72|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_112|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_154|, ~q1_back~0=v_~q1_back~0_232, ~q1~0.base=v_~q1~0.base_185, #memory_int=|v_#memory_int_362|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_154|, ~q2~0.base=v_~q2~0.base_162, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_67|, ~q2_back~0=v_~q2_back~0_247} 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-06 00:28:13,246 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L47-1-->L70: Formula: (and (< v_~j~0_182 v_~N~0_144) (= (+ v_~q2_back~0_216 1) v_~q2_back~0_215) (not (= (ite (and (< v_~q2_back~0_216 v_~n2~0_152) (<= 0 v_~q2_back~0_216)) 1 0) 0)) (= (+ v_~q1_back~0_195 1) v_~q1_back~0_194) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_88| 0)) (< v_~i~0_204 v_~N~0_144) (not (= (ite (and (<= 0 v_~q1_back~0_195) (< v_~q1_back~0_195 v_~n1~0_146)) 1 0) 0)) (= (ite (= v_~j~0_182 (select (select |v_#memory_int_332| v_~q1~0.base_159) (+ (* v_~q1_back~0_195 4) v_~q1~0.offset_159))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_88| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124| 0)) (= (ite (= (select (select |v_#memory_int_332| v_~q2~0.base_142) (+ v_~q2~0.offset_142 (* 4 v_~q2_back~0_216))) v_~i~0_204) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124|)) InVars {~j~0=v_~j~0_182, ~q1~0.offset=v_~q1~0.offset_159, ~n2~0=v_~n2~0_152, ~q1_back~0=v_~q1_back~0_195, ~i~0=v_~i~0_204, ~n1~0=v_~n1~0_146, ~q2~0.offset=v_~q2~0.offset_142, ~q1~0.base=v_~q1~0.base_159, #memory_int=|v_#memory_int_332|, ~q2~0.base=v_~q2~0.base_142, ~N~0=v_~N~0_144, ~q2_back~0=v_~q2_back~0_216} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_55|, ~j~0=v_~j~0_182, ~q1~0.offset=v_~q1~0.offset_159, ~n2~0=v_~n2~0_152, ~i~0=v_~i~0_204, ~n1~0=v_~n1~0_146, ~q2~0.offset=v_~q2~0.offset_142, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_36|, ~N~0=v_~N~0_144, 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_88|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124|, ~q1_back~0=v_~q1_back~0_194, ~q1~0.base=v_~q1~0.base_159, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124|, ~q2~0.base=v_~q2~0.base_142, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_55|, ~q2_back~0=v_~q2_back~0_215} 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 [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-06 00:28:13,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L47-1-->L70: Formula: (and (< v_~j~0_182 v_~N~0_144) (= (+ v_~q2_back~0_216 1) v_~q2_back~0_215) (not (= (ite (and (< v_~q2_back~0_216 v_~n2~0_152) (<= 0 v_~q2_back~0_216)) 1 0) 0)) (= (+ v_~q1_back~0_195 1) v_~q1_back~0_194) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_88| 0)) (< v_~i~0_204 v_~N~0_144) (not (= (ite (and (<= 0 v_~q1_back~0_195) (< v_~q1_back~0_195 v_~n1~0_146)) 1 0) 0)) (= (ite (= v_~j~0_182 (select (select |v_#memory_int_332| v_~q1~0.base_159) (+ (* v_~q1_back~0_195 4) v_~q1~0.offset_159))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_88| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124| 0)) (= (ite (= (select (select |v_#memory_int_332| v_~q2~0.base_142) (+ v_~q2~0.offset_142 (* 4 v_~q2_back~0_216))) v_~i~0_204) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124|)) InVars {~j~0=v_~j~0_182, ~q1~0.offset=v_~q1~0.offset_159, ~n2~0=v_~n2~0_152, ~q1_back~0=v_~q1_back~0_195, ~i~0=v_~i~0_204, ~n1~0=v_~n1~0_146, ~q2~0.offset=v_~q2~0.offset_142, ~q1~0.base=v_~q1~0.base_159, #memory_int=|v_#memory_int_332|, ~q2~0.base=v_~q2~0.base_142, ~N~0=v_~N~0_144, ~q2_back~0=v_~q2_back~0_216} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_55|, ~j~0=v_~j~0_182, ~q1~0.offset=v_~q1~0.offset_159, ~n2~0=v_~n2~0_152, ~i~0=v_~i~0_204, ~n1~0=v_~n1~0_146, ~q2~0.offset=v_~q2~0.offset_142, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_36|, ~N~0=v_~N~0_144, 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_88|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124|, ~q1_back~0=v_~q1_back~0_194, ~q1~0.base=v_~q1~0.base_159, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124|, ~q2~0.base=v_~q2~0.base_142, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_55|, ~q2_back~0=v_~q2_back~0_215} 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 [723] L52-->L65-1: Formula: (and (= (ite (and (<= 0 v_~q1_front~0_167) (< v_~q1_front~0_167 v_~n1~0_114) (< v_~q1_front~0_167 v_~q1_back~0_155)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| 0)) (= v_~q1_front~0_166 (+ v_~q1_front~0_167 1)) (= v_~q2_front~0_139 (+ v_~q2_front~0_140 1)) (= (+ (select (select |v_#memory_int_271| v_~q1~0.base_125) (+ (* v_~q1_front~0_167 4) v_~q1~0.offset_125)) 1) v_~i~0_165) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (= v_~j~0_143 (+ (select (select |v_#memory_int_271| v_~q2~0.base_109) (+ v_~q2~0.offset_109 (* v_~q2_front~0_140 4))) 1)) (= (ite (and (< v_~q2_front~0_140 v_~n2~0_122) (< v_~q2_front~0_140 v_~q2_back~0_176) (<= 0 v_~q2_front~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|)) InVars {~q1~0.offset=v_~q1~0.offset_125, ~n2~0=v_~n2~0_122, ~q1_front~0=v_~q1_front~0_167, ~q1_back~0=v_~q1_back~0_155, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_114, ~q1~0.base=v_~q1~0.base_125, #memory_int=|v_#memory_int_271|, ~q2_front~0=v_~q2_front~0_140, ~q2~0.base=v_~q2~0.base_109, ~q2_back~0=v_~q2_back~0_176} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_46|, ~j~0=v_~j~0_143, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_40|, ~q1~0.offset=v_~q1~0.offset_125, ~n2~0=v_~n2~0_122, ~q1_front~0=v_~q1_front~0_166, ~i~0=v_~i~0_165, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_114, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|, ~q2_front~0=v_~q2_front~0_139, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_40|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|, ~q1_back~0=v_~q1_back~0_155, ~q1~0.base=v_~q1~0.base_125, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_63|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91|, ~q2~0.base=v_~q2~0.base_109, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_57|, ~q2_back~0=v_~q2_back~0_176} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:28:13,643 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:28:13,644 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4639 [2022-12-06 00:28:13,644 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 171 transitions, 2474 flow [2022-12-06 00:28:13,644 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-06 00:28:13,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:13,644 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:13,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:13,853 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,SelfDestructingSolverStorable13 [2022-12-06 00:28:13,853 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:13,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1255230384, now seen corresponding path program 1 times [2022-12-06 00:28:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:13,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383897580] [2022-12-06 00:28:13,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:13,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:14,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:14,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383897580] [2022-12-06 00:28:14,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383897580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:14,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569021363] [2022-12-06 00:28:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:14,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:14,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:14,721 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:14,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 00:28:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:14,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 00:28:14,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:14,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:14,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:14,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:14,843 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:28:14,843 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-06 00:28:14,845 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-06 00:28:14,849 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-06 00:28:14,894 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-06 00:28:14,949 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 00:28:14,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 23 [2022-12-06 00:28:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:14,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:15,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569021363] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:15,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:15,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 00:28:15,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736291506] [2022-12-06 00:28:15,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:15,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:28:15,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:15,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:28:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2022-12-06 00:28:15,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:28:15,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 171 transitions, 2474 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-06 00:28:15,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:15,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:28:15,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:17,387 INFO L130 PetriNetUnfolder]: 634/1159 cut-off events. [2022-12-06 00:28:17,388 INFO L131 PetriNetUnfolder]: For 7457/7457 co-relation queries the response was YES. [2022-12-06 00:28:17,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7938 conditions, 1159 events. 634/1159 cut-off events. For 7457/7457 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6215 event pairs, 19 based on Foata normal form. 1/1157 useless extension candidates. Maximal degree in co-relation 7875. Up to 803 conditions per place. [2022-12-06 00:28:17,396 INFO L137 encePairwiseOnDemand]: 21/51 looper letters, 111 selfloop transitions, 94 changer transitions 6/211 dead transitions. [2022-12-06 00:28:17,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 211 transitions, 3154 flow [2022-12-06 00:28:17,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:28:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:28:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 112 transitions. [2022-12-06 00:28:17,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13725490196078433 [2022-12-06 00:28:17,397 INFO L175 Difference]: Start difference. First operand has 103 places, 171 transitions, 2474 flow. Second operand 16 states and 112 transitions. [2022-12-06 00:28:17,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 211 transitions, 3154 flow [2022-12-06 00:28:17,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 211 transitions, 2875 flow, removed 42 selfloop flow, removed 8 redundant places. [2022-12-06 00:28:17,432 INFO L231 Difference]: Finished difference. Result has 111 places, 178 transitions, 2484 flow [2022-12-06 00:28:17,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2484, PETRI_PLACES=111, PETRI_TRANSITIONS=178} [2022-12-06 00:28:17,433 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 89 predicate places. [2022-12-06 00:28:17,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:17,433 INFO L89 Accepts]: Start accepts. Operand has 111 places, 178 transitions, 2484 flow [2022-12-06 00:28:17,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:17,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:17,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 178 transitions, 2484 flow [2022-12-06 00:28:17,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 178 transitions, 2484 flow [2022-12-06 00:28:17,478 INFO L130 PetriNetUnfolder]: 201/531 cut-off events. [2022-12-06 00:28:17,478 INFO L131 PetriNetUnfolder]: For 2336/2342 co-relation queries the response was YES. [2022-12-06 00:28:17,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3087 conditions, 531 events. 201/531 cut-off events. For 2336/2342 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3254 event pairs, 22 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 2947. Up to 191 conditions per place. [2022-12-06 00:28:17,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 178 transitions, 2484 flow [2022-12-06 00:28:17,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-06 00:28:17,492 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-06 00:28:17,661 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:17,662 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:17,662 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:17,662 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:17,662 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:17,662 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:17,662 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:17,662 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:17,662 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:17,662 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:17,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~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_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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-06 00:28:18,463 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] L47-1-->L70: Formula: (let ((.cse1 (select |v_#memory_int_458| v_~q1~0.base_255)) (.cse0 (select |v_#memory_int_458| v_~q2~0.base_230))) (and (= v_~q2_back~0_378 (+ v_~q2_back~0_379 1)) (= v_~j~0_318 (+ (select .cse0 (+ v_~q2~0.offset_230 (* v_~q2_front~0_311 4))) 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257| 0)) (< v_~j~0_318 v_~N~0_242) (= (+ v_~q2_front~0_311 1) v_~q2_front~0_310) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212| (ite (= v_~j~0_318 (select .cse1 (+ (* v_~q1_back~0_362 4) v_~q1~0.offset_255 (- 4)))) 1 0)) (not (= (ite (and (< v_~q2_front~0_311 v_~n2~0_238) (<= 0 v_~q2_front~0_311) (< v_~q2_front~0_311 v_~q2_back~0_378)) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_362 (+ v_~n1~0_240 1)) (<= 1 v_~q1_back~0_362)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_257| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_212|) (not (= (ite (= v_~j~0_319 (select .cse1 (+ v_~q1~0.offset_255 (* v_~q1_back~0_364 4)))) 1 0) 0)) (< v_~i~0_345 v_~N~0_242) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_212| 0)) (< v_~j~0_319 v_~N~0_242) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_257| (ite (= (select .cse0 (+ v_~q2~0.offset_230 (* 4 v_~q2_back~0_379))) v_~i~0_345) 1 0)) (= (+ 2 v_~q1_back~0_364) v_~q1_back~0_362) (not (= (ite (and (<= 0 v_~q1_back~0_364) (< v_~q1_back~0_364 v_~n1~0_240)) 1 0) 0)) (not (= (ite (and (< v_~q2_back~0_379 v_~n2~0_238) (<= 0 v_~q2_back~0_379)) 1 0) 0)))) InVars {~j~0=v_~j~0_319, ~q1~0.offset=v_~q1~0.offset_255, ~n2~0=v_~n2~0_238, ~i~0=v_~i~0_345, ~n1~0=v_~n1~0_240, ~q2~0.offset=v_~q2~0.offset_230, ~q2_front~0=v_~q2_front~0_311, ~N~0=v_~N~0_242, ~q1_back~0=v_~q1_back~0_364, ~q1~0.base=v_~q1~0.base_255, #memory_int=|v_#memory_int_458|, ~q2~0.base=v_~q2~0.base_230, ~q2_back~0=v_~q2_back~0_379} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_131|, ~j~0=v_~j~0_318, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_130|, ~q1~0.offset=v_~q1~0.offset_255, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_124|, ~n2~0=v_~n2~0_238, ~i~0=v_~i~0_345, ~n1~0=v_~n1~0_240, ~q2~0.offset=v_~q2~0.offset_230, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_112|, ~q2_front~0=v_~q2_front~0_310, ~N~0=v_~N~0_242, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_112|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_124|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_212|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_257|, ~q1_back~0=v_~q1_back~0_362, ~q1~0.base=v_~q1~0.base_255, #memory_int=|v_#memory_int_458|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257|, ~q2~0.base=v_~q2~0.base_230, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_131|, ~q2_back~0=v_~q2_back~0_378} 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-06 00:28:18,732 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-06 00:28:18,807 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 00:28:18,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1375 [2022-12-06 00:28:18,808 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 177 transitions, 2545 flow [2022-12-06 00:28:18,808 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-06 00:28:18,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:18,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:18,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 00:28:19,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 00:28:19,009 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:19,009 INFO L85 PathProgramCache]: Analyzing trace with hash 748762824, now seen corresponding path program 1 times [2022-12-06 00:28:19,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:19,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415974098] [2022-12-06 00:28:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:19,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:19,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:19,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415974098] [2022-12-06 00:28:19,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415974098] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:19,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068455217] [2022-12-06 00:28:19,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:19,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:19,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:19,143 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:19,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 00:28:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:19,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 00:28:19,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:19,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:19,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068455217] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:19,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:19,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 00:28:19,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687652540] [2022-12-06 00:28:19,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:19,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:28:19,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:19,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:28:19,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:28:19,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 00:28:19,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 177 transitions, 2545 flow. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:19,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:19,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 00:28:19,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:19,690 INFO L130 PetriNetUnfolder]: 621/1155 cut-off events. [2022-12-06 00:28:19,691 INFO L131 PetriNetUnfolder]: For 8704/8704 co-relation queries the response was YES. [2022-12-06 00:28:19,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7884 conditions, 1155 events. 621/1155 cut-off events. For 8704/8704 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6239 event pairs, 134 based on Foata normal form. 30/1182 useless extension candidates. Maximal degree in co-relation 7457. Up to 793 conditions per place. [2022-12-06 00:28:19,698 INFO L137 encePairwiseOnDemand]: 33/56 looper letters, 186 selfloop transitions, 24 changer transitions 12/222 dead transitions. [2022-12-06 00:28:19,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 222 transitions, 3381 flow [2022-12-06 00:28:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:28:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:28:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-12-06 00:28:19,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24744897959183673 [2022-12-06 00:28:19,699 INFO L175 Difference]: Start difference. First operand has 109 places, 177 transitions, 2545 flow. Second operand 7 states and 97 transitions. [2022-12-06 00:28:19,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 222 transitions, 3381 flow [2022-12-06 00:28:19,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 222 transitions, 3206 flow, removed 33 selfloop flow, removed 9 redundant places. [2022-12-06 00:28:19,732 INFO L231 Difference]: Finished difference. Result has 107 places, 165 transitions, 2232 flow [2022-12-06 00:28:19,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2309, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2232, PETRI_PLACES=107, PETRI_TRANSITIONS=165} [2022-12-06 00:28:19,733 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 85 predicate places. [2022-12-06 00:28:19,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:19,733 INFO L89 Accepts]: Start accepts. Operand has 107 places, 165 transitions, 2232 flow [2022-12-06 00:28:19,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:19,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:19,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 165 transitions, 2232 flow [2022-12-06 00:28:19,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 165 transitions, 2232 flow [2022-12-06 00:28:19,776 INFO L130 PetriNetUnfolder]: 202/531 cut-off events. [2022-12-06 00:28:19,776 INFO L131 PetriNetUnfolder]: For 2074/2082 co-relation queries the response was YES. [2022-12-06 00:28:19,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 531 events. 202/531 cut-off events. For 2074/2082 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3225 event pairs, 22 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 2812. Up to 188 conditions per place. [2022-12-06 00:28:19,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 165 transitions, 2232 flow [2022-12-06 00:28:19,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 00:28:19,780 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:19,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 00:28:19,782 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 165 transitions, 2232 flow [2022-12-06 00:28:19,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:19,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:19,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:19,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 00:28:19,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:19,988 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:19,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash -453311582, now seen corresponding path program 1 times [2022-12-06 00:28:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:19,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932298763] [2022-12-06 00:28:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:19,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:20,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:20,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932298763] [2022-12-06 00:28:20,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932298763] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:20,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781014138] [2022-12-06 00:28:20,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:20,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:20,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:20,525 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:20,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 00:28:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:20,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 00:28:20,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:20,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:20,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:20,645 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-06 00:28:20,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:20,649 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-06 00:28:20,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:20,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:20,656 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 10 treesize of output 8 [2022-12-06 00:28:20,660 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-06 00:28:20,664 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-06 00:28:20,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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:28:20,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:20,724 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-06 00:28:20,870 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 45 treesize of output 17 [2022-12-06 00:28:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:20,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:21,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781014138] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:21,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:21,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 00:28:21,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950992023] [2022-12-06 00:28:21,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:21,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 00:28:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:21,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 00:28:21,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-12-06 00:28:21,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 00:28:21,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 165 transitions, 2232 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-06 00:28:21,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:21,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 00:28:21,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:22,452 INFO L130 PetriNetUnfolder]: 639/1164 cut-off events. [2022-12-06 00:28:22,452 INFO L131 PetriNetUnfolder]: For 6438/6438 co-relation queries the response was YES. [2022-12-06 00:28:22,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7682 conditions, 1164 events. 639/1164 cut-off events. For 6438/6438 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6226 event pairs, 18 based on Foata normal form. 2/1165 useless extension candidates. Maximal degree in co-relation 7132. Up to 764 conditions per place. [2022-12-06 00:28:22,459 INFO L137 encePairwiseOnDemand]: 17/48 looper letters, 89 selfloop transitions, 109 changer transitions 8/206 dead transitions. [2022-12-06 00:28:22,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 206 transitions, 2952 flow [2022-12-06 00:28:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:28:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:28:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 106 transitions. [2022-12-06 00:28:22,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15773809523809523 [2022-12-06 00:28:22,461 INFO L175 Difference]: Start difference. First operand has 99 places, 165 transitions, 2232 flow. Second operand 14 states and 106 transitions. [2022-12-06 00:28:22,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 206 transitions, 2952 flow [2022-12-06 00:28:22,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 206 transitions, 2882 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 00:28:22,488 INFO L231 Difference]: Finished difference. Result has 110 places, 175 transitions, 2577 flow [2022-12-06 00:28:22,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2577, PETRI_PLACES=110, PETRI_TRANSITIONS=175} [2022-12-06 00:28:22,488 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 88 predicate places. [2022-12-06 00:28:22,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:22,489 INFO L89 Accepts]: Start accepts. Operand has 110 places, 175 transitions, 2577 flow [2022-12-06 00:28:22,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:22,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:22,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 175 transitions, 2577 flow [2022-12-06 00:28:22,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 175 transitions, 2577 flow [2022-12-06 00:28:22,535 INFO L130 PetriNetUnfolder]: 206/538 cut-off events. [2022-12-06 00:28:22,535 INFO L131 PetriNetUnfolder]: For 2495/2503 co-relation queries the response was YES. [2022-12-06 00:28:22,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 538 events. 206/538 cut-off events. For 2495/2503 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3270 event pairs, 21 based on Foata normal form. 0/517 useless extension candidates. Maximal degree in co-relation 3094. Up to 191 conditions per place. [2022-12-06 00:28:22,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 175 transitions, 2577 flow [2022-12-06 00:28:22,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 00:28:22,549 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-06 00:28:22,697 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 [706] L47-1-->L65-1: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= v_~j~0_119 (+ (select (select |v_#memory_int_217| v_~q2~0.base_80) (+ (* v_~q2_front~0_111 4) v_~q2~0.offset_80)) 1)) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (ite (and (< v_~q2_front~0_111 v_~q2_back~0_131) (< v_~q2_front~0_111 v_~n2~0_94) (<= 0 v_~q2_front~0_111)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= (+ v_~q2_front~0_111 1) v_~q2_front~0_110) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (not (< v_~i~0_123 v_~N~0_78))) InVars {~n2~0=v_~n2~0_94, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, #memory_int=|v_#memory_int_217|, ~q2_front~0=v_~q2_front~0_111, ~q2~0.base=v_~q2~0.base_80, ~N~0=v_~N~0_78, ~q2_back~0=v_~q2_back~0_131} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_34|, ~j~0=v_~j~0_119, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_28|, ~n2~0=v_~n2~0_94, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, ~q2_front~0=v_~q2_front~0_110, ~N~0=v_~N~0_78, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_28|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, #memory_int=|v_#memory_int_217|, ~q2~0.base=v_~q2~0.base_80, ~q2_back~0=v_~q2_back~0_131, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 00:28:22,860 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-06 00:28:22,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [802] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_454| v_~q1~0.base_251))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_255| 0)) (< v_~j~0_312 v_~N~0_238) (not (= (ite (and (<= 0 v_~q1_back~0_355) (< v_~q1_back~0_355 v_~n1~0_236)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206|) (= (+ v_~q1_back~0_355 1) v_~q1_back~0_354) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| (ite (= v_~j~0_312 (select .cse0 (+ v_~q1~0.offset_251 (* v_~q1_back~0_355 4)))) 1 0)) (= (ite (and (<= 0 v_~q1_front~0_366) (< v_~q1_front~0_366 v_~n1~0_236) (< v_~q1_front~0_366 v_~q1_back~0_354)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_255|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_255| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_255|) (= v_~i~0_343 (+ (select .cse0 (+ (* v_~q1_front~0_366 4) v_~q1~0.offset_251)) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206| 0)) (= v_~q1_front~0_365 (+ v_~q1_front~0_366 1)))) InVars {~j~0=v_~j~0_312, ~q1~0.offset=v_~q1~0.offset_251, ~q1_front~0=v_~q1_front~0_366, ~q1_back~0=v_~q1_back~0_355, ~n1~0=v_~n1~0_236, ~q1~0.base=v_~q1~0.base_251, #memory_int=|v_#memory_int_454|, ~N~0=v_~N~0_238} OutVars{~j~0=v_~j~0_312, ~q1~0.offset=v_~q1~0.offset_251, ~q1_front~0=v_~q1_front~0_365, ~i~0=v_~i~0_343, ~n1~0=v_~n1~0_236, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_157|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_108|, ~N~0=v_~N~0_238, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_108|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_255|, ~q1_back~0=v_~q1_back~0_354, ~q1~0.base=v_~q1~0.base_251, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_163|, #memory_int=|v_#memory_int_454|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_255|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_157|} 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-06 00:28:23,029 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:28:23,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 540 [2022-12-06 00:28:23,030 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 173 transitions, 2576 flow [2022-12-06 00:28:23,030 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-06 00:28:23,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:23,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:23,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 00:28:23,242 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,SelfDestructingSolverStorable16 [2022-12-06 00:28:23,242 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 307356654, now seen corresponding path program 1 times [2022-12-06 00:28:23,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:23,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363049214] [2022-12-06 00:28:23,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:23,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363049214] [2022-12-06 00:28:23,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363049214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761457452] [2022-12-06 00:28:23,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:23,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:23,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:23,868 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:23,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 00:28:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:23,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 00:28:23,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:23,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:23,992 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-12-06 00:28:23,992 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 42 treesize of output 100 [2022-12-06 00:28:23,999 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-06 00:28:24,006 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 12 treesize of output 11 [2022-12-06 00:28:24,022 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:24,023 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2022-12-06 00:28:24,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:24,044 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-12-06 00:28:24,044 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 63 treesize of output 32 [2022-12-06 00:28:24,051 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 9 treesize of output 7 [2022-12-06 00:28:24,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:24,140 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-06 00:28:24,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:28:24,318 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 00:28:24,318 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 52 treesize of output 22 [2022-12-06 00:28:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:24,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:24,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761457452] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:24,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:24,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 00:28:24,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166241506] [2022-12-06 00:28:24,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:24,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 00:28:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:24,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 00:28:24,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=226, Unknown=3, NotChecked=0, Total=272 [2022-12-06 00:28:24,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 00:28:24,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 173 transitions, 2576 flow. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 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-06 00:28:24,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:24,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 00:28:24,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:25,713 INFO L130 PetriNetUnfolder]: 647/1176 cut-off events. [2022-12-06 00:28:25,714 INFO L131 PetriNetUnfolder]: For 8973/8973 co-relation queries the response was YES. [2022-12-06 00:28:25,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8375 conditions, 1176 events. 647/1176 cut-off events. For 8973/8973 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6253 event pairs, 42 based on Foata normal form. 2/1177 useless extension candidates. Maximal degree in co-relation 7995. Up to 827 conditions per place. [2022-12-06 00:28:25,720 INFO L137 encePairwiseOnDemand]: 13/53 looper letters, 102 selfloop transitions, 113 changer transitions 12/227 dead transitions. [2022-12-06 00:28:25,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 227 transitions, 3451 flow [2022-12-06 00:28:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:28:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:28:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 125 transitions. [2022-12-06 00:28:25,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13873473917869034 [2022-12-06 00:28:25,739 INFO L175 Difference]: Start difference. First operand has 106 places, 173 transitions, 2576 flow. Second operand 17 states and 125 transitions. [2022-12-06 00:28:25,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 227 transitions, 3451 flow [2022-12-06 00:28:25,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 227 transitions, 3255 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-06 00:28:25,770 INFO L231 Difference]: Finished difference. Result has 119 places, 182 transitions, 2865 flow [2022-12-06 00:28:25,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2398, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2865, PETRI_PLACES=119, PETRI_TRANSITIONS=182} [2022-12-06 00:28:25,771 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 97 predicate places. [2022-12-06 00:28:25,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:25,771 INFO L89 Accepts]: Start accepts. Operand has 119 places, 182 transitions, 2865 flow [2022-12-06 00:28:25,772 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:25,772 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:25,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 182 transitions, 2865 flow [2022-12-06 00:28:25,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 182 transitions, 2865 flow [2022-12-06 00:28:25,817 INFO L130 PetriNetUnfolder]: 209/554 cut-off events. [2022-12-06 00:28:25,817 INFO L131 PetriNetUnfolder]: For 2899/2911 co-relation queries the response was YES. [2022-12-06 00:28:25,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3434 conditions, 554 events. 209/554 cut-off events. For 2899/2911 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3442 event pairs, 26 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 3319. Up to 195 conditions per place. [2022-12-06 00:28:25,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 182 transitions, 2865 flow [2022-12-06 00:28:25,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 386 [2022-12-06 00:28:25,833 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 [706] L47-1-->L65-1: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= v_~j~0_119 (+ (select (select |v_#memory_int_217| v_~q2~0.base_80) (+ (* v_~q2_front~0_111 4) v_~q2~0.offset_80)) 1)) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (ite (and (< v_~q2_front~0_111 v_~q2_back~0_131) (< v_~q2_front~0_111 v_~n2~0_94) (<= 0 v_~q2_front~0_111)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= (+ v_~q2_front~0_111 1) v_~q2_front~0_110) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (not (< v_~i~0_123 v_~N~0_78))) InVars {~n2~0=v_~n2~0_94, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, #memory_int=|v_#memory_int_217|, ~q2_front~0=v_~q2_front~0_111, ~q2~0.base=v_~q2~0.base_80, ~N~0=v_~N~0_78, ~q2_back~0=v_~q2_back~0_131} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_34|, ~j~0=v_~j~0_119, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_28|, ~n2~0=v_~n2~0_94, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, ~q2_front~0=v_~q2_front~0_110, ~N~0=v_~N~0_78, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_28|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, #memory_int=|v_#memory_int_217|, ~q2~0.base=v_~q2~0.base_80, ~q2_back~0=v_~q2_back~0_131, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 00:28:25,960 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:25,960 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:25,960 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:25,960 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:25,960 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:25,960 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [803] L65-1-->L65-1: Formula: (and (= v_~j~0_314 (+ (select (select |v_#memory_int_456| v_~q2~0.base_228) (+ (* v_~q2_front~0_307 4) v_~q2~0.offset_228)) 1)) (not (= (ite (and (<= 0 v_~q1_back~0_359) (< v_~q1_back~0_359 v_~n1~0_238)) 1 0) 0)) (not (= (ite (= v_~j~0_315 (select (select |v_#memory_int_456| v_~q1~0.base_253) (+ (* v_~q1_back~0_359 4) v_~q1~0.offset_253))) 1 0) 0)) (= (+ v_~q2_front~0_307 1) v_~q2_front~0_306) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_208|) (= (+ v_~q1_back~0_359 1) v_~q1_back~0_358) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| (ite (and (< v_~q2_front~0_307 v_~q2_back~0_376) (< v_~q2_front~0_307 v_~n2~0_236) (<= 0 v_~q2_front~0_307)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_208| 0)) (< v_~j~0_315 v_~N~0_240)) InVars {~j~0=v_~j~0_315, ~q1~0.offset=v_~q1~0.offset_253, ~n2~0=v_~n2~0_236, ~q1_back~0=v_~q1_back~0_359, ~q2~0.offset=v_~q2~0.offset_228, ~n1~0=v_~n1~0_238, ~q1~0.base=v_~q1~0.base_253, #memory_int=|v_#memory_int_456|, ~q2_front~0=v_~q2_front~0_307, ~q2~0.base=v_~q2~0.base_228, ~N~0=v_~N~0_240, ~q2_back~0=v_~q2_back~0_376} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_128|, ~j~0=v_~j~0_314, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_122|, ~q1~0.offset=v_~q1~0.offset_253, ~n2~0=v_~n2~0_236, ~q2~0.offset=v_~q2~0.offset_228, ~n1~0=v_~n1~0_238, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208|, ~q2_front~0=v_~q2_front~0_306, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_110|, ~N~0=v_~N~0_240, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_110|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_122|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_208|, ~q1_back~0=v_~q1_back~0_358, ~q1~0.base=v_~q1~0.base_253, #memory_int=|v_#memory_int_456|, ~q2~0.base=v_~q2~0.base_228, ~q2_back~0=v_~q2_back~0_376} 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-06 00:28:26,143 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,143 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,144 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,144 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,350 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [820] L65-1-->L70: Formula: (let ((.cse1 (select |v_#memory_int_495| v_~q1~0.base_279)) (.cse2 (* v_~q1_back~0_414 4))) (and (< v_~j~0_369 v_~N~0_266) (not (= (ite (let ((.cse0 (+ v_~q1_back~0_414 1))) (and (<= 0 .cse0) (< .cse0 v_~n1~0_264))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265| (ite (= v_~j~0_369 (select .cse1 (+ .cse2 v_~q1~0.offset_279 4))) 1 0)) (= v_~j~0_369 (+ (select (select |v_#memory_int_495| v_~q2~0.base_258) (+ v_~q2~0.offset_258 (* v_~q2_front~0_370 4))) 1)) (= (+ 2 v_~q1_back~0_414) v_~q1_back~0_412) (not (= (ite (= v_~j~0_370 (select .cse1 (+ .cse2 v_~q1~0.offset_279))) 1 0) 0)) (= (+ v_~q2_front~0_370 1) v_~q2_front~0_369) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_265|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_265| 0)) (not (= (ite (and (< v_~q1_back~0_414 v_~n1~0_264) (<= 0 v_~q1_back~0_414)) 1 0) 0)) (< v_~j~0_370 v_~N~0_266) (not (= (ite (and (<= 0 v_~q2_front~0_370) (< v_~q2_front~0_370 v_~n2~0_266) (< v_~q2_front~0_370 v_~q2_back~0_419)) 1 0) 0)))) InVars {~j~0=v_~j~0_370, ~q1~0.offset=v_~q1~0.offset_279, ~n2~0=v_~n2~0_266, ~q1_back~0=v_~q1_back~0_414, ~n1~0=v_~n1~0_264, ~q2~0.offset=v_~q2~0.offset_258, ~q1~0.base=v_~q1~0.base_279, #memory_int=|v_#memory_int_495|, ~q2_front~0=v_~q2_front~0_370, ~q2~0.base=v_~q2~0.base_258, ~N~0=v_~N~0_266, ~q2_back~0=v_~q2_back~0_419} OutVars{~j~0=v_~j~0_369, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_165|, ~q1~0.offset=v_~q1~0.offset_279, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_159|, ~n2~0=v_~n2~0_266, ~n1~0=v_~n1~0_264, ~q2~0.offset=v_~q2~0.offset_258, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_141|, ~q2_front~0=v_~q2_front~0_369, ~N~0=v_~N~0_266, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_141|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_159|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_265|, ~q1_back~0=v_~q1_back~0_412, ~q1~0.base=v_~q1~0.base_279, #memory_int=|v_#memory_int_495|, ~q2~0.base=v_~q2~0.base_258, ~q2_back~0=v_~q2_back~0_419} 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-06 00:28:26,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [821] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_497| v_~q1~0.base_281))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_283| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283| 0)) (= v_~j~0_373 (+ (select (select |v_#memory_int_497| v_~q2~0.base_260) (+ v_~q2~0.offset_260 (* v_~q2_front~0_374 4))) 1)) (= (+ v_~q2_front~0_374 1) v_~q2_front~0_373) (= (ite (and (< v_~q1_front~0_393 v_~q1_back~0_418) (<= 0 v_~q1_front~0_393) (< v_~q1_front~0_393 v_~n1~0_266)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_283|) (= v_~q1_back~0_418 (+ v_~q1_back~0_419 1)) (= v_~i~0_374 (+ (select .cse0 (+ v_~q1~0.offset_281 (* v_~q1_front~0_393 4))) 1)) (< v_~j~0_374 v_~N~0_268) (not (= (ite (and (<= 0 v_~q1_back~0_419) (< v_~q1_back~0_419 v_~n1~0_266)) 1 0) 0)) (not (= (ite (= v_~j~0_374 (select .cse0 (+ (* v_~q1_back~0_419 4) v_~q1~0.offset_281))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| (ite (and (< v_~q2_front~0_374 v_~n2~0_268) (< v_~q2_front~0_374 v_~q2_back~0_421) (<= 0 v_~q2_front~0_374)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269|) (= v_~q1_front~0_392 (+ v_~q1_front~0_393 1)))) InVars {~j~0=v_~j~0_374, ~q1~0.offset=v_~q1~0.offset_281, ~q1_front~0=v_~q1_front~0_393, ~n2~0=v_~n2~0_268, ~n1~0=v_~n1~0_266, ~q2~0.offset=v_~q2~0.offset_260, ~q2_front~0=v_~q2_front~0_374, ~N~0=v_~N~0_268, ~q1_back~0=v_~q1_back~0_419, ~q1~0.base=v_~q1~0.base_281, #memory_int=|v_#memory_int_497|, ~q2~0.base=v_~q2~0.base_260, ~q2_back~0=v_~q2_back~0_421} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_167|, ~j~0=v_~j~0_373, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_161|, ~q1_front~0=v_~q1_front~0_392, ~n1~0=v_~n1~0_266, ~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_269|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_161|, ~q1_back~0=v_~q1_back~0_418, ~q1~0.base=v_~q1~0.base_281, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_181|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283|, ~q2~0.base=v_~q2~0.base_260, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_175|, ~q2_back~0=v_~q2_back~0_421, ~q1~0.offset=v_~q1~0.offset_281, ~n2~0=v_~n2~0_268, ~i~0=v_~i~0_374, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_175|, ~q2_front~0=v_~q2_front~0_373, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_145|, ~N~0=v_~N~0_268, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_145|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_283|, #memory_int=|v_#memory_int_497|} AuxVars[] AssignedVars[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] and [813] L65-1-->L65-1: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_43| 0) (not (= (ite (= v_~j~0_349 (select (select |v_#memory_int_478| v_~q1~0.base_269) (+ (* v_~q1_back~0_392 4) v_~q1~0.offset_269))) 1 0) 0)) (not (< v_~i~0_365 v_~N~0_254)) (= (ite (and (< v_~q2_front~0_349 v_~n2~0_254) (<= 0 v_~q2_front~0_349) (< v_~q2_front~0_349 v_~q2_back~0_404)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_242|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_242| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_242|) (< v_~j~0_349 v_~N~0_254) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_242| 0)) (not (= (ite (and (< v_~q1_back~0_392 v_~n1~0_254) (<= 0 v_~q1_back~0_392)) 1 0) 0)) (= (+ v_~q1_back~0_392 1) v_~q1_back~0_391) (= |v_thread1Thread1of1ForFork0_#res#1.offset_43| 0) (= (+ v_~q2_front~0_349 1) v_~q2_front~0_348) (= v_~j~0_348 (+ (select (select |v_#memory_int_478| v_~q2~0.base_246) (+ v_~q2~0.offset_246 (* v_~q2_front~0_349 4))) 1))) InVars {~j~0=v_~j~0_349, ~q1~0.offset=v_~q1~0.offset_269, ~n2~0=v_~n2~0_254, ~i~0=v_~i~0_365, ~q2~0.offset=v_~q2~0.offset_246, ~n1~0=v_~n1~0_254, ~q2_front~0=v_~q2_front~0_349, ~N~0=v_~N~0_254, ~q1_back~0=v_~q1_back~0_392, ~q1~0.base=v_~q1~0.base_269, #memory_int=|v_#memory_int_478|, ~q2~0.base=v_~q2~0.base_246, ~q2_back~0=v_~q2_back~0_404} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_153|, ~j~0=v_~j~0_348, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_147|, ~q1~0.offset=v_~q1~0.offset_269, ~n2~0=v_~n2~0_254, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_43|, ~i~0=v_~i~0_365, ~q2~0.offset=v_~q2~0.offset_246, ~n1~0=v_~n1~0_254, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_242|, ~q2_front~0=v_~q2_front~0_348, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_129|, ~N~0=v_~N~0_254, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_129|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_147|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_242|, ~q1_back~0=v_~q1_back~0_391, ~q1~0.base=v_~q1~0.base_269, #memory_int=|v_#memory_int_478|, ~q2~0.base=v_~q2~0.base_246, ~q2_back~0=v_~q2_back~0_404, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork0_#res#1.offset, ~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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 00:28:26,635 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,635 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,635 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,636 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,636 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,636 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,636 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:26,636 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,145 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,145 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,145 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,145 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,145 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,145 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,268 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,268 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,269 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,269 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,269 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,269 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:27,671 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 00:28:27,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1900 [2022-12-06 00:28:27,672 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 179 transitions, 2858 flow [2022-12-06 00:28:27,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 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-06 00:28:27,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:27,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:27,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:27,872 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,SelfDestructingSolverStorable17 [2022-12-06 00:28:27,872 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:27,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:27,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1983618952, now seen corresponding path program 1 times [2022-12-06 00:28:27,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:27,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998958190] [2022-12-06 00:28:27,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:27,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:27,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:27,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998958190] [2022-12-06 00:28:27,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998958190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:27,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:27,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:28:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133536398] [2022-12-06 00:28:27,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:27,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:28:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:28:27,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:28:27,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 00:28:27,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 179 transitions, 2858 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:27,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:27,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 00:28:27,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:28,157 INFO L130 PetriNetUnfolder]: 639/1163 cut-off events. [2022-12-06 00:28:28,157 INFO L131 PetriNetUnfolder]: For 10359/10359 co-relation queries the response was YES. [2022-12-06 00:28:28,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8518 conditions, 1163 events. 639/1163 cut-off events. For 10359/10359 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6159 event pairs, 214 based on Foata normal form. 6/1168 useless extension candidates. Maximal degree in co-relation 8216. Up to 959 conditions per place. [2022-12-06 00:28:28,164 INFO L137 encePairwiseOnDemand]: 48/59 looper letters, 191 selfloop transitions, 17 changer transitions 3/211 dead transitions. [2022-12-06 00:28:28,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 211 transitions, 3645 flow [2022-12-06 00:28:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:28:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:28:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-06 00:28:28,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4519774011299435 [2022-12-06 00:28:28,165 INFO L175 Difference]: Start difference. First operand has 115 places, 179 transitions, 2858 flow. Second operand 3 states and 80 transitions. [2022-12-06 00:28:28,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 211 transitions, 3645 flow [2022-12-06 00:28:28,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 211 transitions, 3464 flow, removed 31 selfloop flow, removed 10 redundant places. [2022-12-06 00:28:28,195 INFO L231 Difference]: Finished difference. Result has 108 places, 182 transitions, 2795 flow [2022-12-06 00:28:28,195 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2600, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2795, PETRI_PLACES=108, PETRI_TRANSITIONS=182} [2022-12-06 00:28:28,196 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 86 predicate places. [2022-12-06 00:28:28,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:28,196 INFO L89 Accepts]: Start accepts. Operand has 108 places, 182 transitions, 2795 flow [2022-12-06 00:28:28,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:28,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:28,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 182 transitions, 2795 flow [2022-12-06 00:28:28,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 182 transitions, 2795 flow [2022-12-06 00:28:28,242 INFO L130 PetriNetUnfolder]: 211/557 cut-off events. [2022-12-06 00:28:28,243 INFO L131 PetriNetUnfolder]: For 2623/2631 co-relation queries the response was YES. [2022-12-06 00:28:28,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3413 conditions, 557 events. 211/557 cut-off events. For 2623/2631 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3501 event pairs, 27 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 3272. Up to 196 conditions per place. [2022-12-06 00:28:28,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 182 transitions, 2795 flow [2022-12-06 00:28:28,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 00:28:28,247 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:28,247 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:28,247 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:28,247 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:28,247 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:28,247 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:28,247 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:28,247 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:28:28,785 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:28,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 590 [2022-12-06 00:28:28,786 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 182 transitions, 2803 flow [2022-12-06 00:28:28,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:28,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:28,786 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:28,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:28:28,786 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:28,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2082315136, now seen corresponding path program 1 times [2022-12-06 00:28:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:28,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941280195] [2022-12-06 00:28:28,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:28,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:28,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:28,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941280195] [2022-12-06 00:28:28,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941280195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:28,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:28,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:28:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643621566] [2022-12-06 00:28:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:28,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:28,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:28,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:28,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:28,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 00:28:28,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 182 transitions, 2803 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:28,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:28,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 00:28:28,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:29,094 INFO L130 PetriNetUnfolder]: 660/1273 cut-off events. [2022-12-06 00:28:29,094 INFO L131 PetriNetUnfolder]: For 10072/10072 co-relation queries the response was YES. [2022-12-06 00:28:29,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8894 conditions, 1273 events. 660/1273 cut-off events. For 10072/10072 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 7330 event pairs, 133 based on Foata normal form. 104/1376 useless extension candidates. Maximal degree in co-relation 8703. Up to 517 conditions per place. [2022-12-06 00:28:29,101 INFO L137 encePairwiseOnDemand]: 26/54 looper letters, 137 selfloop transitions, 64 changer transitions 13/214 dead transitions. [2022-12-06 00:28:29,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 214 transitions, 3564 flow [2022-12-06 00:28:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-06 00:28:29,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2022-12-06 00:28:29,101 INFO L175 Difference]: Start difference. First operand has 105 places, 182 transitions, 2803 flow. Second operand 4 states and 80 transitions. [2022-12-06 00:28:29,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 214 transitions, 3564 flow [2022-12-06 00:28:29,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 214 transitions, 3472 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:29,133 INFO L231 Difference]: Finished difference. Result has 108 places, 176 transitions, 2863 flow [2022-12-06 00:28:29,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2509, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2863, PETRI_PLACES=108, PETRI_TRANSITIONS=176} [2022-12-06 00:28:29,134 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 86 predicate places. [2022-12-06 00:28:29,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:29,134 INFO L89 Accepts]: Start accepts. Operand has 108 places, 176 transitions, 2863 flow [2022-12-06 00:28:29,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:29,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:29,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 176 transitions, 2863 flow [2022-12-06 00:28:29,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 176 transitions, 2863 flow [2022-12-06 00:28:29,179 INFO L130 PetriNetUnfolder]: 203/558 cut-off events. [2022-12-06 00:28:29,179 INFO L131 PetriNetUnfolder]: For 3340/3349 co-relation queries the response was YES. [2022-12-06 00:28:29,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 558 events. 203/558 cut-off events. For 3340/3349 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3523 event pairs, 32 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 3430. Up to 175 conditions per place. [2022-12-06 00:28:29,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 176 transitions, 2863 flow [2022-12-06 00:28:29,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-06 00:28:29,187 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~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_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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-06 00:28:29,263 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~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_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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-06 00:28:29,335 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:28:29,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:28:29,336 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 174 transitions, 2857 flow [2022-12-06 00:28:29,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:29,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:29,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:29,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:28:29,336 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:29,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1314614548, now seen corresponding path program 1 times [2022-12-06 00:28:29,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:29,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130010970] [2022-12-06 00:28:29,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:29,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:29,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:29,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130010970] [2022-12-06 00:28:29,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130010970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:29,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164817585] [2022-12-06 00:28:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:29,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:29,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:29,402 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:29,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 00:28:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:29,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:28:29,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:29,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:28:29,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164817585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:29,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:28:29,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 00:28:29,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90634210] [2022-12-06 00:28:29,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:29,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:29,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:29,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:29,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:28:29,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:28:29,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 174 transitions, 2857 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-06 00:28:29,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:29,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:28:29,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:29,714 INFO L130 PetriNetUnfolder]: 411/829 cut-off events. [2022-12-06 00:28:29,714 INFO L131 PetriNetUnfolder]: For 7330/7330 co-relation queries the response was YES. [2022-12-06 00:28:29,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6061 conditions, 829 events. 411/829 cut-off events. For 7330/7330 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4475 event pairs, 148 based on Foata normal form. 76/904 useless extension candidates. Maximal degree in co-relation 5989. Up to 628 conditions per place. [2022-12-06 00:28:29,718 INFO L137 encePairwiseOnDemand]: 33/46 looper letters, 170 selfloop transitions, 5 changer transitions 23/198 dead transitions. [2022-12-06 00:28:29,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 198 transitions, 3479 flow [2022-12-06 00:28:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 00:28:29,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41847826086956524 [2022-12-06 00:28:29,719 INFO L175 Difference]: Start difference. First operand has 100 places, 174 transitions, 2857 flow. Second operand 4 states and 77 transitions. [2022-12-06 00:28:29,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 198 transitions, 3479 flow [2022-12-06 00:28:29,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 198 transitions, 3421 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-06 00:28:29,740 INFO L231 Difference]: Finished difference. Result has 101 places, 151 transitions, 2416 flow [2022-12-06 00:28:29,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2583, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2416, PETRI_PLACES=101, PETRI_TRANSITIONS=151} [2022-12-06 00:28:29,741 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 79 predicate places. [2022-12-06 00:28:29,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:29,741 INFO L89 Accepts]: Start accepts. Operand has 101 places, 151 transitions, 2416 flow [2022-12-06 00:28:29,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:29,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:29,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 151 transitions, 2416 flow [2022-12-06 00:28:29,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 151 transitions, 2416 flow [2022-12-06 00:28:29,772 INFO L130 PetriNetUnfolder]: 126/371 cut-off events. [2022-12-06 00:28:29,772 INFO L131 PetriNetUnfolder]: For 2286/2293 co-relation queries the response was YES. [2022-12-06 00:28:29,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 371 events. 126/371 cut-off events. For 2286/2293 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2102 event pairs, 19 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 2023. Up to 114 conditions per place. [2022-12-06 00:28:29,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 151 transitions, 2416 flow [2022-12-06 00:28:29,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-06 00:28:29,775 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:29,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 00:28:29,775 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 151 transitions, 2416 flow [2022-12-06 00:28:29,775 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-06 00:28:29,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:29,776 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:29,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-06 00:28:29,980 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,SelfDestructingSolverStorable20 [2022-12-06 00:28:29,980 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:29,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:29,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1069716047, now seen corresponding path program 1 times [2022-12-06 00:28:29,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:29,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764237778] [2022-12-06 00:28:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:30,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:30,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764237778] [2022-12-06 00:28:30,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764237778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:30,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542028399] [2022-12-06 00:28:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:30,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:30,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:30,724 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:30,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 00:28:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:30,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 00:28:30,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:30,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:30,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:30,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:30,841 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:28:30,842 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 17 treesize of output 23 [2022-12-06 00:28:30,845 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-06 00:28:30,848 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-06 00:28:30,911 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-06 00:28:31,050 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-06 00:28:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:31,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:31,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542028399] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:31,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:31,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2022-12-06 00:28:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770382954] [2022-12-06 00:28:31,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:31,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 00:28:31,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:31,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 00:28:31,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=257, Unknown=1, NotChecked=0, Total=306 [2022-12-06 00:28:31,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:28:31,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 151 transitions, 2416 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-06 00:28:31,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:31,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:28:31,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:32,351 INFO L130 PetriNetUnfolder]: 383/756 cut-off events. [2022-12-06 00:28:32,351 INFO L131 PetriNetUnfolder]: For 6012/6012 co-relation queries the response was YES. [2022-12-06 00:28:32,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5511 conditions, 756 events. 383/756 cut-off events. For 6012/6012 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3886 event pairs, 27 based on Foata normal form. 5/760 useless extension candidates. Maximal degree in co-relation 4750. Up to 433 conditions per place. [2022-12-06 00:28:32,356 INFO L137 encePairwiseOnDemand]: 14/42 looper letters, 59 selfloop transitions, 107 changer transitions 7/173 dead transitions. [2022-12-06 00:28:32,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 173 transitions, 2897 flow [2022-12-06 00:28:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:28:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:28:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2022-12-06 00:28:32,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15934065934065933 [2022-12-06 00:28:32,365 INFO L175 Difference]: Start difference. First operand has 99 places, 151 transitions, 2416 flow. Second operand 13 states and 87 transitions. [2022-12-06 00:28:32,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 173 transitions, 2897 flow [2022-12-06 00:28:32,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 173 transitions, 2815 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 00:28:32,389 INFO L231 Difference]: Finished difference. Result has 108 places, 152 transitions, 2576 flow [2022-12-06 00:28:32,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2338, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2576, PETRI_PLACES=108, PETRI_TRANSITIONS=152} [2022-12-06 00:28:32,389 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 86 predicate places. [2022-12-06 00:28:32,389 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:32,389 INFO L89 Accepts]: Start accepts. Operand has 108 places, 152 transitions, 2576 flow [2022-12-06 00:28:32,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:32,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:32,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 152 transitions, 2576 flow [2022-12-06 00:28:32,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 152 transitions, 2576 flow [2022-12-06 00:28:32,422 INFO L130 PetriNetUnfolder]: 125/371 cut-off events. [2022-12-06 00:28:32,422 INFO L131 PetriNetUnfolder]: For 2339/2346 co-relation queries the response was YES. [2022-12-06 00:28:32,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 371 events. 125/371 cut-off events. For 2339/2346 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2110 event pairs, 21 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 2335. Up to 112 conditions per place. [2022-12-06 00:28:32,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 152 transitions, 2576 flow [2022-12-06 00:28:32,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 00:28:32,430 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-06 00:28:32,517 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:32,518 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-06 00:28:32,518 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 151 transitions, 2568 flow [2022-12-06 00:28:32,518 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-06 00:28:32,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:32,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:32,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:32,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-06 00:28:32,722 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:32,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash -310325306, now seen corresponding path program 1 times [2022-12-06 00:28:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:32,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302228962] [2022-12-06 00:28:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:32,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:32,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:32,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302228962] [2022-12-06 00:28:32,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302228962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:32,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:32,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:32,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147158603] [2022-12-06 00:28:32,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:32,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:28:32,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:32,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:28:32,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:28:32,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:28:32,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 151 transitions, 2568 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:32,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:32,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:28:32,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:33,027 INFO L130 PetriNetUnfolder]: 427/859 cut-off events. [2022-12-06 00:28:33,028 INFO L131 PetriNetUnfolder]: For 8003/8003 co-relation queries the response was YES. [2022-12-06 00:28:33,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6399 conditions, 859 events. 427/859 cut-off events. For 8003/8003 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4642 event pairs, 186 based on Foata normal form. 24/882 useless extension candidates. Maximal degree in co-relation 6337. Up to 661 conditions per place. [2022-12-06 00:28:33,032 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 165 selfloop transitions, 14 changer transitions 6/185 dead transitions. [2022-12-06 00:28:33,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 185 transitions, 3372 flow [2022-12-06 00:28:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:28:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:28:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 00:28:33,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3302325581395349 [2022-12-06 00:28:33,033 INFO L175 Difference]: Start difference. First operand has 106 places, 151 transitions, 2568 flow. Second operand 5 states and 71 transitions. [2022-12-06 00:28:33,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 185 transitions, 3372 flow [2022-12-06 00:28:33,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 185 transitions, 3071 flow, removed 11 selfloop flow, removed 11 redundant places. [2022-12-06 00:28:33,058 INFO L231 Difference]: Finished difference. Result has 102 places, 157 transitions, 2466 flow [2022-12-06 00:28:33,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2466, PETRI_PLACES=102, PETRI_TRANSITIONS=157} [2022-12-06 00:28:33,058 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 80 predicate places. [2022-12-06 00:28:33,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:33,058 INFO L89 Accepts]: Start accepts. Operand has 102 places, 157 transitions, 2466 flow [2022-12-06 00:28:33,059 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:33,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:33,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 157 transitions, 2466 flow [2022-12-06 00:28:33,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 157 transitions, 2466 flow [2022-12-06 00:28:33,094 INFO L130 PetriNetUnfolder]: 137/428 cut-off events. [2022-12-06 00:28:33,094 INFO L131 PetriNetUnfolder]: For 2585/2596 co-relation queries the response was YES. [2022-12-06 00:28:33,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2541 conditions, 428 events. 137/428 cut-off events. For 2585/2596 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2641 event pairs, 23 based on Foata normal form. 2/410 useless extension candidates. Maximal degree in co-relation 2088. Up to 133 conditions per place. [2022-12-06 00:28:33,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 157 transitions, 2466 flow [2022-12-06 00:28:33,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 00:28:33,098 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:33,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 00:28:33,100 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 157 transitions, 2466 flow [2022-12-06 00:28:33,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:33,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:33,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:33,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 00:28:33,100 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:33,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:33,101 INFO L85 PathProgramCache]: Analyzing trace with hash -414548473, now seen corresponding path program 1 times [2022-12-06 00:28:33,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:33,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240014499] [2022-12-06 00:28:33,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:33,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:33,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:33,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240014499] [2022-12-06 00:28:33,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240014499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:33,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611937986] [2022-12-06 00:28:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:33,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:33,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:33,946 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:33,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 00:28:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:34,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 00:28:34,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:34,089 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-06 00:28:34,146 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-06 00:28:34,250 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-06 00:28:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:34,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:34,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:34,457 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 248 treesize of output 276 [2022-12-06 00:28:34,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:34,478 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 172 treesize of output 168 [2022-12-06 00:28:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:37,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611937986] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:37,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:37,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 00:28:37,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267024380] [2022-12-06 00:28:37,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:37,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 00:28:37,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:37,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 00:28:37,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-12-06 00:28:37,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:28:37,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 157 transitions, 2466 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-06 00:28:37,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:37,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:28:37,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:38,954 INFO L130 PetriNetUnfolder]: 437/888 cut-off events. [2022-12-06 00:28:38,955 INFO L131 PetriNetUnfolder]: For 7038/7038 co-relation queries the response was YES. [2022-12-06 00:28:38,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6230 conditions, 888 events. 437/888 cut-off events. For 7038/7038 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4846 event pairs, 55 based on Foata normal form. 1/889 useless extension candidates. Maximal degree in co-relation 5085. Up to 611 conditions per place. [2022-12-06 00:28:38,959 INFO L137 encePairwiseOnDemand]: 21/43 looper letters, 89 selfloop transitions, 77 changer transitions 12/178 dead transitions. [2022-12-06 00:28:38,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 178 transitions, 2979 flow [2022-12-06 00:28:38,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:28:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:28:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-12-06 00:28:38,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15856236786469344 [2022-12-06 00:28:38,968 INFO L175 Difference]: Start difference. First operand has 102 places, 157 transitions, 2466 flow. Second operand 11 states and 75 transitions. [2022-12-06 00:28:38,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 178 transitions, 2979 flow [2022-12-06 00:28:38,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 178 transitions, 2965 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 00:28:38,998 INFO L231 Difference]: Finished difference. Result has 114 places, 157 transitions, 2611 flow [2022-12-06 00:28:38,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2452, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2611, PETRI_PLACES=114, PETRI_TRANSITIONS=157} [2022-12-06 00:28:38,998 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 92 predicate places. [2022-12-06 00:28:38,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:38,998 INFO L89 Accepts]: Start accepts. Operand has 114 places, 157 transitions, 2611 flow [2022-12-06 00:28:38,999 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:38,999 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:38,999 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 157 transitions, 2611 flow [2022-12-06 00:28:39,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 157 transitions, 2611 flow [2022-12-06 00:28:39,033 INFO L130 PetriNetUnfolder]: 135/426 cut-off events. [2022-12-06 00:28:39,033 INFO L131 PetriNetUnfolder]: For 2844/2855 co-relation queries the response was YES. [2022-12-06 00:28:39,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 426 events. 135/426 cut-off events. For 2844/2855 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2595 event pairs, 26 based on Foata normal form. 2/408 useless extension candidates. Maximal degree in co-relation 2628. Up to 131 conditions per place. [2022-12-06 00:28:39,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 157 transitions, 2611 flow [2022-12-06 00:28:39,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 00:28:39,037 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:39,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 00:28:39,037 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 157 transitions, 2611 flow [2022-12-06 00:28:39,037 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-06 00:28:39,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:39,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:39,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 00:28:39,242 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,SelfDestructingSolverStorable23 [2022-12-06 00:28:39,242 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:39,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash 9148364, now seen corresponding path program 1 times [2022-12-06 00:28:39,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:39,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085420567] [2022-12-06 00:28:39,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:39,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:39,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:39,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085420567] [2022-12-06 00:28:39,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085420567] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:39,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911133883] [2022-12-06 00:28:39,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:39,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:39,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:39,961 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:39,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 00:28:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:40,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 00:28:40,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:40,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:40,301 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-06 00:28:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:40,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:40,740 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-06 00:28:40,740 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-06 00:28:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:43,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911133883] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:43,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:43,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-06 00:28:43,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882330330] [2022-12-06 00:28:43,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:43,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 00:28:43,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:43,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 00:28:43,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-12-06 00:28:43,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:28:43,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 157 transitions, 2611 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-06 00:28:43,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:43,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:28:43,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:44,542 INFO L130 PetriNetUnfolder]: 438/919 cut-off events. [2022-12-06 00:28:44,542 INFO L131 PetriNetUnfolder]: For 7803/7803 co-relation queries the response was YES. [2022-12-06 00:28:44,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6621 conditions, 919 events. 438/919 cut-off events. For 7803/7803 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5303 event pairs, 31 based on Foata normal form. 5/924 useless extension candidates. Maximal degree in co-relation 6556. Up to 432 conditions per place. [2022-12-06 00:28:44,547 INFO L137 encePairwiseOnDemand]: 16/42 looper letters, 70 selfloop transitions, 105 changer transitions 36/211 dead transitions. [2022-12-06 00:28:44,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 211 transitions, 3419 flow [2022-12-06 00:28:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 00:28:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 00:28:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 115 transitions. [2022-12-06 00:28:44,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11904761904761904 [2022-12-06 00:28:44,549 INFO L175 Difference]: Start difference. First operand has 112 places, 157 transitions, 2611 flow. Second operand 23 states and 115 transitions. [2022-12-06 00:28:44,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 211 transitions, 3419 flow [2022-12-06 00:28:44,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 211 transitions, 3221 flow, removed 5 selfloop flow, removed 10 redundant places. [2022-12-06 00:28:44,580 INFO L231 Difference]: Finished difference. Result has 132 places, 157 transitions, 2780 flow [2022-12-06 00:28:44,581 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2425, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2780, PETRI_PLACES=132, PETRI_TRANSITIONS=157} [2022-12-06 00:28:44,581 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 110 predicate places. [2022-12-06 00:28:44,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:44,581 INFO L89 Accepts]: Start accepts. Operand has 132 places, 157 transitions, 2780 flow [2022-12-06 00:28:44,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:44,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:44,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 157 transitions, 2780 flow [2022-12-06 00:28:44,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 157 transitions, 2780 flow [2022-12-06 00:28:44,617 INFO L130 PetriNetUnfolder]: 129/407 cut-off events. [2022-12-06 00:28:44,618 INFO L131 PetriNetUnfolder]: For 3703/3712 co-relation queries the response was YES. [2022-12-06 00:28:44,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2856 conditions, 407 events. 129/407 cut-off events. For 3703/3712 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2464 event pairs, 22 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 2787. Up to 125 conditions per place. [2022-12-06 00:28:44,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 157 transitions, 2780 flow [2022-12-06 00:28:44,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 00:28:44,714 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-06 00:28:44,856 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-06 00:28:45,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} 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-06 00:28:45,126 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:28:45,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 547 [2022-12-06 00:28:45,128 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 154 transitions, 2773 flow [2022-12-06 00:28:45,128 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-06 00:28:45,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:45,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:45,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 00:28:45,333 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,SelfDestructingSolverStorable24 [2022-12-06 00:28:45,333 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:45,334 INFO L85 PathProgramCache]: Analyzing trace with hash 184654751, now seen corresponding path program 1 times [2022-12-06 00:28:45,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:45,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711697460] [2022-12-06 00:28:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:45,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:46,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:46,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711697460] [2022-12-06 00:28:46,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711697460] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:46,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517054435] [2022-12-06 00:28:46,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:46,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:46,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:46,354 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:46,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 00:28:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:46,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 00:28:46,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:46,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:46,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:46,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:46,488 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:28:46,489 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 17 treesize of output 23 [2022-12-06 00:28:46,492 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-06 00:28:46,497 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-06 00:28:46,537 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-06 00:28:46,641 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-06 00:28:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:46,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:46,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517054435] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:46,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:46,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 00:28:46,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341977727] [2022-12-06 00:28:46,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:46,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 00:28:46,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:46,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 00:28:46,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-12-06 00:28:46,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 00:28:46,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 154 transitions, 2773 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-06 00:28:46,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:46,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 00:28:46,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:47,959 INFO L130 PetriNetUnfolder]: 404/807 cut-off events. [2022-12-06 00:28:47,960 INFO L131 PetriNetUnfolder]: For 10659/10659 co-relation queries the response was YES. [2022-12-06 00:28:47,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6579 conditions, 807 events. 404/807 cut-off events. For 10659/10659 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4285 event pairs, 39 based on Foata normal form. 1/808 useless extension candidates. Maximal degree in co-relation 6507. Up to 504 conditions per place. [2022-12-06 00:28:47,968 INFO L137 encePairwiseOnDemand]: 23/49 looper letters, 87 selfloop transitions, 67 changer transitions 24/178 dead transitions. [2022-12-06 00:28:47,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 178 transitions, 3387 flow [2022-12-06 00:28:47,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:28:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:28:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-06 00:28:47,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15213358070500926 [2022-12-06 00:28:47,975 INFO L175 Difference]: Start difference. First operand has 118 places, 154 transitions, 2773 flow. Second operand 11 states and 82 transitions. [2022-12-06 00:28:47,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 178 transitions, 3387 flow [2022-12-06 00:28:48,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 178 transitions, 3138 flow, removed 38 selfloop flow, removed 14 redundant places. [2022-12-06 00:28:48,009 INFO L231 Difference]: Finished difference. Result has 117 places, 150 transitions, 2606 flow [2022-12-06 00:28:48,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2540, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2606, PETRI_PLACES=117, PETRI_TRANSITIONS=150} [2022-12-06 00:28:48,010 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 95 predicate places. [2022-12-06 00:28:48,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:48,011 INFO L89 Accepts]: Start accepts. Operand has 117 places, 150 transitions, 2606 flow [2022-12-06 00:28:48,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:48,014 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:48,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 150 transitions, 2606 flow [2022-12-06 00:28:48,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 150 transitions, 2606 flow [2022-12-06 00:28:48,064 INFO L130 PetriNetUnfolder]: 128/371 cut-off events. [2022-12-06 00:28:48,064 INFO L131 PetriNetUnfolder]: For 3463/3472 co-relation queries the response was YES. [2022-12-06 00:28:48,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2597 conditions, 371 events. 128/371 cut-off events. For 3463/3472 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2124 event pairs, 15 based on Foata normal form. 3/356 useless extension candidates. Maximal degree in co-relation 2539. Up to 110 conditions per place. [2022-12-06 00:28:48,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 150 transitions, 2606 flow [2022-12-06 00:28:48,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 00:28:48,068 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:48,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 00:28:48,069 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 150 transitions, 2606 flow [2022-12-06 00:28:48,069 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-06 00:28:48,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:48,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:48,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 00:28:48,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:48,273 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:48,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash 623784216, now seen corresponding path program 1 times [2022-12-06 00:28:48,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:48,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964553046] [2022-12-06 00:28:48,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:48,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:49,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:49,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964553046] [2022-12-06 00:28:49,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964553046] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:49,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47581230] [2022-12-06 00:28:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:49,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:49,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:49,994 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:49,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 00:28:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:50,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 00:28:50,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:50,111 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-06 00:28:50,218 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-06 00:28:50,307 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 58 treesize of output 22 [2022-12-06 00:28:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:50,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:50,465 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_1241 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241))) (let ((.cse2 (select .cse0 c_~q1~0.base))) (or (< (select (select .cse0 c_~q2~0.base) .cse1) c_~N~0) (not (= (select .cse2 .cse3) c_~j~0)) (< (+ (select .cse2 .cse4) 1) c_~N~0))))) (forall ((v_ArrVal_1241 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241))) (let ((.cse5 (select .cse7 c_~q1~0.base))) (let ((.cse6 (select .cse5 .cse4))) (or (not (= (select .cse5 .cse3) c_~j~0)) (< (+ .cse6 1) c_~N~0) (< .cse6 (+ (select (select .cse7 c_~q2~0.base) .cse1) 1))))))))) is different from false [2022-12-06 00:28:50,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:50,503 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 280 treesize of output 300 [2022-12-06 00:28:50,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:50,528 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-06 00:28:50,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:50,551 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-06 00:28:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:56,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47581230] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:56,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:56,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 00:28:56,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687737123] [2022-12-06 00:28:56,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:56,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:28:56,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:56,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:28:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=298, Unknown=1, NotChecked=34, Total=380 [2022-12-06 00:28:56,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:28:56,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 150 transitions, 2606 flow. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:56,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:56,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:28:56,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:58,385 INFO L130 PetriNetUnfolder]: 450/900 cut-off events. [2022-12-06 00:28:58,385 INFO L131 PetriNetUnfolder]: For 10767/10767 co-relation queries the response was YES. [2022-12-06 00:28:58,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7161 conditions, 900 events. 450/900 cut-off events. For 10767/10767 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4945 event pairs, 32 based on Foata normal form. 7/907 useless extension candidates. Maximal degree in co-relation 7096. Up to 531 conditions per place. [2022-12-06 00:28:58,390 INFO L137 encePairwiseOnDemand]: 20/46 looper letters, 92 selfloop transitions, 105 changer transitions 12/209 dead transitions. [2022-12-06 00:28:58,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 209 transitions, 3691 flow [2022-12-06 00:28:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 00:28:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 00:28:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 121 transitions. [2022-12-06 00:28:58,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13152173913043477 [2022-12-06 00:28:58,392 INFO L175 Difference]: Start difference. First operand has 106 places, 150 transitions, 2606 flow. Second operand 20 states and 121 transitions. [2022-12-06 00:28:58,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 209 transitions, 3691 flow [2022-12-06 00:28:58,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 209 transitions, 3593 flow, removed 26 selfloop flow, removed 8 redundant places. [2022-12-06 00:28:58,431 INFO L231 Difference]: Finished difference. Result has 121 places, 172 transitions, 3178 flow [2022-12-06 00:28:58,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2533, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3178, PETRI_PLACES=121, PETRI_TRANSITIONS=172} [2022-12-06 00:28:58,432 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 99 predicate places. [2022-12-06 00:28:58,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:58,432 INFO L89 Accepts]: Start accepts. Operand has 121 places, 172 transitions, 3178 flow [2022-12-06 00:28:58,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:58,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:58,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 172 transitions, 3178 flow [2022-12-06 00:28:58,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 172 transitions, 3178 flow [2022-12-06 00:28:58,471 INFO L130 PetriNetUnfolder]: 139/414 cut-off events. [2022-12-06 00:28:58,471 INFO L131 PetriNetUnfolder]: For 4100/4111 co-relation queries the response was YES. [2022-12-06 00:28:58,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3023 conditions, 414 events. 139/414 cut-off events. For 4100/4111 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2470 event pairs, 18 based on Foata normal form. 2/398 useless extension candidates. Maximal degree in co-relation 2827. Up to 116 conditions per place. [2022-12-06 00:28:58,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 172 transitions, 3178 flow [2022-12-06 00:28:58,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 00:29:00,427 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-06 00:29:00,510 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-06 00:29:00,594 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:29:00,595 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2163 [2022-12-06 00:29:00,595 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 170 transitions, 3163 flow [2022-12-06 00:29:00,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:00,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:00,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:00,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:00,799 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-06 00:29:00,800 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash -797635799, now seen corresponding path program 1 times [2022-12-06 00:29:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:00,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714189508] [2022-12-06 00:29:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:00,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:00,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:00,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714189508] [2022-12-06 00:29:00,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714189508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:00,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:00,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:00,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337643626] [2022-12-06 00:29:00,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:00,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:00,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:00,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:00,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:00,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 00:29:00,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 170 transitions, 3163 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:00,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:00,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 00:29:00,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:01,069 INFO L130 PetriNetUnfolder]: 445/892 cut-off events. [2022-12-06 00:29:01,069 INFO L131 PetriNetUnfolder]: For 11623/11623 co-relation queries the response was YES. [2022-12-06 00:29:01,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7377 conditions, 892 events. 445/892 cut-off events. For 11623/11623 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4366 event pairs, 90 based on Foata normal form. 40/931 useless extension candidates. Maximal degree in co-relation 6854. Up to 391 conditions per place. [2022-12-06 00:29:01,075 INFO L137 encePairwiseOnDemand]: 31/49 looper letters, 125 selfloop transitions, 49 changer transitions 4/178 dead transitions. [2022-12-06 00:29:01,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 178 transitions, 3505 flow [2022-12-06 00:29:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:29:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:29:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 00:29:01,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34183673469387754 [2022-12-06 00:29:01,076 INFO L175 Difference]: Start difference. First operand has 117 places, 170 transitions, 3163 flow. Second operand 4 states and 67 transitions. [2022-12-06 00:29:01,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 178 transitions, 3505 flow [2022-12-06 00:29:01,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 178 transitions, 3090 flow, removed 49 selfloop flow, removed 15 redundant places. [2022-12-06 00:29:01,109 INFO L231 Difference]: Finished difference. Result has 106 places, 142 transitions, 2450 flow [2022-12-06 00:29:01,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2180, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2450, PETRI_PLACES=106, PETRI_TRANSITIONS=142} [2022-12-06 00:29:01,112 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 84 predicate places. [2022-12-06 00:29:01,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:01,112 INFO L89 Accepts]: Start accepts. Operand has 106 places, 142 transitions, 2450 flow [2022-12-06 00:29:01,113 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:01,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:01,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 142 transitions, 2450 flow [2022-12-06 00:29:01,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 142 transitions, 2450 flow [2022-12-06 00:29:01,151 INFO L130 PetriNetUnfolder]: 145/436 cut-off events. [2022-12-06 00:29:01,151 INFO L131 PetriNetUnfolder]: For 4209/4218 co-relation queries the response was YES. [2022-12-06 00:29:01,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 436 events. 145/436 cut-off events. For 4209/4218 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2335 event pairs, 19 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 2799. Up to 124 conditions per place. [2022-12-06 00:29:01,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 142 transitions, 2450 flow [2022-12-06 00:29:01,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 00:29:01,155 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:01,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 00:29:01,158 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 142 transitions, 2450 flow [2022-12-06 00:29:01,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:01,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:01,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:01,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 00:29:01,158 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:01,158 INFO L85 PathProgramCache]: Analyzing trace with hash 591849985, now seen corresponding path program 1 times [2022-12-06 00:29:01,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:01,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215809351] [2022-12-06 00:29:01,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:01,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:02,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:02,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215809351] [2022-12-06 00:29:02,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215809351] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:02,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473387] [2022-12-06 00:29:02,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:02,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:02,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:02,616 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:02,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 00:29:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:02,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 00:29:02,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:02,743 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-06 00:29:02,870 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-06 00:29:02,975 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-06 00:29:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:03,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:03,176 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_1332 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1332))) (let ((.cse0 (select .cse3 c_~q1~0.base))) (or (not (= (select .cse0 .cse1) c_~j~0)) (< (select .cse0 .cse2) c_~N~0) (< (+ (select (select .cse3 c_~q2~0.base) .cse4) 1) c_~N~0))))) (forall ((v_ArrVal_1332 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1332))) (let ((.cse5 (select .cse6 c_~q1~0.base))) (or (not (= (select .cse5 .cse1) c_~j~0)) (< (+ (select .cse5 .cse2) 1) c_~N~0) (< (select (select .cse6 c_~q2~0.base) .cse4) c_~N~0))))))) is different from false [2022-12-06 00:29:03,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:03,218 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 204 treesize of output 248 [2022-12-06 00:29:03,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:03,249 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-06 00:29:03,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:03,272 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-06 00:29:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:06,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473387] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:06,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:06,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-06 00:29:06,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452590616] [2022-12-06 00:29:06,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:06,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 00:29:06,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:06,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 00:29:06,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2022-12-06 00:29:06,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:29:06,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 142 transitions, 2450 flow. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:06,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:06,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:29:06,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:07,517 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (let ((.cse7 (select (select |c_#memory_int| c_~q2~0.base) .cse4))) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse8 (< (+ .cse7 1) c_~N~0)) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_1332 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1332))) (let ((.cse0 (select .cse3 c_~q1~0.base))) (or (not (= (select .cse0 .cse1) c_~j~0)) (< (select .cse0 .cse2) c_~N~0) (< (+ (select (select .cse3 c_~q2~0.base) .cse4) 1) c_~N~0))))) (<= c_~i~0 c_~j~0) (forall ((v_ArrVal_1332 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1332))) (let ((.cse5 (select .cse6 c_~q1~0.base))) (or (not (= (select .cse5 .cse1) c_~j~0)) (< (+ (select .cse5 .cse2) 1) c_~N~0) (< (select (select .cse6 c_~q2~0.base) .cse4) c_~N~0))))) (< c_~j~0 (+ c_~i~0 1)) (or (and (< .cse7 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) .cse8)) (< c_~i~0 c_~N~0)) (let ((.cse9 (select |c_#memory_int| c_~q1~0.base))) (or (not (= (select .cse9 .cse1) c_~j~0)) (let ((.cse10 (select .cse9 .cse2))) (and (or (< .cse7 c_~N~0) (< (+ .cse10 1) c_~N~0)) (or (< .cse10 c_~N~0) .cse8))))))))) is different from false [2022-12-06 00:29:10,592 INFO L130 PetriNetUnfolder]: 574/1143 cut-off events. [2022-12-06 00:29:10,592 INFO L131 PetriNetUnfolder]: For 13793/13793 co-relation queries the response was YES. [2022-12-06 00:29:10,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9025 conditions, 1143 events. 574/1143 cut-off events. For 13793/13793 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6053 event pairs, 38 based on Foata normal form. 6/1149 useless extension candidates. Maximal degree in co-relation 8369. Up to 492 conditions per place. [2022-12-06 00:29:10,599 INFO L137 encePairwiseOnDemand]: 5/35 looper letters, 79 selfloop transitions, 171 changer transitions 23/273 dead transitions. [2022-12-06 00:29:10,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 273 transitions, 4770 flow [2022-12-06 00:29:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 00:29:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 00:29:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 147 transitions. [2022-12-06 00:29:10,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1826086956521739 [2022-12-06 00:29:10,600 INFO L175 Difference]: Start difference. First operand has 106 places, 142 transitions, 2450 flow. Second operand 23 states and 147 transitions. [2022-12-06 00:29:10,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 273 transitions, 4770 flow [2022-12-06 00:29:10,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 273 transitions, 4507 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 00:29:10,642 INFO L231 Difference]: Finished difference. Result has 133 places, 211 transitions, 3997 flow [2022-12-06 00:29:10,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2286, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3997, PETRI_PLACES=133, PETRI_TRANSITIONS=211} [2022-12-06 00:29:10,643 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 111 predicate places. [2022-12-06 00:29:10,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:10,643 INFO L89 Accepts]: Start accepts. Operand has 133 places, 211 transitions, 3997 flow [2022-12-06 00:29:10,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:10,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:10,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 211 transitions, 3997 flow [2022-12-06 00:29:10,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 211 transitions, 3997 flow [2022-12-06 00:29:10,695 INFO L130 PetriNetUnfolder]: 178/548 cut-off events. [2022-12-06 00:29:10,696 INFO L131 PetriNetUnfolder]: For 5680/5683 co-relation queries the response was YES. [2022-12-06 00:29:10,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4029 conditions, 548 events. 178/548 cut-off events. For 5680/5683 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3299 event pairs, 28 based on Foata normal form. 1/527 useless extension candidates. Maximal degree in co-relation 3960. Up to 161 conditions per place. [2022-12-06 00:29:10,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 211 transitions, 3997 flow [2022-12-06 00:29:10,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-06 00:29:10,704 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-06 00:29:10,755 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-06 00:29:10,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L65-1-->L65-1: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_480) (< v_~q1_back~0_480 v_~n1~0_292)) 1 0) 0)) (= (+ v_~q1_back~0_480 1) v_~q1_back~0_479) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| (ite (and (< v_~q2_front~0_445 v_~q2_back~0_452) (<= 0 v_~q2_front~0_445) (< v_~q2_front~0_445 v_~n2~0_296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326| 0)) (= (+ v_~q2_front~0_445 1) v_~q2_front~0_444) (not (= (ite (= v_~j~0_437 (select (select |v_#memory_int_533| v_~q1~0.base_307) (+ v_~q1~0.offset_307 (* v_~q1_back~0_480 4)))) 1 0) 0)) (= v_~j~0_436 (+ (select (select |v_#memory_int_533| v_~q2~0.base_288) (+ v_~q2~0.offset_288 (* v_~q2_front~0_445 4))) 1)) (< v_~j~0_437 v_~N~0_296)) InVars {~j~0=v_~j~0_437, ~q1~0.offset=v_~q1~0.offset_307, ~n2~0=v_~n2~0_296, ~q1_back~0=v_~q1_back~0_480, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_292, ~q1~0.base=v_~q1~0.base_307, #memory_int=|v_#memory_int_533|, ~q2_front~0=v_~q2_front~0_445, ~q2~0.base=v_~q2~0.base_288, ~N~0=v_~N~0_296, ~q2_back~0=v_~q2_back~0_452} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_213|, ~j~0=v_~j~0_436, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_207|, ~q1~0.offset=v_~q1~0.offset_307, ~n2~0=v_~n2~0_296, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_292, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326|, ~q2_front~0=v_~q2_front~0_444, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_183|, ~N~0=v_~N~0_296, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_183|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_207|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326|, ~q1_back~0=v_~q1_back~0_479, ~q1~0.base=v_~q1~0.base_307, #memory_int=|v_#memory_int_533|, ~q2~0.base=v_~q2~0.base_288, ~q2_back~0=v_~q2_back~0_452} 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-06 00:29:10,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L65-1-->L65-1: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_480) (< v_~q1_back~0_480 v_~n1~0_292)) 1 0) 0)) (= (+ v_~q1_back~0_480 1) v_~q1_back~0_479) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| (ite (and (< v_~q2_front~0_445 v_~q2_back~0_452) (<= 0 v_~q2_front~0_445) (< v_~q2_front~0_445 v_~n2~0_296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326| 0)) (= (+ v_~q2_front~0_445 1) v_~q2_front~0_444) (not (= (ite (= v_~j~0_437 (select (select |v_#memory_int_533| v_~q1~0.base_307) (+ v_~q1~0.offset_307 (* v_~q1_back~0_480 4)))) 1 0) 0)) (= v_~j~0_436 (+ (select (select |v_#memory_int_533| v_~q2~0.base_288) (+ v_~q2~0.offset_288 (* v_~q2_front~0_445 4))) 1)) (< v_~j~0_437 v_~N~0_296)) InVars {~j~0=v_~j~0_437, ~q1~0.offset=v_~q1~0.offset_307, ~n2~0=v_~n2~0_296, ~q1_back~0=v_~q1_back~0_480, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_292, ~q1~0.base=v_~q1~0.base_307, #memory_int=|v_#memory_int_533|, ~q2_front~0=v_~q2_front~0_445, ~q2~0.base=v_~q2~0.base_288, ~N~0=v_~N~0_296, ~q2_back~0=v_~q2_back~0_452} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_213|, ~j~0=v_~j~0_436, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_207|, ~q1~0.offset=v_~q1~0.offset_307, ~n2~0=v_~n2~0_296, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_292, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326|, ~q2_front~0=v_~q2_front~0_444, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_183|, ~N~0=v_~N~0_296, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_183|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_207|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326|, ~q1_back~0=v_~q1_back~0_479, ~q1~0.base=v_~q1~0.base_307, #memory_int=|v_#memory_int_533|, ~q2~0.base=v_~q2~0.base_288, ~q2_back~0=v_~q2_back~0_452} 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-06 00:29:11,053 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:11,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 411 [2022-12-06 00:29:11,054 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 209 transitions, 3991 flow [2022-12-06 00:29:11,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:11,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:11,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:11,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:11,260 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-06 00:29:11,260 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:11,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash 461677364, now seen corresponding path program 1 times [2022-12-06 00:29:11,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:11,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063265531] [2022-12-06 00:29:11,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:11,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:12,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:12,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063265531] [2022-12-06 00:29:12,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063265531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:12,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546187663] [2022-12-06 00:29:12,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:12,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:12,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:12,075 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:12,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 00:29:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:12,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 00:29:12,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:12,199 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 202 treesize of output 198 [2022-12-06 00:29:12,204 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 14 treesize of output 14 [2022-12-06 00:29:12,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:29:12,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:29:12,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:29:12,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:12,406 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-06 00:29:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:12,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:12,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546187663] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:12,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:12,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-06 00:29:12,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280667945] [2022-12-06 00:29:12,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:12,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 00:29:12,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:12,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 00:29:12,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=506, Unknown=8, NotChecked=0, Total=600 [2022-12-06 00:29:12,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:29:12,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 209 transitions, 3991 flow. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:12,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:12,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:29:12,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:14,684 INFO L130 PetriNetUnfolder]: 542/1104 cut-off events. [2022-12-06 00:29:14,685 INFO L131 PetriNetUnfolder]: For 15603/15603 co-relation queries the response was YES. [2022-12-06 00:29:14,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9303 conditions, 1104 events. 542/1104 cut-off events. For 15603/15603 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5961 event pairs, 29 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 9220. Up to 440 conditions per place. [2022-12-06 00:29:14,691 INFO L137 encePairwiseOnDemand]: 7/39 looper letters, 77 selfloop transitions, 184 changer transitions 11/272 dead transitions. [2022-12-06 00:29:14,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 272 transitions, 5107 flow [2022-12-06 00:29:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 00:29:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 00:29:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 122 transitions. [2022-12-06 00:29:14,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14896214896214896 [2022-12-06 00:29:14,698 INFO L175 Difference]: Start difference. First operand has 130 places, 209 transitions, 3991 flow. Second operand 21 states and 122 transitions. [2022-12-06 00:29:14,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 272 transitions, 5107 flow [2022-12-06 00:29:14,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 272 transitions, 4959 flow, removed 43 selfloop flow, removed 5 redundant places. [2022-12-06 00:29:14,740 INFO L231 Difference]: Finished difference. Result has 152 places, 225 transitions, 4522 flow [2022-12-06 00:29:14,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3859, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4522, PETRI_PLACES=152, PETRI_TRANSITIONS=225} [2022-12-06 00:29:14,741 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 130 predicate places. [2022-12-06 00:29:14,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:14,741 INFO L89 Accepts]: Start accepts. Operand has 152 places, 225 transitions, 4522 flow [2022-12-06 00:29:14,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:14,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:14,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 225 transitions, 4522 flow [2022-12-06 00:29:14,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 225 transitions, 4522 flow [2022-12-06 00:29:14,811 INFO L130 PetriNetUnfolder]: 251/692 cut-off events. [2022-12-06 00:29:14,811 INFO L131 PetriNetUnfolder]: For 7671/7683 co-relation queries the response was YES. [2022-12-06 00:29:14,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5695 conditions, 692 events. 251/692 cut-off events. For 7671/7683 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4058 event pairs, 31 based on Foata normal form. 3/670 useless extension candidates. Maximal degree in co-relation 5630. Up to 229 conditions per place. [2022-12-06 00:29:14,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 225 transitions, 4522 flow [2022-12-06 00:29:14,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-06 00:29:17,171 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 [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 00:29:17,239 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:17,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2499 [2022-12-06 00:29:17,240 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 225 transitions, 4555 flow [2022-12-06 00:29:17,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:17,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:17,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:17,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:17,445 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-06 00:29:17,445 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1864132265, now seen corresponding path program 1 times [2022-12-06 00:29:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:17,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000273062] [2022-12-06 00:29:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:18,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000273062] [2022-12-06 00:29:18,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000273062] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:18,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754567467] [2022-12-06 00:29:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:18,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:18,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:18,818 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:18,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 00:29:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:18,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 00:29:18,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:18,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:18,962 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 14 treesize of output 12 [2022-12-06 00:29:18,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:18,974 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 19 treesize of output 19 [2022-12-06 00:29:18,976 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-06 00:29:19,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:29:19,068 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-06 00:29:19,154 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-06 00:29:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:19,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:19,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754567467] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:19,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:19,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-06 00:29:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258580467] [2022-12-06 00:29:19,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:19,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 00:29:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:19,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 00:29:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=385, Unknown=2, NotChecked=0, Total=462 [2022-12-06 00:29:19,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:29:19,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 225 transitions, 4555 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-06 00:29:19,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:19,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:29:19,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:22,426 INFO L130 PetriNetUnfolder]: 556/1145 cut-off events. [2022-12-06 00:29:22,427 INFO L131 PetriNetUnfolder]: For 16249/16249 co-relation queries the response was YES. [2022-12-06 00:29:22,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10121 conditions, 1145 events. 556/1145 cut-off events. For 16249/16249 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6252 event pairs, 46 based on Foata normal form. 1/1145 useless extension candidates. Maximal degree in co-relation 10042. Up to 512 conditions per place. [2022-12-06 00:29:22,434 INFO L137 encePairwiseOnDemand]: 8/41 looper letters, 97 selfloop transitions, 173 changer transitions 11/281 dead transitions. [2022-12-06 00:29:22,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 281 transitions, 5644 flow [2022-12-06 00:29:22,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 00:29:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 00:29:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 128 transitions. [2022-12-06 00:29:22,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1357370095440085 [2022-12-06 00:29:22,435 INFO L175 Difference]: Start difference. First operand has 150 places, 225 transitions, 4555 flow. Second operand 23 states and 128 transitions. [2022-12-06 00:29:22,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 281 transitions, 5644 flow [2022-12-06 00:29:22,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 281 transitions, 5338 flow, removed 39 selfloop flow, removed 6 redundant places. [2022-12-06 00:29:22,495 INFO L231 Difference]: Finished difference. Result has 174 places, 234 transitions, 4985 flow [2022-12-06 00:29:22,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4273, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4985, PETRI_PLACES=174, PETRI_TRANSITIONS=234} [2022-12-06 00:29:22,495 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 152 predicate places. [2022-12-06 00:29:22,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:22,495 INFO L89 Accepts]: Start accepts. Operand has 174 places, 234 transitions, 4985 flow [2022-12-06 00:29:22,496 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:22,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:22,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 234 transitions, 4985 flow [2022-12-06 00:29:22,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 234 transitions, 4985 flow [2022-12-06 00:29:22,572 INFO L130 PetriNetUnfolder]: 255/710 cut-off events. [2022-12-06 00:29:22,572 INFO L131 PetriNetUnfolder]: For 8498/8512 co-relation queries the response was YES. [2022-12-06 00:29:22,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6215 conditions, 710 events. 255/710 cut-off events. For 8498/8512 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4254 event pairs, 32 based on Foata normal form. 2/681 useless extension candidates. Maximal degree in co-relation 6142. Up to 232 conditions per place. [2022-12-06 00:29:22,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 234 transitions, 4985 flow [2022-12-06 00:29:22,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-06 00:29:26,639 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-06 00:29:26,712 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-06 00:29:26,788 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-06 00:29:26,862 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-06 00:29:26,936 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-06 00:29:27,106 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:29:27,106 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:29:27,106 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:29:27,106 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:29:27,106 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:29:27,106 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:29:27,106 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:29:27,106 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:29:27,531 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| 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_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, 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_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~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_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} 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-06 00:29:32,647 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 00:29:32,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10153 [2022-12-06 00:29:32,648 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 231 transitions, 5111 flow [2022-12-06 00:29:32,648 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-06 00:29:32,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:32,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:32,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:32,848 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-06 00:29:32,849 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:32,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:32,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1525481041, now seen corresponding path program 1 times [2022-12-06 00:29:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:32,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40073146] [2022-12-06 00:29:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:32,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:33,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:33,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40073146] [2022-12-06 00:29:33,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40073146] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:33,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399595444] [2022-12-06 00:29:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:33,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:33,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:33,931 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:33,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 00:29:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:34,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 00:29:34,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:34,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:34,105 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-12-06 00:29:34,106 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 42 treesize of output 100 [2022-12-06 00:29:34,112 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-06 00:29:34,119 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 12 treesize of output 11 [2022-12-06 00:29:34,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:34,142 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-12-06 00:29:34,143 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 63 treesize of output 32 [2022-12-06 00:29:34,153 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 9 treesize of output 7 [2022-12-06 00:29:34,157 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:34,158 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2022-12-06 00:29:34,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:34,274 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-06 00:29:34,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:34,339 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-06 00:29:34,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-06 00:29:34,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:34,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399595444] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:34,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:34,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 00:29:34,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151747062] [2022-12-06 00:29:34,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:34,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 00:29:34,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:34,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 00:29:34,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=215, Unknown=8, NotChecked=0, Total=272 [2022-12-06 00:29:34,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 00:29:34,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 231 transitions, 5111 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-06 00:29:34,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:34,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 00:29:34,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:35,934 INFO L130 PetriNetUnfolder]: 555/1152 cut-off events. [2022-12-06 00:29:35,934 INFO L131 PetriNetUnfolder]: For 18862/18862 co-relation queries the response was YES. [2022-12-06 00:29:35,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10834 conditions, 1152 events. 555/1152 cut-off events. For 18862/18862 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6370 event pairs, 72 based on Foata normal form. 2/1151 useless extension candidates. Maximal degree in co-relation 10749. Up to 633 conditions per place. [2022-12-06 00:29:35,941 INFO L137 encePairwiseOnDemand]: 12/54 looper letters, 113 selfloop transitions, 135 changer transitions 21/269 dead transitions. [2022-12-06 00:29:35,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 269 transitions, 5978 flow [2022-12-06 00:29:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 00:29:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 00:29:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2022-12-06 00:29:35,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1345679012345679 [2022-12-06 00:29:35,942 INFO L175 Difference]: Start difference. First operand has 169 places, 231 transitions, 5111 flow. Second operand 15 states and 109 transitions. [2022-12-06 00:29:35,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 269 transitions, 5978 flow [2022-12-06 00:29:35,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 269 transitions, 5765 flow, removed 62 selfloop flow, removed 5 redundant places. [2022-12-06 00:29:36,004 INFO L231 Difference]: Finished difference. Result has 184 places, 227 transitions, 5137 flow [2022-12-06 00:29:36,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4906, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5137, PETRI_PLACES=184, PETRI_TRANSITIONS=227} [2022-12-06 00:29:36,004 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 162 predicate places. [2022-12-06 00:29:36,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:36,004 INFO L89 Accepts]: Start accepts. Operand has 184 places, 227 transitions, 5137 flow [2022-12-06 00:29:36,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:36,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:36,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 227 transitions, 5137 flow [2022-12-06 00:29:36,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 227 transitions, 5137 flow [2022-12-06 00:29:36,080 INFO L130 PetriNetUnfolder]: 250/701 cut-off events. [2022-12-06 00:29:36,080 INFO L131 PetriNetUnfolder]: For 10177/10185 co-relation queries the response was YES. [2022-12-06 00:29:36,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 701 events. 250/701 cut-off events. For 10177/10185 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4268 event pairs, 30 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 6481. Up to 229 conditions per place. [2022-12-06 00:29:36,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 227 transitions, 5137 flow [2022-12-06 00:29:36,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 394 [2022-12-06 00:29:37,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| 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_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, 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_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~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_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} 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 [851] L70-->L47-1: Formula: (and (= v_~j~0_456 (+ (select (select |v_#memory_int_566| v_~q2~0.base_306) (+ (* v_~q2_front~0_466 4) v_~q2~0.offset_306)) 1)) (= (+ v_~q1_front~0_455 1) v_~q1_front~0_454) (= (ite (and (<= 0 v_~q1_front~0_455) (< v_~q1_front~0_455 v_~n1~0_308) (< v_~q1_front~0_455 v_~q1_back~0_502)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_337|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_337| 0)) (= v_~q2_front~0_465 (+ v_~q2_front~0_466 1)) (= (+ (select (select |v_#memory_int_566| v_~q1~0.base_325) (+ (* v_~q1_front~0_455 4) v_~q1~0.offset_325)) 1) v_~i~0_426) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (and (< v_~q2_front~0_466 v_~n2~0_312) (< v_~q2_front~0_466 v_~q2_back~0_481) (<= 0 v_~q2_front~0_466)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_346| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_337| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_337|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_346|)) InVars {~q1~0.offset=v_~q1~0.offset_325, ~q1_front~0=v_~q1_front~0_455, ~n2~0=v_~n2~0_312, ~q1_back~0=v_~q1_back~0_502, ~n1~0=v_~n1~0_308, ~q2~0.offset=v_~q2~0.offset_306, ~q1~0.base=v_~q1~0.base_325, #memory_int=|v_#memory_int_566|, ~q2_front~0=v_~q2_front~0_466, ~q2~0.base=v_~q2~0.base_306, ~q2_back~0=v_~q2_back~0_481} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_227|, ~j~0=v_~j~0_456, ~q1~0.offset=v_~q1~0.offset_325, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_221|, ~q1_front~0=v_~q1_front~0_454, ~n2~0=v_~n2~0_312, ~i~0=v_~i~0_426, ~n1~0=v_~n1~0_308, ~q2~0.offset=v_~q2~0.offset_306, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_213|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, ~q2_front~0=v_~q2_front~0_465, 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_346|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_337|, ~q1_back~0=v_~q1_back~0_502, ~q1~0.base=v_~q1~0.base_325, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_219|, #memory_int=|v_#memory_int_566|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_337|, ~q2~0.base=v_~q2~0.base_306, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_213|, ~q2_back~0=v_~q2_back~0_481} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:29:38,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [860] L70-->L47-1: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_362| (ite (and (< v_~q2_front~0_494 v_~n2~0_328) (< v_~q2_front~0_494 v_~q2_back~0_499) (<= 0 v_~q2_front~0_494)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_355| (ite (and (<= 0 v_~q1_front~0_487) (< v_~q1_front~0_487 v_~n1~0_326) (< v_~q1_front~0_487 v_~q1_back~0_526)) 1 0)) (= v_~j~0_480 (+ (select (select |v_#memory_int_606| v_~q2~0.base_326) (+ v_~q2~0.offset_326 (* v_~q2_front~0_494 4))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362| 0)) (= (+ v_~q2_front~0_494 1) v_~q2_front~0_493) (= (+ v_~q1_front~0_487 1) v_~q1_front~0_486) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_362| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|) (= v_~i~0_446 (+ (select (select |v_#memory_int_606| v_~q1~0.base_343) (+ v_~q1~0.offset_343 (* v_~q1_front~0_487 4))) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_355| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_355|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_355| 0))) InVars {~q1~0.offset=v_~q1~0.offset_343, ~q1_front~0=v_~q1_front~0_487, ~n2~0=v_~n2~0_328, ~q1_back~0=v_~q1_back~0_526, ~n1~0=v_~n1~0_326, ~q2~0.offset=v_~q2~0.offset_326, ~q1~0.base=v_~q1~0.base_343, #memory_int=|v_#memory_int_606|, ~q2_front~0=v_~q2_front~0_494, ~q2~0.base=v_~q2~0.base_326, ~q2_back~0=v_~q2_back~0_499} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_241|, ~j~0=v_~j~0_480, ~q1~0.offset=v_~q1~0.offset_343, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_235|, ~q1_front~0=v_~q1_front~0_486, ~n2~0=v_~n2~0_328, ~i~0=v_~i~0_446, ~n1~0=v_~n1~0_326, ~q2~0.offset=v_~q2~0.offset_326, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_229|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_362|, ~q2_front~0=v_~q2_front~0_493, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_235|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_355|, ~q1_back~0=v_~q1_back~0_526, ~q1~0.base=v_~q1~0.base_343, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_235|, #memory_int=|v_#memory_int_606|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_355|, ~q2~0.base=v_~q2~0.base_326, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_229|, ~q2_back~0=v_~q2_back~0_499} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 00:29:38,193 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [862] L70-->L47-1: Formula: (and (= v_~q1_front~0_494 (+ v_~q1_front~0_495 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_359|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_359| 0)) (= (+ v_~q2_front~0_502 1) v_~q2_front~0_501) (= (ite (and (<= 0 v_~q1_front~0_495) (< v_~q1_front~0_495 v_~q1_back~0_530) (< v_~q1_front~0_495 v_~n1~0_330)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366| (ite (and (< v_~q2_front~0_502 v_~n2~0_332) (< v_~q2_front~0_502 v_~q2_back~0_503) (<= 0 v_~q2_front~0_502)) 1 0)) (= v_~i~0_450 (+ (select (select |v_#memory_int_610| v_~q1~0.base_347) (+ (* v_~q1_front~0_495 4) v_~q1~0.offset_347)) 1)) (= v_~j~0_484 (+ (select (select |v_#memory_int_610| v_~q2~0.base_330) (+ (* v_~q2_front~0_502 4) v_~q2~0.offset_330)) 1))) InVars {~q1~0.offset=v_~q1~0.offset_347, ~q1_front~0=v_~q1_front~0_495, ~n2~0=v_~n2~0_332, ~q1_back~0=v_~q1_back~0_530, ~n1~0=v_~n1~0_330, ~q2~0.offset=v_~q2~0.offset_330, ~q1~0.base=v_~q1~0.base_347, #memory_int=|v_#memory_int_610|, ~q2_front~0=v_~q2_front~0_502, ~q2~0.base=v_~q2~0.base_330, ~q2_back~0=v_~q2_back~0_503} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_245|, ~j~0=v_~j~0_484, ~q1~0.offset=v_~q1~0.offset_347, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_239|, ~q1_front~0=v_~q1_front~0_494, ~n2~0=v_~n2~0_332, ~i~0=v_~i~0_450, ~n1~0=v_~n1~0_330, ~q2~0.offset=v_~q2~0.offset_330, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_233|, 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_501, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_239|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, ~q1_back~0=v_~q1_back~0_530, ~q1~0.base=v_~q1~0.base_347, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_239|, #memory_int=|v_#memory_int_610|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_359|, ~q2~0.base=v_~q2~0.base_330, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_233|, ~q2_back~0=v_~q2_back~0_503} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 00:29:38,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L70-->L47-1: Formula: (and (= v_~q1_front~0_498 (+ v_~q1_front~0_499 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368| 0)) (= (+ v_~q2_front~0_506 1) v_~q2_front~0_505) (= (+ (select (select |v_#memory_int_612| v_~q1~0.base_349) (+ v_~q1~0.offset_349 (* v_~q1_front~0_499 4))) 1) v_~i~0_452) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_361| (ite (and (< v_~q1_front~0_499 v_~q1_back~0_532) (<= 0 v_~q1_front~0_499) (< v_~q1_front~0_499 v_~n1~0_332)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368| (ite (and (< v_~q2_front~0_506 v_~n2~0_334) (< v_~q2_front~0_506 v_~q2_back~0_505) (<= 0 v_~q2_front~0_506)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_361| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_361|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_361| 0)) (= v_~j~0_486 (+ (select (select |v_#memory_int_612| v_~q2~0.base_332) (+ (* v_~q2_front~0_506 4) v_~q2~0.offset_332)) 1))) InVars {~q1~0.offset=v_~q1~0.offset_349, ~q1_front~0=v_~q1_front~0_499, ~n2~0=v_~n2~0_334, ~q1_back~0=v_~q1_back~0_532, ~n1~0=v_~n1~0_332, ~q2~0.offset=v_~q2~0.offset_332, ~q1~0.base=v_~q1~0.base_349, #memory_int=|v_#memory_int_612|, ~q2_front~0=v_~q2_front~0_506, ~q2~0.base=v_~q2~0.base_332, ~q2_back~0=v_~q2_back~0_505} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_247|, ~j~0=v_~j~0_486, ~q1~0.offset=v_~q1~0.offset_349, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_241|, ~q1_front~0=v_~q1_front~0_498, ~n2~0=v_~n2~0_334, ~i~0=v_~i~0_452, ~n1~0=v_~n1~0_332, ~q2~0.offset=v_~q2~0.offset_332, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_235|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368|, ~q2_front~0=v_~q2_front~0_505, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_241|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_361|, ~q1_back~0=v_~q1_back~0_532, ~q1~0.base=v_~q1~0.base_349, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_241|, #memory_int=|v_#memory_int_612|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_361|, ~q2~0.base=v_~q2~0.base_332, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_235|, ~q2_back~0=v_~q2_back~0_505} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 00:29:38,453 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [859] L70-->L47-1: Formula: (and (= (+ (select (select |v_#memory_int_604| v_~q1~0.base_341) (+ v_~q1~0.offset_341 (* v_~q1_front~0_483 4))) 1) v_~i~0_444) (= v_~q2_front~0_489 (+ v_~q2_front~0_490 1)) (= (ite (and (<= 0 v_~q1_front~0_483) (< v_~q1_front~0_483 v_~n1~0_324) (< v_~q1_front~0_483 v_~q1_back~0_524)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_353|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_353| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_353|) (= (+ v_~q1_front~0_483 1) v_~q1_front~0_482) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_360| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_353| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_360| (ite (and (< v_~q2_front~0_490 v_~n2~0_326) (<= 0 v_~q2_front~0_490) (< v_~q2_front~0_490 v_~q2_back~0_497)) 1 0)) (= v_~j~0_478 (+ (select (select |v_#memory_int_604| v_~q2~0.base_324) (+ v_~q2~0.offset_324 (* v_~q2_front~0_490 4))) 1))) InVars {~q1~0.offset=v_~q1~0.offset_341, ~q1_front~0=v_~q1_front~0_483, ~n2~0=v_~n2~0_326, ~q1_back~0=v_~q1_back~0_524, ~n1~0=v_~n1~0_324, ~q2~0.offset=v_~q2~0.offset_324, ~q1~0.base=v_~q1~0.base_341, #memory_int=|v_#memory_int_604|, ~q2_front~0=v_~q2_front~0_490, ~q2~0.base=v_~q2~0.base_324, ~q2_back~0=v_~q2_back~0_497} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_239|, ~j~0=v_~j~0_478, ~q1~0.offset=v_~q1~0.offset_341, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_233|, ~q1_front~0=v_~q1_front~0_482, ~n2~0=v_~n2~0_326, ~i~0=v_~i~0_444, ~n1~0=v_~n1~0_324, ~q2~0.offset=v_~q2~0.offset_324, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_227|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_360|, ~q2_front~0=v_~q2_front~0_489, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_233|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_353|, ~q1_back~0=v_~q1_back~0_524, ~q1~0.base=v_~q1~0.base_341, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_233|, #memory_int=|v_#memory_int_604|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_353|, ~q2~0.base=v_~q2~0.base_324, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_227|, ~q2_back~0=v_~q2_back~0_497} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 00:29:39,274 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [869] L65-1-->L65-1: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (and (< v_~q2_front~0_526 v_~q2_back~0_523) (< v_~q2_front~0_526 v_~n2~0_344) (<= 0 v_~q2_front~0_526)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386| 0)) (= (+ v_~q1_back~0_551 1) v_~q1_back~0_550) (not (= (ite (= v_~j~0_505 (select (select |v_#memory_int_622| v_~q1~0.base_359) (+ (* v_~q1_back~0_551 4) v_~q1~0.offset_359))) 1 0) 0)) (= v_~q2_front~0_525 (+ v_~q2_front~0_526 1)) (= v_~j~0_504 (+ (select (select |v_#memory_int_622| v_~q2~0.base_342) (+ v_~q2~0.offset_342 (* v_~q2_front~0_526 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (not (= (ite (and (< v_~q1_back~0_551 v_~n1~0_342) (<= 0 v_~q1_back~0_551)) 1 0) 0)) (< v_~j~0_505 v_~N~0_336)) InVars {~j~0=v_~j~0_505, ~q1~0.offset=v_~q1~0.offset_359, ~n2~0=v_~n2~0_344, ~q1_back~0=v_~q1_back~0_551, ~q2~0.offset=v_~q2~0.offset_342, ~n1~0=v_~n1~0_342, ~q1~0.base=v_~q1~0.base_359, #memory_int=|v_#memory_int_622|, ~q2_front~0=v_~q2_front~0_526, ~q2~0.base=v_~q2~0.base_342, ~N~0=v_~N~0_336, ~q2_back~0=v_~q2_back~0_523} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_257|, ~j~0=v_~j~0_504, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_251|, ~q1~0.offset=v_~q1~0.offset_359, ~n2~0=v_~n2~0_344, ~q2~0.offset=v_~q2~0.offset_342, ~n1~0=v_~n1~0_342, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, ~q2_front~0=v_~q2_front~0_525, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_209|, ~N~0=v_~N~0_336, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_209|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_251|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~q1_back~0=v_~q1_back~0_550, ~q1~0.base=v_~q1~0.base_359, #memory_int=|v_#memory_int_622|, ~q2~0.base=v_~q2~0.base_342, ~q2_back~0=v_~q2_back~0_523} 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-06 00:29:39,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [864] L65-1-->L65-1: Formula: (and (= (+ v_~q2_front~0_510 1) v_~q2_front~0_509) (= v_~j~0_488 (+ (select (select |v_#memory_int_614| v_~q2~0.base_334) (+ v_~q2~0.offset_334 (* v_~q2_front~0_510 4))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370| (ite (and (< v_~q2_front~0_510 v_~q2_back~0_507) (< v_~q2_front~0_510 v_~n2~0_336) (<= 0 v_~q2_front~0_510)) 1 0)) (< v_~j~0_489 v_~N~0_328) (not (= (ite (and (< v_~q1_back~0_535 v_~n1~0_334) (<= 0 v_~q1_back~0_535)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370|) (not (= (ite (= v_~j~0_489 (select (select |v_#memory_int_614| v_~q1~0.base_351) (+ v_~q1~0.offset_351 (* v_~q1_back~0_535 4)))) 1 0) 0)) (= v_~q1_back~0_534 (+ v_~q1_back~0_535 1))) InVars {~j~0=v_~j~0_489, ~q1~0.offset=v_~q1~0.offset_351, ~n2~0=v_~n2~0_336, ~q1_back~0=v_~q1_back~0_535, ~q2~0.offset=v_~q2~0.offset_334, ~n1~0=v_~n1~0_334, ~q1~0.base=v_~q1~0.base_351, #memory_int=|v_#memory_int_614|, ~q2_front~0=v_~q2_front~0_510, ~q2~0.base=v_~q2~0.base_334, ~N~0=v_~N~0_328, ~q2_back~0=v_~q2_back~0_507} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_249|, ~j~0=v_~j~0_488, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_243|, ~q1~0.offset=v_~q1~0.offset_351, ~n2~0=v_~n2~0_336, ~q2~0.offset=v_~q2~0.offset_334, ~n1~0=v_~n1~0_334, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370|, ~q2_front~0=v_~q2_front~0_509, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_201|, ~N~0=v_~N~0_328, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_201|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_243|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370|, ~q1_back~0=v_~q1_back~0_534, ~q1~0.base=v_~q1~0.base_351, #memory_int=|v_#memory_int_614|, ~q2~0.base=v_~q2~0.base_334, ~q2_back~0=v_~q2_back~0_507} 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-06 00:29:45,658 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 00:29:45,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9655 [2022-12-06 00:29:45,659 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 223 transitions, 5163 flow [2022-12-06 00:29:45,659 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-06 00:29:45,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:45,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:45,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:45,860 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-06 00:29:45,860 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:45,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1245467731, now seen corresponding path program 1 times [2022-12-06 00:29:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:45,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098123495] [2022-12-06 00:29:45,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:45,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:46,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:46,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098123495] [2022-12-06 00:29:46,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098123495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:46,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929265703] [2022-12-06 00:29:46,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:46,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:46,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:46,806 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:46,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 00:29:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:46,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 00:29:46,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:46,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:46,974 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-06 00:29:46,974 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-06 00:29:46,980 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-06 00:29:46,984 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-06 00:29:46,999 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:47,000 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 116 [2022-12-06 00:29:47,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:47,013 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 0 case distinctions, treesize of input 62 treesize of output 25 [2022-12-06 00:29:47,016 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-06 00:29:47,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:47,201 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-06 00:29:47,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 173 treesize of output 173 [2022-12-06 00:29:47,238 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 48 treesize of output 41 [2022-12-06 00:29:47,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:47,341 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 38 [2022-12-06 00:29:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:47,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:47,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929265703] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:47,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:47,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 00:29:47,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212827729] [2022-12-06 00:29:47,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:47,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:29:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:47,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:29:47,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=182, Unknown=2, NotChecked=0, Total=240 [2022-12-06 00:29:47,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 00:29:47,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 223 transitions, 5163 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-06 00:29:47,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:47,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 00:29:47,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:49,219 INFO L130 PetriNetUnfolder]: 552/1140 cut-off events. [2022-12-06 00:29:49,219 INFO L131 PetriNetUnfolder]: For 21545/21545 co-relation queries the response was YES. [2022-12-06 00:29:49,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11230 conditions, 1140 events. 552/1140 cut-off events. For 21545/21545 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6309 event pairs, 55 based on Foata normal form. 1/1138 useless extension candidates. Maximal degree in co-relation 11128. Up to 498 conditions per place. [2022-12-06 00:29:49,226 INFO L137 encePairwiseOnDemand]: 7/54 looper letters, 86 selfloop transitions, 154 changer transitions 27/267 dead transitions. [2022-12-06 00:29:49,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 267 transitions, 6072 flow [2022-12-06 00:29:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 00:29:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 00:29:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2022-12-06 00:29:49,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1506172839506173 [2022-12-06 00:29:49,227 INFO L175 Difference]: Start difference. First operand has 175 places, 223 transitions, 5163 flow. Second operand 15 states and 122 transitions. [2022-12-06 00:29:49,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 267 transitions, 6072 flow [2022-12-06 00:29:49,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 267 transitions, 5775 flow, removed 78 selfloop flow, removed 9 redundant places. [2022-12-06 00:29:49,303 INFO L231 Difference]: Finished difference. Result has 186 places, 217 transitions, 5102 flow [2022-12-06 00:29:49,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4888, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5102, PETRI_PLACES=186, PETRI_TRANSITIONS=217} [2022-12-06 00:29:49,303 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 164 predicate places. [2022-12-06 00:29:49,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:49,303 INFO L89 Accepts]: Start accepts. Operand has 186 places, 217 transitions, 5102 flow [2022-12-06 00:29:49,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:49,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:49,304 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 217 transitions, 5102 flow [2022-12-06 00:29:49,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 217 transitions, 5102 flow [2022-12-06 00:29:49,382 INFO L130 PetriNetUnfolder]: 255/697 cut-off events. [2022-12-06 00:29:49,382 INFO L131 PetriNetUnfolder]: For 11107/11111 co-relation queries the response was YES. [2022-12-06 00:29:49,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 697 events. 255/697 cut-off events. For 11107/11111 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4121 event pairs, 30 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 6802. Up to 232 conditions per place. [2022-12-06 00:29:49,389 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 217 transitions, 5102 flow [2022-12-06 00:29:49,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 00:29:49,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [842] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_535| v_~q1~0.base_309))) (and (< v_~j~0_440 v_~N~0_298) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| (ite (= v_~j~0_440 (select .cse0 (+ v_~q1~0.offset_309 (* v_~q1_back~0_484 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_306| 0)) (= (+ v_~q1_front~0_426 1) v_~q1_front~0_425) (= (ite (and (< v_~q1_front~0_426 v_~n1~0_294) (< v_~q1_front~0_426 v_~q1_back~0_483) (<= 0 v_~q1_front~0_426)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_306|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_330| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_306| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_306|) (not (= 0 (ite (and (<= 0 v_~q1_back~0_484) (< v_~q1_back~0_484 v_~n1~0_294)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_330|) (= (+ v_~q1_back~0_484 1) v_~q1_back~0_483) (= v_~i~0_399 (+ (select .cse0 (+ v_~q1~0.offset_309 (* v_~q1_front~0_426 4))) 1)))) InVars {~j~0=v_~j~0_440, ~q1~0.offset=v_~q1~0.offset_309, ~q1_front~0=v_~q1_front~0_426, ~q1_back~0=v_~q1_back~0_484, ~n1~0=v_~n1~0_294, ~q1~0.base=v_~q1~0.base_309, #memory_int=|v_#memory_int_535|, ~N~0=v_~N~0_298} OutVars{~j~0=v_~j~0_440, ~q1~0.offset=v_~q1~0.offset_309, ~q1_front~0=v_~q1_front~0_425, ~i~0=v_~i~0_399, ~n1~0=v_~n1~0_294, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_195|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_185|, ~N~0=v_~N~0_298, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_185|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_330|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_306|, ~q1_back~0=v_~q1_back~0_483, ~q1~0.base=v_~q1~0.base_309, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_201|, #memory_int=|v_#memory_int_535|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_306|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_195|} 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-06 00:29:49,536 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 [882] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_671| v_~q1~0.base_383))) (and (= v_~j~0_534 (+ (select (select |v_#memory_int_671| v_~q2~0.base_368) (+ (* v_~q2_front~0_565 4) v_~q2~0.offset_368)) 1)) (< v_~j~0_535 v_~N~0_358) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_408| (ite (and (< v_~q2_front~0_565 v_~q2_back~0_548) (< v_~q2_front~0_565 v_~n2~0_370) (<= 0 v_~q2_front~0_565)) 1 0)) (= (+ v_~q2_front~0_565 1) v_~q2_front~0_564) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_408| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_390| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_390|) (not (= (ite (= v_~j~0_535 (select .cse0 (+ v_~q1~0.offset_383 (* v_~q1_back~0_578 4)))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q1_back~0_578) (< v_~q1_back~0_578 v_~n1~0_362)) 1 0) 0)) (= (+ v_~q1_front~0_542 1) v_~q1_front~0_541) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_390| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408| 0)) (= (+ (select .cse0 (+ (* v_~q1_front~0_542 4) v_~q1~0.offset_383)) 1) v_~i~0_485) (= (ite (and (< v_~q1_front~0_542 v_~q1_back~0_577) (< v_~q1_front~0_542 v_~n1~0_362) (<= 0 v_~q1_front~0_542)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_390|) (= (+ v_~q1_back~0_578 1) v_~q1_back~0_577))) InVars {~j~0=v_~j~0_535, ~q1~0.offset=v_~q1~0.offset_383, ~q1_front~0=v_~q1_front~0_542, ~n2~0=v_~n2~0_370, ~n1~0=v_~n1~0_362, ~q2~0.offset=v_~q2~0.offset_368, ~q2_front~0=v_~q2_front~0_565, ~N~0=v_~N~0_358, ~q1_back~0=v_~q1_back~0_578, ~q1~0.base=v_~q1~0.base_383, #memory_int=|v_#memory_int_671|, ~q2~0.base=v_~q2~0.base_368, ~q2_back~0=v_~q2_back~0_548} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_275|, ~j~0=v_~j~0_534, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_269|, ~q1_front~0=v_~q1_front~0_541, ~n1~0=v_~n1~0_362, ~q2~0.offset=v_~q2~0.offset_368, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_408|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_269|, ~q1_back~0=v_~q1_back~0_577, ~q1~0.base=v_~q1~0.base_383, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_261|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_390|, ~q2~0.base=v_~q2~0.base_368, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_255|, ~q2_back~0=v_~q2_back~0_548, ~q1~0.offset=v_~q1~0.offset_383, ~n2~0=v_~n2~0_370, ~i~0=v_~i~0_485, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_255|, ~q2_front~0=v_~q2_front~0_564, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_217|, ~N~0=v_~N~0_358, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_217|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_390|, #memory_int=|v_#memory_int_671|} AuxVars[] AssignedVars[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] [2022-12-06 00:29:49,889 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 [723] L52-->L65-1: Formula: (and (= (ite (and (<= 0 v_~q1_front~0_167) (< v_~q1_front~0_167 v_~n1~0_114) (< v_~q1_front~0_167 v_~q1_back~0_155)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| 0)) (= v_~q1_front~0_166 (+ v_~q1_front~0_167 1)) (= v_~q2_front~0_139 (+ v_~q2_front~0_140 1)) (= (+ (select (select |v_#memory_int_271| v_~q1~0.base_125) (+ (* v_~q1_front~0_167 4) v_~q1~0.offset_125)) 1) v_~i~0_165) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (= v_~j~0_143 (+ (select (select |v_#memory_int_271| v_~q2~0.base_109) (+ v_~q2~0.offset_109 (* v_~q2_front~0_140 4))) 1)) (= (ite (and (< v_~q2_front~0_140 v_~n2~0_122) (< v_~q2_front~0_140 v_~q2_back~0_176) (<= 0 v_~q2_front~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|)) InVars {~q1~0.offset=v_~q1~0.offset_125, ~n2~0=v_~n2~0_122, ~q1_front~0=v_~q1_front~0_167, ~q1_back~0=v_~q1_back~0_155, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_114, ~q1~0.base=v_~q1~0.base_125, #memory_int=|v_#memory_int_271|, ~q2_front~0=v_~q2_front~0_140, ~q2~0.base=v_~q2~0.base_109, ~q2_back~0=v_~q2_back~0_176} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_46|, ~j~0=v_~j~0_143, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_40|, ~q1~0.offset=v_~q1~0.offset_125, ~n2~0=v_~n2~0_122, ~q1_front~0=v_~q1_front~0_166, ~i~0=v_~i~0_165, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_114, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|, ~q2_front~0=v_~q2_front~0_139, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_40|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|, ~q1_back~0=v_~q1_back~0_155, ~q1~0.base=v_~q1~0.base_125, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_63|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91|, ~q2~0.base=v_~q2~0.base_109, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_57|, ~q2_back~0=v_~q2_back~0_176} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:29:50,079 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 [720] L52-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_267| v_~q2~0.base_105))) (and (= (+ v_~q1_front~0_157 1) v_~q1_front~0_156) (not (= (ite (and (<= 0 v_~q2_back~0_169) (< v_~q2_back~0_169 v_~n2~0_118)) 1 0) 0)) (= v_~i~0_159 (+ (select (select |v_#memory_int_267| v_~q1~0.base_121) (+ (* v_~q1_front~0_157 4) v_~q1~0.offset_121)) 1)) (< v_~i~0_159 v_~N~0_106) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (not (= (ite (and (<= 0 v_~q1_front~0_157) (< v_~q1_front~0_157 v_~n1~0_110) (< v_~q1_front~0_157 v_~q1_back~0_151)) 1 0) 0)) (= (ite (and (<= 0 v_~q2_front~0_136) (< v_~q2_front~0_136 v_~q2_back~0_168) (< v_~q2_front~0_136 v_~n2~0_118)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|) (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_169) v_~q2~0.offset_105)) v_~i~0_159) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| 0)) (= (+ v_~q2_front~0_136 1) v_~q2_front~0_135) (= (+ v_~q2_back~0_169 1) v_~q2_back~0_168) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|) (= v_~j~0_141 (+ (select .cse0 (+ (* v_~q2_front~0_136 4) v_~q2~0.offset_105)) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_121, ~n2~0=v_~n2~0_118, ~q1_front~0=v_~q1_front~0_157, ~q1_back~0=v_~q1_back~0_151, ~q2~0.offset=v_~q2~0.offset_105, ~n1~0=v_~n1~0_110, ~q1~0.base=v_~q1~0.base_121, #memory_int=|v_#memory_int_267|, ~q2_front~0=v_~q2_front~0_136, ~q2~0.base=v_~q2~0.base_105, ~N~0=v_~N~0_106, ~q2_back~0=v_~q2_back~0_169} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_41|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_44|, ~j~0=v_~j~0_141, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_38|, ~q1_front~0=v_~q1_front~0_156, ~q2~0.offset=v_~q2~0.offset_105, ~n1~0=v_~n1~0_110, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_38|, ~q1_back~0=v_~q1_back~0_151, ~q1~0.base=v_~q1~0.base_121, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_57|, ~q2~0.base=v_~q2~0.base_105, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_51|, ~q2_back~0=v_~q2_back~0_168, ~q1~0.offset=v_~q1~0.offset_121, ~n2~0=v_~n2~0_118, ~i~0=v_~i~0_159, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_51|, ~q2_front~0=v_~q2_front~0_135, ~N~0=v_~N~0_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, #memory_int=|v_#memory_int_267|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_41|} 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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#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-06 00:29:50,262 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:29:50,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 959 [2022-12-06 00:29:50,263 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 214 transitions, 5071 flow [2022-12-06 00:29:50,263 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-06 00:29:50,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:50,263 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:50,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-06 00:29:50,468 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,SelfDestructingSolverStorable32 [2022-12-06 00:29:50,468 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:50,469 INFO L85 PathProgramCache]: Analyzing trace with hash 119466376, now seen corresponding path program 1 times [2022-12-06 00:29:50,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:50,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086160840] [2022-12-06 00:29:50,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:50,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:51,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:51,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086160840] [2022-12-06 00:29:51,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086160840] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:51,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723916893] [2022-12-06 00:29:51,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:51,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:51,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:51,237 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:51,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 00:29:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:51,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 00:29:51,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:51,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:51,446 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-12-06 00:29:51,446 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 42 treesize of output 100 [2022-12-06 00:29:51,454 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-06 00:29:51,461 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 12 treesize of output 11 [2022-12-06 00:29:51,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:51,477 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 0 case distinctions, treesize of input 52 treesize of output 15 [2022-12-06 00:29:51,481 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 9 treesize of output 7 [2022-12-06 00:29:51,483 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:51,484 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 110 [2022-12-06 00:29:51,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:51,717 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-12-06 00:29:51,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 106 treesize of output 118 [2022-12-06 00:29:51,733 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 9 treesize of output 7 [2022-12-06 00:29:51,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:51,851 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-06 00:29:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:51,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:52,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723916893] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:52,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:52,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 18 [2022-12-06 00:29:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406642316] [2022-12-06 00:29:52,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:52,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:29:52,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:52,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:29:52,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=306, Unknown=5, NotChecked=0, Total=380 [2022-12-06 00:29:52,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 00:29:52,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 214 transitions, 5071 flow. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:52,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:52,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 00:29:52,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:30:05,183 WARN L233 SmtUtils]: Spent 12.36s on a formula simplification. DAG size of input: 134 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:30:06,536 INFO L130 PetriNetUnfolder]: 536/1091 cut-off events. [2022-12-06 00:30:06,536 INFO L131 PetriNetUnfolder]: For 23580/23580 co-relation queries the response was YES. [2022-12-06 00:30:06,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11253 conditions, 1091 events. 536/1091 cut-off events. For 23580/23580 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5941 event pairs, 44 based on Foata normal form. 1/1090 useless extension candidates. Maximal degree in co-relation 11164. Up to 448 conditions per place. [2022-12-06 00:30:06,545 INFO L137 encePairwiseOnDemand]: 6/50 looper letters, 86 selfloop transitions, 154 changer transitions 25/265 dead transitions. [2022-12-06 00:30:06,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 265 transitions, 6045 flow [2022-12-06 00:30:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 00:30:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 00:30:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 126 transitions. [2022-12-06 00:30:06,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13263157894736843 [2022-12-06 00:30:06,546 INFO L175 Difference]: Start difference. First operand has 170 places, 214 transitions, 5071 flow. Second operand 19 states and 126 transitions. [2022-12-06 00:30:06,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 265 transitions, 6045 flow [2022-12-06 00:30:06,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 265 transitions, 5794 flow, removed 50 selfloop flow, removed 11 redundant places. [2022-12-06 00:30:06,612 INFO L231 Difference]: Finished difference. Result has 182 places, 213 transitions, 5304 flow [2022-12-06 00:30:06,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4847, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5304, PETRI_PLACES=182, PETRI_TRANSITIONS=213} [2022-12-06 00:30:06,613 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 160 predicate places. [2022-12-06 00:30:06,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:30:06,613 INFO L89 Accepts]: Start accepts. Operand has 182 places, 213 transitions, 5304 flow [2022-12-06 00:30:06,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:30:06,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:30:06,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 213 transitions, 5304 flow [2022-12-06 00:30:06,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 213 transitions, 5304 flow [2022-12-06 00:30:06,715 INFO L130 PetriNetUnfolder]: 252/664 cut-off events. [2022-12-06 00:30:06,715 INFO L131 PetriNetUnfolder]: For 12303/12311 co-relation queries the response was YES. [2022-12-06 00:30:06,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6960 conditions, 664 events. 252/664 cut-off events. For 12303/12311 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3831 event pairs, 26 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 6884. Up to 228 conditions per place. [2022-12-06 00:30:06,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 213 transitions, 5304 flow [2022-12-06 00:30:06,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 00:30:06,725 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-06 00:30:06,779 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:30:06,780 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 00:30:06,780 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 212 transitions, 5294 flow [2022-12-06 00:30:06,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:30:06,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:30:06,780 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:30:06,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-06 00:30:06,987 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,SelfDestructingSolverStorable33 [2022-12-06 00:30:06,987 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:30:06,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:30:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1016765326, now seen corresponding path program 1 times [2022-12-06 00:30:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:30:06,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504945096] [2022-12-06 00:30:06,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:30:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:30:07,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504945096] [2022-12-06 00:30:07,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504945096] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:30:07,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199291598] [2022-12-06 00:30:07,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:07,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:07,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:30:07,406 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:30:07,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 00:30:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:07,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 00:30:07,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:30:07,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:30:07,611 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-06 00:30:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:07,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:30:07,949 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-06 00:30:07,949 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-06 00:30:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:10,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199291598] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:30:10,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:30:10,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 00:30:10,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902487361] [2022-12-06 00:30:10,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:30:10,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:30:10,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:30:10,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:30:10,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:30:10,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 00:30:10,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 212 transitions, 5294 flow. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:30:10,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:30:10,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 00:30:10,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:30:11,938 INFO L130 PetriNetUnfolder]: 555/1116 cut-off events. [2022-12-06 00:30:11,939 INFO L131 PetriNetUnfolder]: For 26528/26528 co-relation queries the response was YES. [2022-12-06 00:30:11,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12075 conditions, 1116 events. 555/1116 cut-off events. For 26528/26528 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6099 event pairs, 30 based on Foata normal form. 1/1115 useless extension candidates. Maximal degree in co-relation 11991. Up to 496 conditions per place. [2022-12-06 00:30:11,948 INFO L137 encePairwiseOnDemand]: 8/48 looper letters, 69 selfloop transitions, 193 changer transitions 16/278 dead transitions. [2022-12-06 00:30:11,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 278 transitions, 6875 flow [2022-12-06 00:30:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 00:30:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 00:30:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 128 transitions. [2022-12-06 00:30:11,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13333333333333333 [2022-12-06 00:30:11,949 INFO L175 Difference]: Start difference. First operand has 172 places, 212 transitions, 5294 flow. Second operand 20 states and 128 transitions. [2022-12-06 00:30:11,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 278 transitions, 6875 flow [2022-12-06 00:30:12,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 278 transitions, 6567 flow, removed 25 selfloop flow, removed 13 redundant places. [2022-12-06 00:30:12,027 INFO L231 Difference]: Finished difference. Result has 183 places, 234 transitions, 6115 flow [2022-12-06 00:30:12,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5027, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6115, PETRI_PLACES=183, PETRI_TRANSITIONS=234} [2022-12-06 00:30:12,027 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 161 predicate places. [2022-12-06 00:30:12,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:30:12,028 INFO L89 Accepts]: Start accepts. Operand has 183 places, 234 transitions, 6115 flow [2022-12-06 00:30:12,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:30:12,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:30:12,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 234 transitions, 6115 flow [2022-12-06 00:30:12,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 234 transitions, 6115 flow [2022-12-06 00:30:12,107 INFO L130 PetriNetUnfolder]: 254/671 cut-off events. [2022-12-06 00:30:12,107 INFO L131 PetriNetUnfolder]: For 12736/12744 co-relation queries the response was YES. [2022-12-06 00:30:12,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7443 conditions, 671 events. 254/671 cut-off events. For 12736/12744 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3936 event pairs, 24 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 7368. Up to 234 conditions per place. [2022-12-06 00:30:12,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 234 transitions, 6115 flow [2022-12-06 00:30:12,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-06 00:30:12,116 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-06 00:30:12,188 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-06 00:30:12,235 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-06 00:30:12,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [867] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_618| v_~q2~0.base_338)) (.cse1 (select |v_#memory_int_618| v_~q1~0.base_355))) (and (= (+ v_~q2_back~0_516 1) v_~q2_back~0_515) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_367| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_378| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_367| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_367|) (not (= (ite (= (select .cse0 (+ v_~q2~0.offset_338 (* 4 v_~q2_back~0_516))) v_~i~0_459) 1 0) 0)) (= v_~q2_front~0_517 (+ v_~q2_front~0_518 1)) (= (+ (select .cse1 (+ (* v_~q1_front~0_507 4) v_~q1~0.offset_355)) 1) v_~i~0_458) (= v_~j~0_496 (+ (select .cse0 (+ (* v_~q2_front~0_518 4) v_~q2~0.offset_338)) 1)) (not (= (ite (and (< v_~q2_back~0_516 v_~n2~0_340) (<= 0 v_~q2_back~0_516)) 1 0) 0)) (= (ite (and (< v_~q1_front~0_507 v_~n1~0_338) (< v_~q1_front~0_507 v_~q1_back~0_542) (<= 0 v_~q1_front~0_507)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_367|) (= (+ v_~q1_front~0_507 1) v_~q1_front~0_506) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_378| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_378|) (not (= (ite (and (<= 0 v_~q1_back~0_543) (< v_~q1_back~0_543 v_~n1~0_338)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_378| (ite (and (<= 0 v_~q2_front~0_518) (< v_~q2_front~0_518 v_~q2_back~0_515) (< v_~q2_front~0_518 v_~n2~0_340)) 1 0)) (not (= (ite (= v_~j~0_497 (select .cse1 (+ (* v_~q1_back~0_543 4) v_~q1~0.offset_355))) 1 0) 0)) (= v_~q1_back~0_542 (+ v_~q1_back~0_543 1)) (< v_~j~0_497 v_~N~0_332) (< v_~i~0_459 v_~N~0_332))) InVars {~j~0=v_~j~0_497, ~q1~0.offset=v_~q1~0.offset_355, ~n2~0=v_~n2~0_340, ~q1_front~0=v_~q1_front~0_507, ~i~0=v_~i~0_459, ~q2~0.offset=v_~q2~0.offset_338, ~n1~0=v_~n1~0_338, ~q2_front~0=v_~q2_front~0_518, ~N~0=v_~N~0_332, ~q1_back~0=v_~q1_back~0_543, ~q1~0.base=v_~q1~0.base_355, #memory_int=|v_#memory_int_618|, ~q2~0.base=v_~q2~0.base_338, ~q2_back~0=v_~q2_back~0_516} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_177|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_253|, ~j~0=v_~j~0_496, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_247|, ~q1_front~0=v_~q1_front~0_506, ~q2~0.offset=v_~q2~0.offset_338, ~n1~0=v_~n1~0_338, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_378|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_247|, ~q1_back~0=v_~q1_back~0_542, ~q1~0.base=v_~q1~0.base_355, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_245|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_367|, ~q2~0.base=v_~q2~0.base_338, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_239|, ~q2_back~0=v_~q2_back~0_515, ~q1~0.offset=v_~q1~0.offset_355, ~n2~0=v_~n2~0_340, ~i~0=v_~i~0_458, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_239|, ~q2_front~0=v_~q2_front~0_517, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_205|, ~N~0=v_~N~0_332, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_205|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_378|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_367|, #memory_int=|v_#memory_int_618|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_177|} 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 [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-06 00:30:12,300 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,301 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,301 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,301 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,301 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,301 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,301 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,301 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,301 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,301 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,301 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,301 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,660 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,660 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,661 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,661 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,661 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,661 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,661 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,661 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,661 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,661 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,661 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:12,661 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:30:13,051 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-06 00:30:13,107 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:30:13,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1080 [2022-12-06 00:30:13,108 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 231 transitions, 6107 flow [2022-12-06 00:30:13,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:30:13,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:30:13,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:30:13,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 00:30:13,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:13,313 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:30:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:30:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash -730854211, now seen corresponding path program 1 times [2022-12-06 00:30:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:30:13,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89852167] [2022-12-06 00:30:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:30:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:14,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:14,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:30:14,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89852167] [2022-12-06 00:30:14,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89852167] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:30:14,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485986692] [2022-12-06 00:30:14,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:14,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:14,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:30:14,398 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:30:14,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 00:30:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:14,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 00:30:14,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:30:14,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:30:14,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:30:14,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:30:14,572 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:30:14,573 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-06 00:30:14,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:30:14,577 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 14 treesize of output 12 [2022-12-06 00:30:14,584 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-06 00:30:14,625 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-06 00:30:14,679 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 56 treesize of output 20 [2022-12-06 00:30:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:14,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:30:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:14,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485986692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:30:14,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:30:14,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 00:30:14,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667398465] [2022-12-06 00:30:14,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:30:14,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:30:14,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:30:14,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:30:14,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:30:14,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 00:30:14,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 231 transitions, 6107 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-06 00:30:14,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:30:14,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 00:30:14,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:30:16,084 INFO L130 PetriNetUnfolder]: 565/1104 cut-off events. [2022-12-06 00:30:16,084 INFO L131 PetriNetUnfolder]: For 27433/27433 co-relation queries the response was YES. [2022-12-06 00:30:16,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12721 conditions, 1104 events. 565/1104 cut-off events. For 27433/27433 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5868 event pairs, 66 based on Foata normal form. 1/1103 useless extension candidates. Maximal degree in co-relation 12639. Up to 571 conditions per place. [2022-12-06 00:30:16,093 INFO L137 encePairwiseOnDemand]: 9/52 looper letters, 57 selfloop transitions, 195 changer transitions 16/268 dead transitions. [2022-12-06 00:30:16,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 268 transitions, 7256 flow [2022-12-06 00:30:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:30:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:30:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 98 transitions. [2022-12-06 00:30:16,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15705128205128205 [2022-12-06 00:30:16,094 INFO L175 Difference]: Start difference. First operand has 176 places, 231 transitions, 6107 flow. Second operand 12 states and 98 transitions. [2022-12-06 00:30:16,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 268 transitions, 7256 flow [2022-12-06 00:30:16,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 268 transitions, 6675 flow, removed 35 selfloop flow, removed 14 redundant places. [2022-12-06 00:30:16,181 INFO L231 Difference]: Finished difference. Result has 177 places, 240 transitions, 6467 flow [2022-12-06 00:30:16,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=5576, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6467, PETRI_PLACES=177, PETRI_TRANSITIONS=240} [2022-12-06 00:30:16,182 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 155 predicate places. [2022-12-06 00:30:16,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:30:16,182 INFO L89 Accepts]: Start accepts. Operand has 177 places, 240 transitions, 6467 flow [2022-12-06 00:30:16,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:30:16,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:30:16,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 240 transitions, 6467 flow [2022-12-06 00:30:16,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 240 transitions, 6467 flow [2022-12-06 00:30:16,286 INFO L130 PetriNetUnfolder]: 272/684 cut-off events. [2022-12-06 00:30:16,286 INFO L131 PetriNetUnfolder]: For 12875/12882 co-relation queries the response was YES. [2022-12-06 00:30:16,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7729 conditions, 684 events. 272/684 cut-off events. For 12875/12882 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3815 event pairs, 26 based on Foata normal form. 1/662 useless extension candidates. Maximal degree in co-relation 7659. Up to 251 conditions per place. [2022-12-06 00:30:16,293 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 240 transitions, 6467 flow [2022-12-06 00:30:16,293 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 00:30:16,294 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:30:16,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 00:30:16,296 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 240 transitions, 6467 flow [2022-12-06 00:30:16,296 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-06 00:30:16,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:30:16,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:30:16,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 00:30:16,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:16,502 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:30:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:30:16,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1499952565, now seen corresponding path program 1 times [2022-12-06 00:30:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:30:16,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005717129] [2022-12-06 00:30:16,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:16,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:30:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:30:17,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005717129] [2022-12-06 00:30:17,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005717129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:30:17,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066077339] [2022-12-06 00:30:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:17,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:17,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:30:17,036 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:30:17,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 00:30:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:17,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 00:30:17,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:30:17,204 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-06 00:30:17,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:30:17,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:30:17,211 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-06 00:30:17,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:30:17,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-06 00:30:17,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:30:17,262 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-06 00:30:17,346 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-06 00:30:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:17,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:30:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:17,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066077339] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:30:17,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:30:17,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 00:30:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367793149] [2022-12-06 00:30:17,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:30:17,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 00:30:17,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:30:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 00:30:17,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-12-06 00:30:17,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 00:30:17,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 240 transitions, 6467 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-06 00:30:17,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:30:17,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 00:30:17,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:30:19,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:30:21,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:30:30,576 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 109 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:30:32,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:30:32,817 INFO L130 PetriNetUnfolder]: 604/1193 cut-off events. [2022-12-06 00:30:32,817 INFO L131 PetriNetUnfolder]: For 27503/27503 co-relation queries the response was YES. [2022-12-06 00:30:32,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13511 conditions, 1193 events. 604/1193 cut-off events. For 27503/27503 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6597 event pairs, 70 based on Foata normal form. 2/1193 useless extension candidates. Maximal degree in co-relation 13429. Up to 641 conditions per place. [2022-12-06 00:30:32,826 INFO L137 encePairwiseOnDemand]: 10/48 looper letters, 118 selfloop transitions, 161 changer transitions 25/304 dead transitions. [2022-12-06 00:30:32,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 304 transitions, 7985 flow [2022-12-06 00:30:32,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 00:30:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 00:30:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 132 transitions. [2022-12-06 00:30:32,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1375 [2022-12-06 00:30:32,828 INFO L175 Difference]: Start difference. First operand has 166 places, 240 transitions, 6467 flow. Second operand 20 states and 132 transitions. [2022-12-06 00:30:32,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 304 transitions, 7985 flow [2022-12-06 00:30:32,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 304 transitions, 7827 flow, removed 34 selfloop flow, removed 11 redundant places. [2022-12-06 00:30:32,918 INFO L231 Difference]: Finished difference. Result has 181 places, 250 transitions, 7273 flow [2022-12-06 00:30:32,918 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6343, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=7273, PETRI_PLACES=181, PETRI_TRANSITIONS=250} [2022-12-06 00:30:32,919 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 159 predicate places. [2022-12-06 00:30:32,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:30:32,919 INFO L89 Accepts]: Start accepts. Operand has 181 places, 250 transitions, 7273 flow [2022-12-06 00:30:32,920 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:30:32,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:30:32,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 250 transitions, 7273 flow [2022-12-06 00:30:32,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 250 transitions, 7273 flow [2022-12-06 00:30:33,009 INFO L130 PetriNetUnfolder]: 277/709 cut-off events. [2022-12-06 00:30:33,010 INFO L131 PetriNetUnfolder]: For 15248/15257 co-relation queries the response was YES. [2022-12-06 00:30:33,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8373 conditions, 709 events. 277/709 cut-off events. For 15248/15257 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4083 event pairs, 30 based on Foata normal form. 2/684 useless extension candidates. Maximal degree in co-relation 8292. Up to 256 conditions per place. [2022-12-06 00:30:33,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 250 transitions, 7273 flow [2022-12-06 00:30:33,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-06 00:30:33,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} 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-06 00:30:33,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [842] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_535| v_~q1~0.base_309))) (and (< v_~j~0_440 v_~N~0_298) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| (ite (= v_~j~0_440 (select .cse0 (+ v_~q1~0.offset_309 (* v_~q1_back~0_484 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_306| 0)) (= (+ v_~q1_front~0_426 1) v_~q1_front~0_425) (= (ite (and (< v_~q1_front~0_426 v_~n1~0_294) (< v_~q1_front~0_426 v_~q1_back~0_483) (<= 0 v_~q1_front~0_426)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_306|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_330| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_306| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_306|) (not (= 0 (ite (and (<= 0 v_~q1_back~0_484) (< v_~q1_back~0_484 v_~n1~0_294)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_330|) (= (+ v_~q1_back~0_484 1) v_~q1_back~0_483) (= v_~i~0_399 (+ (select .cse0 (+ v_~q1~0.offset_309 (* v_~q1_front~0_426 4))) 1)))) InVars {~j~0=v_~j~0_440, ~q1~0.offset=v_~q1~0.offset_309, ~q1_front~0=v_~q1_front~0_426, ~q1_back~0=v_~q1_back~0_484, ~n1~0=v_~n1~0_294, ~q1~0.base=v_~q1~0.base_309, #memory_int=|v_#memory_int_535|, ~N~0=v_~N~0_298} OutVars{~j~0=v_~j~0_440, ~q1~0.offset=v_~q1~0.offset_309, ~q1_front~0=v_~q1_front~0_425, ~i~0=v_~i~0_399, ~n1~0=v_~n1~0_294, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_195|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_185|, ~N~0=v_~N~0_298, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_185|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_330|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_306|, ~q1_back~0=v_~q1_back~0_483, ~q1~0.base=v_~q1~0.base_309, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_201|, #memory_int=|v_#memory_int_535|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_306|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_195|} 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-06 00:30:33,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L65-1-->L65-1: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_480) (< v_~q1_back~0_480 v_~n1~0_292)) 1 0) 0)) (= (+ v_~q1_back~0_480 1) v_~q1_back~0_479) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| (ite (and (< v_~q2_front~0_445 v_~q2_back~0_452) (<= 0 v_~q2_front~0_445) (< v_~q2_front~0_445 v_~n2~0_296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326| 0)) (= (+ v_~q2_front~0_445 1) v_~q2_front~0_444) (not (= (ite (= v_~j~0_437 (select (select |v_#memory_int_533| v_~q1~0.base_307) (+ v_~q1~0.offset_307 (* v_~q1_back~0_480 4)))) 1 0) 0)) (= v_~j~0_436 (+ (select (select |v_#memory_int_533| v_~q2~0.base_288) (+ v_~q2~0.offset_288 (* v_~q2_front~0_445 4))) 1)) (< v_~j~0_437 v_~N~0_296)) InVars {~j~0=v_~j~0_437, ~q1~0.offset=v_~q1~0.offset_307, ~n2~0=v_~n2~0_296, ~q1_back~0=v_~q1_back~0_480, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_292, ~q1~0.base=v_~q1~0.base_307, #memory_int=|v_#memory_int_533|, ~q2_front~0=v_~q2_front~0_445, ~q2~0.base=v_~q2~0.base_288, ~N~0=v_~N~0_296, ~q2_back~0=v_~q2_back~0_452} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_213|, ~j~0=v_~j~0_436, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_207|, ~q1~0.offset=v_~q1~0.offset_307, ~n2~0=v_~n2~0_296, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_292, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326|, ~q2_front~0=v_~q2_front~0_444, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_183|, ~N~0=v_~N~0_296, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_183|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_207|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326|, ~q1_back~0=v_~q1_back~0_479, ~q1~0.base=v_~q1~0.base_307, #memory_int=|v_#memory_int_533|, ~q2~0.base=v_~q2~0.base_288, ~q2_back~0=v_~q2_back~0_452} 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-06 00:30:33,489 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:30:33,490 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 571 [2022-12-06 00:30:33,490 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 248 transitions, 7259 flow [2022-12-06 00:30:33,490 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-06 00:30:33,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:30:33,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:30:33,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 00:30:33,695 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,SelfDestructingSolverStorable36 [2022-12-06 00:30:33,695 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:30:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:30:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -112812967, now seen corresponding path program 1 times [2022-12-06 00:30:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:30:33,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493284485] [2022-12-06 00:30:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:30:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:34,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:30:34,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493284485] [2022-12-06 00:30:34,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493284485] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:30:34,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226150809] [2022-12-06 00:30:34,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:34,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:34,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:30:34,231 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:30:34,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 00:30:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:34,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 00:30:34,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:30:34,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:30:34,422 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-06 00:30:34,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:30:34,459 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-06 00:30:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:34,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:30:34,814 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-06 00:30:34,815 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-06 00:30:34,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:30:34,843 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-06 00:30:34,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:30:34,869 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-06 00:30:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:51,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226150809] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:30:51,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:30:51,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 00:30:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536135023] [2022-12-06 00:30:51,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:30:51,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:30:51,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:30:51,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:30:51,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:30:51,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:30:51,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 248 transitions, 7259 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-06 00:30:51,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:30:51,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:30:51,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:30:52,360 INFO L130 PetriNetUnfolder]: 569/1109 cut-off events. [2022-12-06 00:30:52,361 INFO L131 PetriNetUnfolder]: For 30338/30338 co-relation queries the response was YES. [2022-12-06 00:30:52,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13585 conditions, 1109 events. 569/1109 cut-off events. For 30338/30338 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5975 event pairs, 38 based on Foata normal form. 5/1112 useless extension candidates. Maximal degree in co-relation 13498. Up to 502 conditions per place. [2022-12-06 00:30:52,370 INFO L137 encePairwiseOnDemand]: 12/51 looper letters, 93 selfloop transitions, 172 changer transitions 17/282 dead transitions. [2022-12-06 00:30:52,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 282 transitions, 8168 flow [2022-12-06 00:30:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:30:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:30:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 108 transitions. [2022-12-06 00:30:52,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1323529411764706 [2022-12-06 00:30:52,371 INFO L175 Difference]: Start difference. First operand has 175 places, 248 transitions, 7259 flow. Second operand 16 states and 108 transitions. [2022-12-06 00:30:52,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 282 transitions, 8168 flow [2022-12-06 00:30:52,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 282 transitions, 7830 flow, removed 24 selfloop flow, removed 9 redundant places. [2022-12-06 00:30:52,457 INFO L231 Difference]: Finished difference. Result has 185 places, 247 transitions, 7408 flow [2022-12-06 00:30:52,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=6926, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7408, PETRI_PLACES=185, PETRI_TRANSITIONS=247} [2022-12-06 00:30:52,457 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 163 predicate places. [2022-12-06 00:30:52,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:30:52,457 INFO L89 Accepts]: Start accepts. Operand has 185 places, 247 transitions, 7408 flow [2022-12-06 00:30:52,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:30:52,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:30:52,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 247 transitions, 7408 flow [2022-12-06 00:30:52,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 247 transitions, 7408 flow [2022-12-06 00:30:52,571 INFO L130 PetriNetUnfolder]: 274/681 cut-off events. [2022-12-06 00:30:52,571 INFO L131 PetriNetUnfolder]: For 16392/16397 co-relation queries the response was YES. [2022-12-06 00:30:52,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8608 conditions, 681 events. 274/681 cut-off events. For 16392/16397 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3809 event pairs, 24 based on Foata normal form. 0/658 useless extension candidates. Maximal degree in co-relation 8465. Up to 256 conditions per place. [2022-12-06 00:30:52,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 247 transitions, 7408 flow [2022-12-06 00:30:52,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-06 00:30:55,629 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:30:55,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3173 [2022-12-06 00:30:55,630 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 247 transitions, 7441 flow [2022-12-06 00:30:55,630 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-06 00:30:55,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:30:55,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:30:55,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 00:30:55,830 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,SelfDestructingSolverStorable37 [2022-12-06 00:30:55,831 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:30:55,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:30:55,831 INFO L85 PathProgramCache]: Analyzing trace with hash -178896919, now seen corresponding path program 1 times [2022-12-06 00:30:55,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:30:55,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524689747] [2022-12-06 00:30:55,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:55,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:30:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:56,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:30:56,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524689747] [2022-12-06 00:30:56,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524689747] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:30:56,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139677716] [2022-12-06 00:30:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:56,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:30:56,424 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:30:56,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 00:30:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:56,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 00:30:56,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:30:56,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:30:56,628 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-06 00:30:56,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:30:56,706 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-06 00:30:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:56,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:30:57,046 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-06 00:30:57,046 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-06 00:30:57,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:30:57,075 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-06 00:30:57,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:30:57,098 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-06 00:31:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:08,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139677716] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:08,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:08,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 00:31:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337077937] [2022-12-06 00:31:08,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:08,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:31:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:08,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:31:08,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:31:08,815 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 00:31:08,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 247 transitions, 7441 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-06 00:31:08,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:08,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 00:31:08,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:10,039 INFO L130 PetriNetUnfolder]: 570/1104 cut-off events. [2022-12-06 00:31:10,040 INFO L131 PetriNetUnfolder]: For 32530/32530 co-relation queries the response was YES. [2022-12-06 00:31:10,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14150 conditions, 1104 events. 570/1104 cut-off events. For 32530/32530 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5945 event pairs, 23 based on Foata normal form. 1/1103 useless extension candidates. Maximal degree in co-relation 13910. Up to 506 conditions per place. [2022-12-06 00:31:10,048 INFO L137 encePairwiseOnDemand]: 9/50 looper letters, 68 selfloop transitions, 204 changer transitions 12/284 dead transitions. [2022-12-06 00:31:10,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 284 transitions, 8417 flow [2022-12-06 00:31:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 00:31:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 00:31:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 112 transitions. [2022-12-06 00:31:10,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12444444444444444 [2022-12-06 00:31:10,049 INFO L175 Difference]: Start difference. First operand has 177 places, 247 transitions, 7441 flow. Second operand 18 states and 112 transitions. [2022-12-06 00:31:10,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 284 transitions, 8417 flow [2022-12-06 00:31:10,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 284 transitions, 8229 flow, removed 15 selfloop flow, removed 11 redundant places. [2022-12-06 00:31:10,143 INFO L231 Difference]: Finished difference. Result has 185 places, 250 transitions, 7768 flow [2022-12-06 00:31:10,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7262, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7768, PETRI_PLACES=185, PETRI_TRANSITIONS=250} [2022-12-06 00:31:10,143 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 163 predicate places. [2022-12-06 00:31:10,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:10,144 INFO L89 Accepts]: Start accepts. Operand has 185 places, 250 transitions, 7768 flow [2022-12-06 00:31:10,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:10,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:10,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 250 transitions, 7768 flow [2022-12-06 00:31:10,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 250 transitions, 7768 flow [2022-12-06 00:31:10,233 INFO L130 PetriNetUnfolder]: 274/686 cut-off events. [2022-12-06 00:31:10,233 INFO L131 PetriNetUnfolder]: For 17354/17364 co-relation queries the response was YES. [2022-12-06 00:31:10,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8941 conditions, 686 events. 274/686 cut-off events. For 17354/17364 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3866 event pairs, 25 based on Foata normal form. 2/665 useless extension candidates. Maximal degree in co-relation 8871. Up to 256 conditions per place. [2022-12-06 00:31:10,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 250 transitions, 7768 flow [2022-12-06 00:31:10,241 INFO L188 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-06 00:31:10,245 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [840] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_531| v_~q1~0.base_305))) (and (< v_~j~0_434 v_~N~0_294) (= (+ (select .cse0 (+ v_~q1~0.offset_305 (* v_~q1_front~0_422 4))) 1) v_~i~0_397) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_304| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_304|) (= v_~q1_front~0_421 (+ v_~q1_front~0_422 1)) (= (+ v_~q1_back~0_476 1) v_~q1_back~0_475) (not (= (ite (and (<= 0 v_~q1_back~0_476) (< v_~q1_back~0_476 v_~n1~0_290)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_324| (ite (= v_~j~0_434 (select .cse0 (+ v_~q1~0.offset_305 (* v_~q1_back~0_476 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_304| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_324| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_324|) (= (ite (and (< v_~q1_front~0_422 v_~q1_back~0_475) (<= 0 v_~q1_front~0_422) (< v_~q1_front~0_422 v_~n1~0_290)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_304|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_324| 0)))) InVars {~j~0=v_~j~0_434, ~q1~0.offset=v_~q1~0.offset_305, ~q1_front~0=v_~q1_front~0_422, ~q1_back~0=v_~q1_back~0_476, ~n1~0=v_~n1~0_290, ~q1~0.base=v_~q1~0.base_305, #memory_int=|v_#memory_int_531|, ~N~0=v_~N~0_294} OutVars{~j~0=v_~j~0_434, ~q1~0.offset=v_~q1~0.offset_305, ~q1_front~0=v_~q1_front~0_421, ~i~0=v_~i~0_397, ~n1~0=v_~n1~0_290, 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_324|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_181|, ~N~0=v_~N~0_294, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_181|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_324|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_304|, ~q1_back~0=v_~q1_back~0_475, ~q1~0.base=v_~q1~0.base_305, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_199|, #memory_int=|v_#memory_int_531|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_304|, 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-06 00:31:10,378 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:10,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:31:10,379 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 249 transitions, 7748 flow [2022-12-06 00:31:10,379 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-06 00:31:10,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:10,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:10,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 00:31:10,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 00:31:10,580 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:10,580 INFO L85 PathProgramCache]: Analyzing trace with hash 556754765, now seen corresponding path program 1 times [2022-12-06 00:31:10,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:10,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461293464] [2022-12-06 00:31:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:10,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:11,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:11,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461293464] [2022-12-06 00:31:11,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461293464] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:11,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144975470] [2022-12-06 00:31:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:11,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:11,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:11,131 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:11,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 00:31:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:11,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 00:31:11,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:11,287 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-06 00:31:11,299 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:31:11,299 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-06 00:31:11,305 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 84 treesize of output 76 [2022-12-06 00:31:11,359 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-06 00:31:11,410 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-06 00:31:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:11,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:11,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144975470] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:11,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:11,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 00:31:11,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664420460] [2022-12-06 00:31:11,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:11,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:31:11,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:11,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:31:11,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:31:11,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 00:31:11,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 249 transitions, 7748 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-06 00:31:11,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:11,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 00:31:11,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:18,366 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:31:18,803 INFO L130 PetriNetUnfolder]: 574/1114 cut-off events. [2022-12-06 00:31:18,803 INFO L131 PetriNetUnfolder]: For 34931/34931 co-relation queries the response was YES. [2022-12-06 00:31:18,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14590 conditions, 1114 events. 574/1114 cut-off events. For 34931/34931 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5905 event pairs, 62 based on Foata normal form. 1/1113 useless extension candidates. Maximal degree in co-relation 14511. Up to 640 conditions per place. [2022-12-06 00:31:18,811 INFO L137 encePairwiseOnDemand]: 13/50 looper letters, 97 selfloop transitions, 164 changer transitions 13/274 dead transitions. [2022-12-06 00:31:18,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 274 transitions, 8522 flow [2022-12-06 00:31:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:31:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:31:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2022-12-06 00:31:18,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15833333333333333 [2022-12-06 00:31:18,812 INFO L175 Difference]: Start difference. First operand has 182 places, 249 transitions, 7748 flow. Second operand 12 states and 95 transitions. [2022-12-06 00:31:18,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 274 transitions, 8522 flow [2022-12-06 00:31:18,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 274 transitions, 8100 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-12-06 00:31:18,947 INFO L231 Difference]: Finished difference. Result has 185 places, 248 transitions, 7624 flow [2022-12-06 00:31:18,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7330, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7624, PETRI_PLACES=185, PETRI_TRANSITIONS=248} [2022-12-06 00:31:18,949 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 163 predicate places. [2022-12-06 00:31:18,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:18,949 INFO L89 Accepts]: Start accepts. Operand has 185 places, 248 transitions, 7624 flow [2022-12-06 00:31:18,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:18,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:18,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 248 transitions, 7624 flow [2022-12-06 00:31:18,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 248 transitions, 7624 flow [2022-12-06 00:31:19,030 INFO L130 PetriNetUnfolder]: 266/676 cut-off events. [2022-12-06 00:31:19,030 INFO L131 PetriNetUnfolder]: For 15590/15600 co-relation queries the response was YES. [2022-12-06 00:31:19,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8453 conditions, 676 events. 266/676 cut-off events. For 15590/15600 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3857 event pairs, 24 based on Foata normal form. 0/649 useless extension candidates. Maximal degree in co-relation 8385. Up to 242 conditions per place. [2022-12-06 00:31:19,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 248 transitions, 7624 flow [2022-12-06 00:31:19,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 434 [2022-12-06 00:31:19,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L65-1-->L65-1: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_480) (< v_~q1_back~0_480 v_~n1~0_292)) 1 0) 0)) (= (+ v_~q1_back~0_480 1) v_~q1_back~0_479) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| (ite (and (< v_~q2_front~0_445 v_~q2_back~0_452) (<= 0 v_~q2_front~0_445) (< v_~q2_front~0_445 v_~n2~0_296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326| 0)) (= (+ v_~q2_front~0_445 1) v_~q2_front~0_444) (not (= (ite (= v_~j~0_437 (select (select |v_#memory_int_533| v_~q1~0.base_307) (+ v_~q1~0.offset_307 (* v_~q1_back~0_480 4)))) 1 0) 0)) (= v_~j~0_436 (+ (select (select |v_#memory_int_533| v_~q2~0.base_288) (+ v_~q2~0.offset_288 (* v_~q2_front~0_445 4))) 1)) (< v_~j~0_437 v_~N~0_296)) InVars {~j~0=v_~j~0_437, ~q1~0.offset=v_~q1~0.offset_307, ~n2~0=v_~n2~0_296, ~q1_back~0=v_~q1_back~0_480, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_292, ~q1~0.base=v_~q1~0.base_307, #memory_int=|v_#memory_int_533|, ~q2_front~0=v_~q2_front~0_445, ~q2~0.base=v_~q2~0.base_288, ~N~0=v_~N~0_296, ~q2_back~0=v_~q2_back~0_452} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_213|, ~j~0=v_~j~0_436, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_207|, ~q1~0.offset=v_~q1~0.offset_307, ~n2~0=v_~n2~0_296, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_292, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326|, ~q2_front~0=v_~q2_front~0_444, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_183|, ~N~0=v_~N~0_296, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_183|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_207|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_326|, ~q1_back~0=v_~q1_back~0_479, ~q1~0.base=v_~q1~0.base_307, #memory_int=|v_#memory_int_533|, ~q2~0.base=v_~q2~0.base_288, ~q2_back~0=v_~q2_back~0_452} 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-06 00:31:19,171 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:19,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:31:19,171 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 247 transitions, 7598 flow [2022-12-06 00:31:19,171 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-06 00:31:19,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:19,171 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:19,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 00:31:19,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 00:31:19,372 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:19,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1527375336, now seen corresponding path program 1 times [2022-12-06 00:31:19,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:19,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185626958] [2022-12-06 00:31:19,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:19,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:20,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:20,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185626958] [2022-12-06 00:31:20,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185626958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:20,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580502592] [2022-12-06 00:31:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:20,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:20,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:20,069 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:20,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 00:31:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:20,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 00:31:20,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:20,244 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-06 00:31:20,250 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-06 00:31:20,262 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:31:20,262 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 00:31:20,313 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-06 00:31:20,362 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 00:31:20,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 23 [2022-12-06 00:31:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:20,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:20,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580502592] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:20,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:20,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 00:31:20,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572403385] [2022-12-06 00:31:20,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:20,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:31:20,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:20,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:31:20,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:31:20,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 00:31:20,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 247 transitions, 7598 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-06 00:31:20,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:20,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 00:31:20,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:27,975 INFO L130 PetriNetUnfolder]: 566/1102 cut-off events. [2022-12-06 00:31:27,975 INFO L131 PetriNetUnfolder]: For 32099/32099 co-relation queries the response was YES. [2022-12-06 00:31:27,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14025 conditions, 1102 events. 566/1102 cut-off events. For 32099/32099 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5922 event pairs, 48 based on Foata normal form. 3/1103 useless extension candidates. Maximal degree in co-relation 13948. Up to 503 conditions per place. [2022-12-06 00:31:27,983 INFO L137 encePairwiseOnDemand]: 9/50 looper letters, 75 selfloop transitions, 180 changer transitions 22/277 dead transitions. [2022-12-06 00:31:27,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 277 transitions, 8407 flow [2022-12-06 00:31:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:31:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:31:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 102 transitions. [2022-12-06 00:31:27,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1457142857142857 [2022-12-06 00:31:27,984 INFO L175 Difference]: Start difference. First operand has 182 places, 247 transitions, 7598 flow. Second operand 14 states and 102 transitions. [2022-12-06 00:31:27,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 277 transitions, 8407 flow [2022-12-06 00:31:28,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 277 transitions, 8280 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-06 00:31:28,101 INFO L231 Difference]: Finished difference. Result has 192 places, 244 transitions, 7742 flow [2022-12-06 00:31:28,101 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7471, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7742, PETRI_PLACES=192, PETRI_TRANSITIONS=244} [2022-12-06 00:31:28,101 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 170 predicate places. [2022-12-06 00:31:28,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:28,101 INFO L89 Accepts]: Start accepts. Operand has 192 places, 244 transitions, 7742 flow [2022-12-06 00:31:28,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:28,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:28,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 244 transitions, 7742 flow [2022-12-06 00:31:28,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 244 transitions, 7742 flow [2022-12-06 00:31:28,187 INFO L130 PetriNetUnfolder]: 265/665 cut-off events. [2022-12-06 00:31:28,188 INFO L131 PetriNetUnfolder]: For 16574/16582 co-relation queries the response was YES. [2022-12-06 00:31:28,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8861 conditions, 665 events. 265/665 cut-off events. For 16574/16582 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3728 event pairs, 24 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 8790. Up to 240 conditions per place. [2022-12-06 00:31:28,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 244 transitions, 7742 flow [2022-12-06 00:31:28,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-06 00:31:28,195 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:31:28,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 00:31:28,196 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 244 transitions, 7742 flow [2022-12-06 00:31:28,196 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-06 00:31:28,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:28,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:28,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 00:31:28,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:28,401 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:28,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:28,402 INFO L85 PathProgramCache]: Analyzing trace with hash 111108672, now seen corresponding path program 1 times [2022-12-06 00:31:28,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:28,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250336776] [2022-12-06 00:31:28,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:28,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:29,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:29,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250336776] [2022-12-06 00:31:29,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250336776] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:29,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208079944] [2022-12-06 00:31:29,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:29,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:29,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:29,827 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:29,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 00:31:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:29,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 00:31:29,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:30,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:30,081 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-06 00:31:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:30,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:30,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:30,259 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-06 00:31:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:30,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208079944] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:30,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:30,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 00:31:30,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748479292] [2022-12-06 00:31:30,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:30,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:31:30,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:30,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:31:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:31:30,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:31:30,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 244 transitions, 7742 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-06 00:31:30,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:30,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:31:30,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:31,893 INFO L130 PetriNetUnfolder]: 581/1119 cut-off events. [2022-12-06 00:31:31,893 INFO L131 PetriNetUnfolder]: For 37520/37520 co-relation queries the response was YES. [2022-12-06 00:31:31,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15136 conditions, 1119 events. 581/1119 cut-off events. For 37520/37520 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6024 event pairs, 38 based on Foata normal form. 5/1122 useless extension candidates. Maximal degree in co-relation 15056. Up to 442 conditions per place. [2022-12-06 00:31:31,902 INFO L137 encePairwiseOnDemand]: 9/47 looper letters, 79 selfloop transitions, 208 changer transitions 10/297 dead transitions. [2022-12-06 00:31:31,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 297 transitions, 9142 flow [2022-12-06 00:31:31,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 00:31:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 00:31:31,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 134 transitions. [2022-12-06 00:31:31,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13576494427558258 [2022-12-06 00:31:31,903 INFO L175 Difference]: Start difference. First operand has 186 places, 244 transitions, 7742 flow. Second operand 21 states and 134 transitions. [2022-12-06 00:31:31,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 297 transitions, 9142 flow [2022-12-06 00:31:31,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 297 transitions, 8828 flow, removed 12 selfloop flow, removed 11 redundant places. [2022-12-06 00:31:32,000 INFO L231 Difference]: Finished difference. Result has 201 places, 256 transitions, 8525 flow [2022-12-06 00:31:32,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7457, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=8525, PETRI_PLACES=201, PETRI_TRANSITIONS=256} [2022-12-06 00:31:32,000 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 179 predicate places. [2022-12-06 00:31:32,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:32,000 INFO L89 Accepts]: Start accepts. Operand has 201 places, 256 transitions, 8525 flow [2022-12-06 00:31:32,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:32,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:32,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 256 transitions, 8525 flow [2022-12-06 00:31:32,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 256 transitions, 8525 flow [2022-12-06 00:31:32,086 INFO L130 PetriNetUnfolder]: 266/664 cut-off events. [2022-12-06 00:31:32,086 INFO L131 PetriNetUnfolder]: For 18322/18334 co-relation queries the response was YES. [2022-12-06 00:31:32,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9424 conditions, 664 events. 266/664 cut-off events. For 18322/18334 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3794 event pairs, 22 based on Foata normal form. 1/639 useless extension candidates. Maximal degree in co-relation 9350. Up to 246 conditions per place. [2022-12-06 00:31:32,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 256 transitions, 8525 flow [2022-12-06 00:31:32,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-06 00:31:32,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [868] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_620| v_~q2~0.base_340))) (and (= (+ v_~q2_back~0_520 1) v_~q2_back~0_519) (= (+ v_~q2_front~0_522 1) v_~q2_front~0_521) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_382| (ite (and (< v_~q2_front~0_522 v_~n2~0_342) (< v_~q2_front~0_522 v_~q2_back~0_519) (<= 0 v_~q2_front~0_522)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_371| (ite (= (select .cse0 (+ v_~q2~0.offset_340 (* 4 v_~q2_back~0_520))) v_~i~0_462) 1 0)) (< v_~i~0_462 v_~N~0_334) (not (= (ite (= v_~j~0_501 (select (select |v_#memory_int_620| v_~q1~0.base_357) (+ v_~q1~0.offset_357 (* v_~q1_back~0_547 4)))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_371| 0)) (= (+ v_~q1_back~0_547 1) v_~q1_back~0_546) (= v_~j~0_500 (+ (select .cse0 (+ (* v_~q2_front~0_522 4) v_~q2~0.offset_340)) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_382| 0)) (not (= 0 (ite (and (<= 0 v_~q1_back~0_547) (< v_~q1_back~0_547 v_~n1~0_340)) 1 0))) (< v_~j~0_501 v_~N~0_334) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_382| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_382|) (not (= (ite (and (<= 0 v_~q2_back~0_520) (< v_~q2_back~0_520 v_~n2~0_342)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_371| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_371|))) InVars {~j~0=v_~j~0_501, ~q1~0.offset=v_~q1~0.offset_357, ~n2~0=v_~n2~0_342, ~i~0=v_~i~0_462, ~q2~0.offset=v_~q2~0.offset_340, ~n1~0=v_~n1~0_340, ~q2_front~0=v_~q2_front~0_522, ~N~0=v_~N~0_334, ~q1_back~0=v_~q1_back~0_547, ~q1~0.base=v_~q1~0.base_357, #memory_int=|v_#memory_int_620|, ~q2~0.base=v_~q2~0.base_340, ~q2_back~0=v_~q2_back~0_520} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_179|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_255|, ~j~0=v_~j~0_500, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_249|, ~q1~0.offset=v_~q1~0.offset_357, ~n2~0=v_~n2~0_342, ~i~0=v_~i~0_462, ~q2~0.offset=v_~q2~0.offset_340, ~n1~0=v_~n1~0_340, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_382|, ~q2_front~0=v_~q2_front~0_521, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_207|, ~N~0=v_~N~0_334, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_207|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_249|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_382|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_371|, ~q1_back~0=v_~q1_back~0_546, ~q1~0.base=v_~q1~0.base_357, #memory_int=|v_#memory_int_620|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_371|, ~q2~0.base=v_~q2~0.base_340, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_179|, ~q2_back~0=v_~q2_back~0_519} 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-06 00:31:32,274 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:32,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-06 00:31:32,275 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 256 transitions, 8539 flow [2022-12-06 00:31:32,275 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-06 00:31:32,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:32,275 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:32,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-06 00:31:32,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:32,481 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:32,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:32,481 INFO L85 PathProgramCache]: Analyzing trace with hash 636929995, now seen corresponding path program 1 times [2022-12-06 00:31:32,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:32,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993745283] [2022-12-06 00:31:32,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:32,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:33,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:33,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993745283] [2022-12-06 00:31:33,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993745283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:33,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021970878] [2022-12-06 00:31:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:33,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:33,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:33,694 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:33,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 00:31:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:33,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 00:31:33,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:33,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:31:33,898 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-06 00:31:33,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:33,979 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-06 00:31:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:34,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:34,366 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-06 00:31:34,367 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-06 00:31:34,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:34,395 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-06 00:31:34,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:34,419 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-06 00:31:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:54,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021970878] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:54,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:54,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 00:31:54,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229300630] [2022-12-06 00:31:54,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:54,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:31:54,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:54,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:31:54,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-06 00:31:54,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 00:31:54,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 256 transitions, 8539 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-06 00:31:54,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:54,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 00:31:54,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:56,216 INFO L130 PetriNetUnfolder]: 603/1167 cut-off events. [2022-12-06 00:31:56,216 INFO L131 PetriNetUnfolder]: For 39503/39503 co-relation queries the response was YES. [2022-12-06 00:31:56,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16420 conditions, 1167 events. 603/1167 cut-off events. For 39503/39503 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6328 event pairs, 16 based on Foata normal form. 1/1166 useless extension candidates. Maximal degree in co-relation 16334. Up to 440 conditions per place. [2022-12-06 00:31:56,226 INFO L137 encePairwiseOnDemand]: 8/48 looper letters, 74 selfloop transitions, 226 changer transitions 9/309 dead transitions. [2022-12-06 00:31:56,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 309 transitions, 9979 flow [2022-12-06 00:31:56,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 00:31:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 00:31:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 122 transitions. [2022-12-06 00:31:56,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11553030303030302 [2022-12-06 00:31:56,227 INFO L175 Difference]: Start difference. First operand has 199 places, 256 transitions, 8539 flow. Second operand 22 states and 122 transitions. [2022-12-06 00:31:56,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 309 transitions, 9979 flow [2022-12-06 00:31:56,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 309 transitions, 9886 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-06 00:31:56,371 INFO L231 Difference]: Finished difference. Result has 220 places, 272 transitions, 9707 flow [2022-12-06 00:31:56,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8450, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9707, PETRI_PLACES=220, PETRI_TRANSITIONS=272} [2022-12-06 00:31:56,371 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 198 predicate places. [2022-12-06 00:31:56,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:56,371 INFO L89 Accepts]: Start accepts. Operand has 220 places, 272 transitions, 9707 flow [2022-12-06 00:31:56,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:56,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:56,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 272 transitions, 9707 flow [2022-12-06 00:31:56,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 272 transitions, 9707 flow [2022-12-06 00:31:56,467 INFO L130 PetriNetUnfolder]: 273/689 cut-off events. [2022-12-06 00:31:56,468 INFO L131 PetriNetUnfolder]: For 22503/22520 co-relation queries the response was YES. [2022-12-06 00:31:56,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10468 conditions, 689 events. 273/689 cut-off events. For 22503/22520 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3987 event pairs, 23 based on Foata normal form. 1/661 useless extension candidates. Maximal degree in co-relation 10381. Up to 251 conditions per place. [2022-12-06 00:31:56,476 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 272 transitions, 9707 flow [2022-12-06 00:31:56,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-06 00:31:56,486 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [909] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_775| v_~q2~0.base_422)) (.cse1 (select |v_#memory_int_775| v_~q1~0.base_423))) (and (= (+ v_~q2_back~0_627 1) v_~q2_back~0_626) (= v_~q1_front~0_615 (+ v_~q1_front~0_616 1)) (not (= (ite (and (< v_~q1_back~0_658 v_~n1~0_400) (<= 0 v_~q1_back~0_658)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_475| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_475|) (not (= (ite (and (<= 0 v_~q2_back~0_627) (< v_~q2_back~0_627 v_~n2~0_418)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_475| (ite (and (<= 0 v_~q2_front~0_639) (< v_~q2_front~0_639 v_~q2_back~0_626) (< v_~q2_front~0_639 v_~n2~0_418)) 1 0)) (< v_~j~0_620 v_~N~0_406) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_475| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_463| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_463|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_463| 0)) (= v_~j~0_619 (+ (select .cse0 (+ v_~q2~0.offset_422 (* v_~q2_front~0_639 4))) 1)) (= (ite (and (< v_~q1_front~0_616 v_~n1~0_400) (<= 0 v_~q1_front~0_616) (< v_~q1_front~0_616 v_~q1_back~0_657)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_463|) (= (+ v_~q1_back~0_658 1) v_~q1_back~0_657) (< v_~i~0_549 v_~N~0_406) (= (+ v_~q2_front~0_639 1) v_~q2_front~0_638) (not (= (ite (= v_~j~0_620 (select .cse1 (+ v_~q1~0.offset_423 (* v_~q1_back~0_658 4)))) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q2~0.offset_422 (* 4 v_~q2_back~0_627))) v_~i~0_549) 1 0) 0)) (= (+ (select .cse1 (+ v_~q1~0.offset_423 (* v_~q1_front~0_616 4))) 1) v_~i~0_548))) InVars {~j~0=v_~j~0_620, ~q1~0.offset=v_~q1~0.offset_423, ~q1_front~0=v_~q1_front~0_616, ~n2~0=v_~n2~0_418, ~i~0=v_~i~0_549, ~n1~0=v_~n1~0_400, ~q2~0.offset=v_~q2~0.offset_422, ~q2_front~0=v_~q2_front~0_639, ~N~0=v_~N~0_406, ~q1_back~0=v_~q1_back~0_658, ~q1~0.base=v_~q1~0.base_423, #memory_int=|v_#memory_int_775|, ~q2~0.base=v_~q2~0.base_422, ~q2_back~0=v_~q2_back~0_627} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_227|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_323|, ~j~0=v_~j~0_619, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_317|, ~q1_front~0=v_~q1_front~0_615, ~n1~0=v_~n1~0_400, ~q2~0.offset=v_~q2~0.offset_422, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_475|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_317|, ~q1_back~0=v_~q1_back~0_657, ~q1~0.base=v_~q1~0.base_423, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_309|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_463|, ~q2~0.base=v_~q2~0.base_422, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_303|, ~q2_back~0=v_~q2_back~0_626, ~q1~0.offset=v_~q1~0.offset_423, ~n2~0=v_~n2~0_418, ~i~0=v_~i~0_548, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_303|, ~q2_front~0=v_~q2_front~0_638, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_267|, ~N~0=v_~N~0_406, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_267|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_475|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_463|, #memory_int=|v_#memory_int_775|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_227|} 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 [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-06 00:31:56,486 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,486 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,486 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,486 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,486 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,486 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,486 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,486 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,487 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,487 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,487 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,487 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,873 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,873 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,873 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,873 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,874 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,874 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,874 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,874 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,874 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,874 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,874 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:56,874 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:31:57,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:57,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 890 [2022-12-06 00:31:57,261 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 272 transitions, 9717 flow [2022-12-06 00:31:57,261 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-06 00:31:57,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:57,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:57,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-06 00:31:57,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-06 00:31:57,462 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:57,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash -781325527, now seen corresponding path program 1 times [2022-12-06 00:31:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:57,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543200041] [2022-12-06 00:31:57,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:57,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:58,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543200041] [2022-12-06 00:31:58,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543200041] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:58,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800569675] [2022-12-06 00:31:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:58,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:58,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:58,530 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:58,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 00:31:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:58,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 00:31:58,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:58,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:58,805 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-06 00:31:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:58,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:59,211 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-06 00:31:59,212 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-06 00:32:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:04,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800569675] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:04,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:04,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2022-12-06 00:32:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808265580] [2022-12-06 00:32:04,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:04,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 00:32:04,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:04,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 00:32:04,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-12-06 00:32:04,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 00:32:04,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 272 transitions, 9717 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-06 00:32:04,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:04,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 00:32:04,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:05,726 INFO L130 PetriNetUnfolder]: 597/1151 cut-off events. [2022-12-06 00:32:05,726 INFO L131 PetriNetUnfolder]: For 46081/46081 co-relation queries the response was YES. [2022-12-06 00:32:05,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17282 conditions, 1151 events. 597/1151 cut-off events. For 46081/46081 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6275 event pairs, 14 based on Foata normal form. 1/1150 useless extension candidates. Maximal degree in co-relation 17186. Up to 445 conditions per place. [2022-12-06 00:32:05,736 INFO L137 encePairwiseOnDemand]: 9/50 looper letters, 84 selfloop transitions, 219 changer transitions 11/314 dead transitions. [2022-12-06 00:32:05,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 314 transitions, 10658 flow [2022-12-06 00:32:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 00:32:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 00:32:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 139 transitions. [2022-12-06 00:32:05,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1112 [2022-12-06 00:32:05,737 INFO L175 Difference]: Start difference. First operand has 219 places, 272 transitions, 9717 flow. Second operand 25 states and 139 transitions. [2022-12-06 00:32:05,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 314 transitions, 10658 flow [2022-12-06 00:32:05,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 314 transitions, 10259 flow, removed 21 selfloop flow, removed 13 redundant places. [2022-12-06 00:32:05,894 INFO L231 Difference]: Finished difference. Result has 230 places, 269 transitions, 9717 flow [2022-12-06 00:32:05,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=9316, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=9717, PETRI_PLACES=230, PETRI_TRANSITIONS=269} [2022-12-06 00:32:05,895 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 208 predicate places. [2022-12-06 00:32:05,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:05,895 INFO L89 Accepts]: Start accepts. Operand has 230 places, 269 transitions, 9717 flow [2022-12-06 00:32:05,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:05,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:05,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 269 transitions, 9717 flow [2022-12-06 00:32:05,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 269 transitions, 9717 flow [2022-12-06 00:32:05,993 INFO L130 PetriNetUnfolder]: 282/697 cut-off events. [2022-12-06 00:32:05,994 INFO L131 PetriNetUnfolder]: For 23314/23328 co-relation queries the response was YES. [2022-12-06 00:32:05,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10784 conditions, 697 events. 282/697 cut-off events. For 23314/23328 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3935 event pairs, 22 based on Foata normal form. 1/673 useless extension candidates. Maximal degree in co-relation 10394. Up to 255 conditions per place. [2022-12-06 00:32:06,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 269 transitions, 9717 flow [2022-12-06 00:32:06,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-06 00:32:06,003 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:32:06,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 00:32:06,004 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 269 transitions, 9717 flow [2022-12-06 00:32:06,004 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-06 00:32:06,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:06,004 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:06,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 00:32:06,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:06,210 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:32:06,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1346215387, now seen corresponding path program 1 times [2022-12-06 00:32:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:06,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265456622] [2022-12-06 00:32:06,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:06,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:06,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:06,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265456622] [2022-12-06 00:32:06,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265456622] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:06,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631370793] [2022-12-06 00:32:06,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:06,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:06,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:06,956 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:32:06,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 00:32:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:07,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 00:32:07,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:07,147 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 22 treesize of output 26 [2022-12-06 00:32:07,164 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-06 00:32:07,179 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:32:07,179 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-06 00:32:07,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:32:07,426 INFO L321 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2022-12-06 00:32:07,427 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 49 treesize of output 40 [2022-12-06 00:32:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:07,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:12,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631370793] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:12,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:12,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-06 00:32:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381856376] [2022-12-06 00:32:12,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:12,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 00:32:12,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:12,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 00:32:12,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-12-06 00:32:12,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 00:32:12,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 269 transitions, 9717 flow. Second operand has 21 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:12,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:12,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 00:32:12,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:14,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:32:16,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:32:25,627 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 [0] [2022-12-06 00:32:27,759 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 [0, 1] [2022-12-06 00:32:29,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:32:35,095 INFO L130 PetriNetUnfolder]: 821/1572 cut-off events. [2022-12-06 00:32:35,095 INFO L131 PetriNetUnfolder]: For 67632/67632 co-relation queries the response was YES. [2022-12-06 00:32:35,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23468 conditions, 1572 events. 821/1572 cut-off events. For 67632/67632 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9127 event pairs, 25 based on Foata normal form. 3/1573 useless extension candidates. Maximal degree in co-relation 21334. Up to 537 conditions per place. [2022-12-06 00:32:35,109 INFO L137 encePairwiseOnDemand]: 12/49 looper letters, 123 selfloop transitions, 288 changer transitions 21/432 dead transitions. [2022-12-06 00:32:35,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 432 transitions, 13984 flow [2022-12-06 00:32:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 00:32:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 00:32:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 225 transitions. [2022-12-06 00:32:35,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09982253771073647 [2022-12-06 00:32:35,111 INFO L175 Difference]: Start difference. First operand has 225 places, 269 transitions, 9717 flow. Second operand 46 states and 225 transitions. [2022-12-06 00:32:35,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 432 transitions, 13984 flow [2022-12-06 00:32:35,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 432 transitions, 13639 flow, removed 15 selfloop flow, removed 18 redundant places. [2022-12-06 00:32:35,329 INFO L231 Difference]: Finished difference. Result has 264 places, 339 transitions, 12787 flow [2022-12-06 00:32:35,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9421, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=12787, PETRI_PLACES=264, PETRI_TRANSITIONS=339} [2022-12-06 00:32:35,330 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 242 predicate places. [2022-12-06 00:32:35,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:35,330 INFO L89 Accepts]: Start accepts. Operand has 264 places, 339 transitions, 12787 flow [2022-12-06 00:32:35,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:35,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:35,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 339 transitions, 12787 flow [2022-12-06 00:32:35,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 339 transitions, 12787 flow [2022-12-06 00:32:35,461 INFO L130 PetriNetUnfolder]: 344/888 cut-off events. [2022-12-06 00:32:35,461 INFO L131 PetriNetUnfolder]: For 32496/32514 co-relation queries the response was YES. [2022-12-06 00:32:35,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13668 conditions, 888 events. 344/888 cut-off events. For 32496/32514 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5619 event pairs, 40 based on Foata normal form. 1/851 useless extension candidates. Maximal degree in co-relation 13554. Up to 294 conditions per place. [2022-12-06 00:32:35,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 262 places, 339 transitions, 12787 flow [2022-12-06 00:32:35,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 652 [2022-12-06 00:32:35,561 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-06 00:32:35,788 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-06 00:32:35,928 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-06 00:32:36,074 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-06 00:32:36,153 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-06 00:32:36,228 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [918] L52-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q2_back~0_656) (< v_~q2_back~0_656 v_~n2~0_432)) 1 0) 0)) (= (+ v_~q2_back~0_656 1) v_~q2_back~0_655) (< v_~i~0_570 v_~N~0_418) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_489| (ite (= (select (select |v_#memory_int_795| v_~q2~0.base_436) (+ (* 4 v_~q2_back~0_656) v_~q2~0.offset_436)) v_~i~0_570) 1 0)) (= (+ v_~q1_front~0_641 1) v_~q1_front~0_640) (= (+ (select (select |v_#memory_int_795| v_~q1~0.base_435) (+ (* v_~q1_front~0_641 4) v_~q1~0.offset_435)) 1) v_~i~0_570) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_489| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_489|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_489| 0)) (not (= (ite (and (<= 0 v_~q1_front~0_641) (< v_~q1_front~0_641 v_~n1~0_412) (< v_~q1_front~0_641 v_~q1_back~0_684)) 1 0) 0))) InVars {~q1~0.offset=v_~q1~0.offset_435, ~n2~0=v_~n2~0_432, ~q1_front~0=v_~q1_front~0_641, ~q1_back~0=v_~q1_back~0_684, ~q2~0.offset=v_~q2~0.offset_436, ~n1~0=v_~n1~0_412, ~q1~0.base=v_~q1~0.base_435, #memory_int=|v_#memory_int_795|, ~q2~0.base=v_~q2~0.base_436, ~N~0=v_~N~0_418, ~q2_back~0=v_~q2_back~0_656} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_244|, ~q1~0.offset=v_~q1~0.offset_435, ~n2~0=v_~n2~0_432, ~q1_front~0=v_~q1_front~0_640, ~i~0=v_~i~0_570, ~q2~0.offset=v_~q2~0.offset_436, ~n1~0=v_~n1~0_412, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_320|, ~N~0=v_~N~0_418, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_489|, ~q1_back~0=v_~q1_back~0_684, ~q1~0.base=v_~q1~0.base_435, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_489|, #memory_int=|v_#memory_int_795|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_326|, ~q2~0.base=v_~q2~0.base_436, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_320|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_244|, ~q2_back~0=v_~q2_back~0_655} 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] 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-06 00:32:36,337 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-06 00:32:36,419 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:36,420 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:36,420 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:36,420 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:36,420 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:36,420 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:36,420 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:36,420 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:36,420 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:36,420 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:36,819 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-06 00:32:36,969 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-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,058 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,455 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,456 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,456 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,456 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,456 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,456 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,456 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,456 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,456 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,456 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,650 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [927] L47-1-->L70: Formula: (let ((.cse0 (select |v_#memory_int_811| v_~q2~0.base_450))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511|) (< v_~i~0_590 v_~N~0_434) (= (ite (= (select .cse0 (+ v_~q2~0.offset_450 (* 4 v_~q2_back~0_684))) v_~i~0_590) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|) (not (= (ite (and (< v_~q2_front~0_692 v_~n2~0_446) (< v_~q2_front~0_692 v_~q2_back~0_683) (<= 0 v_~q2_front~0_692)) 1 0) 0)) (= (+ v_~q2_front~0_692 1) v_~q2_front~0_691) (= v_~j~0_661 (+ (select .cse0 (+ v_~q2~0.offset_450 (* v_~q2_front~0_692 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515|) (not (= (ite (and (< v_~q2_back~0_684 v_~n2~0_446) (<= 0 v_~q2_back~0_684)) 1 0) 0)) (= (+ v_~q2_back~0_684 1) v_~q2_back~0_683) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515| (ite (= v_~j~0_661 (select (select |v_#memory_int_811| v_~q1~0.base_445) (+ (* v_~q1_back~0_701 4) v_~q1~0.offset_445))) 1 0)) (= (+ v_~q1_back~0_701 1) v_~q1_back~0_700) (< v_~j~0_661 v_~N~0_434) (not (= (ite (and (<= 0 v_~q1_back~0_701) (< v_~q1_back~0_701 v_~n1~0_422)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511| 0)))) InVars {~q1~0.offset=v_~q1~0.offset_445, ~n2~0=v_~n2~0_446, ~q1_back~0=v_~q1_back~0_701, ~i~0=v_~i~0_590, ~n1~0=v_~n1~0_422, ~q2~0.offset=v_~q2~0.offset_450, ~q1~0.base=v_~q1~0.base_445, #memory_int=|v_#memory_int_811|, ~q2_front~0=v_~q2_front~0_692, ~q2~0.base=v_~q2~0.base_450, ~N~0=v_~N~0_434, ~q2_back~0=v_~q2_back~0_684} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_258|, ~j~0=v_~j~0_661, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_354|, ~q1~0.offset=v_~q1~0.offset_445, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_348|, ~n2~0=v_~n2~0_446, ~i~0=v_~i~0_590, ~n1~0=v_~n1~0_422, ~q2~0.offset=v_~q2~0.offset_450, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_290|, ~q2_front~0=v_~q2_front~0_691, ~N~0=v_~N~0_434, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_290|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_348|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|, ~q1_back~0=v_~q1_back~0_700, ~q1~0.base=v_~q1~0.base_445, #memory_int=|v_#memory_int_811|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511|, ~q2~0.base=v_~q2~0.base_450, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_258|, ~q2_back~0=v_~q2_back~0_683} 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 [916] L52-->L65-1: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_497| (ite (and (<= 0 v_~q2_front~0_664) (< v_~q2_front~0_664 v_~q2_back~0_651) (< v_~q2_front~0_664 v_~n2~0_428)) 1 0)) (= v_~j~0_643 (+ (select (select |v_#memory_int_791| v_~q2~0.base_432) (+ v_~q2~0.offset_432 (* v_~q2_front~0_664 4))) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_485| (ite (and (<= 0 v_~q1_front~0_633) (< v_~q1_front~0_633 v_~n1~0_408) (< v_~q1_front~0_633 v_~q1_back~0_680)) 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_107| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_485| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|) (= (+ v_~q1_front~0_633 1) v_~q1_front~0_632) (= v_~q2_front~0_663 (+ v_~q2_front~0_664 1)) (= |v_thread1Thread1of1ForFork0_#res#1.base_107| 0) (= (+ (select (select |v_#memory_int_791| v_~q1~0.base_431) (+ v_~q1~0.offset_431 (* v_~q1_front~0_633 4))) 1) v_~i~0_566) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_497| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_497|) (not (< v_~i~0_566 v_~N~0_416)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_497| 0))) InVars {~q1~0.offset=v_~q1~0.offset_431, ~n2~0=v_~n2~0_428, ~q1_front~0=v_~q1_front~0_633, ~q1_back~0=v_~q1_back~0_680, ~q2~0.offset=v_~q2~0.offset_432, ~n1~0=v_~n1~0_408, ~q1~0.base=v_~q1~0.base_431, #memory_int=|v_#memory_int_791|, ~q2_front~0=v_~q2_front~0_664, ~q2~0.base=v_~q2~0.base_432, ~N~0=v_~N~0_416, ~q2_back~0=v_~q2_back~0_651} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_340|, ~j~0=v_~j~0_643, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_334|, ~q1_front~0=v_~q1_front~0_632, ~q2~0.offset=v_~q2~0.offset_432, ~n1~0=v_~n1~0_408, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_497|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_334|, ~q1_back~0=v_~q1_back~0_680, ~q1~0.base=v_~q1~0.base_431, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_322|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|, ~q2~0.base=v_~q2~0.base_432, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_316|, ~q2_back~0=v_~q2_back~0_651, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_107|, ~q1~0.offset=v_~q1~0.offset_431, ~n2~0=v_~n2~0_428, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_107|, ~i~0=v_~i~0_566, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_316|, ~q2_front~0=v_~q2_front~0_663, ~N~0=v_~N~0_416, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_497|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_485|, #memory_int=|v_#memory_int_791|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, thread1Thread1of1ForFork0_#res#1.offset, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 00:32:37,651 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,651 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,651 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,651 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,651 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,651 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,651 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,651 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,651 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,651 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [927] L47-1-->L70: Formula: (let ((.cse0 (select |v_#memory_int_811| v_~q2~0.base_450))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511|) (< v_~i~0_590 v_~N~0_434) (= (ite (= (select .cse0 (+ v_~q2~0.offset_450 (* 4 v_~q2_back~0_684))) v_~i~0_590) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|) (not (= (ite (and (< v_~q2_front~0_692 v_~n2~0_446) (< v_~q2_front~0_692 v_~q2_back~0_683) (<= 0 v_~q2_front~0_692)) 1 0) 0)) (= (+ v_~q2_front~0_692 1) v_~q2_front~0_691) (= v_~j~0_661 (+ (select .cse0 (+ v_~q2~0.offset_450 (* v_~q2_front~0_692 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515|) (not (= (ite (and (< v_~q2_back~0_684 v_~n2~0_446) (<= 0 v_~q2_back~0_684)) 1 0) 0)) (= (+ v_~q2_back~0_684 1) v_~q2_back~0_683) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515| (ite (= v_~j~0_661 (select (select |v_#memory_int_811| v_~q1~0.base_445) (+ (* v_~q1_back~0_701 4) v_~q1~0.offset_445))) 1 0)) (= (+ v_~q1_back~0_701 1) v_~q1_back~0_700) (< v_~j~0_661 v_~N~0_434) (not (= (ite (and (<= 0 v_~q1_back~0_701) (< v_~q1_back~0_701 v_~n1~0_422)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511| 0)))) InVars {~q1~0.offset=v_~q1~0.offset_445, ~n2~0=v_~n2~0_446, ~q1_back~0=v_~q1_back~0_701, ~i~0=v_~i~0_590, ~n1~0=v_~n1~0_422, ~q2~0.offset=v_~q2~0.offset_450, ~q1~0.base=v_~q1~0.base_445, #memory_int=|v_#memory_int_811|, ~q2_front~0=v_~q2_front~0_692, ~q2~0.base=v_~q2~0.base_450, ~N~0=v_~N~0_434, ~q2_back~0=v_~q2_back~0_684} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_258|, ~j~0=v_~j~0_661, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_354|, ~q1~0.offset=v_~q1~0.offset_445, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_348|, ~n2~0=v_~n2~0_446, ~i~0=v_~i~0_590, ~n1~0=v_~n1~0_422, ~q2~0.offset=v_~q2~0.offset_450, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_290|, ~q2_front~0=v_~q2_front~0_691, ~N~0=v_~N~0_434, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_290|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_348|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|, ~q1_back~0=v_~q1_back~0_700, ~q1~0.base=v_~q1~0.base_445, #memory_int=|v_#memory_int_811|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511|, ~q2~0.base=v_~q2~0.base_450, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_258|, ~q2_back~0=v_~q2_back~0_683} 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 [917] L52-->L65-1: Formula: (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_487| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_487| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_487|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_499| (ite (and (< v_~q2_front~0_668 v_~q2_back~0_653) (<= 0 v_~q2_front~0_668) (< v_~q2_front~0_668 v_~n2~0_430)) 1 0)) (= (ite (and (< v_~q1_front~0_637 v_~q1_back~0_682) (< v_~q1_front~0_637 v_~n1~0_410) (<= 0 v_~q1_front~0_637)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_487|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_499| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_499|) (= v_~j~0_645 (+ (select (select |v_#memory_int_793| v_~q2~0.base_434) (+ v_~q2~0.offset_434 (* v_~q2_front~0_668 4))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_499| 0)) (= (+ (select (select |v_#memory_int_793| v_~q1~0.base_433) (+ v_~q1~0.offset_433 (* v_~q1_front~0_637 4))) 1) v_~i~0_568) (= v_~q1_front~0_636 (+ v_~q1_front~0_637 1)) (= (+ v_~q2_front~0_668 1) v_~q2_front~0_667)) InVars {~q1~0.offset=v_~q1~0.offset_433, ~n2~0=v_~n2~0_430, ~q1_front~0=v_~q1_front~0_637, ~q1_back~0=v_~q1_back~0_682, ~q2~0.offset=v_~q2~0.offset_434, ~n1~0=v_~n1~0_410, ~q1~0.base=v_~q1~0.base_433, #memory_int=|v_#memory_int_793|, ~q2_front~0=v_~q2_front~0_668, ~q2~0.base=v_~q2~0.base_434, ~q2_back~0=v_~q2_back~0_653} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_342|, ~j~0=v_~j~0_645, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_336|, ~q1~0.offset=v_~q1~0.offset_433, ~n2~0=v_~n2~0_430, ~q1_front~0=v_~q1_front~0_636, ~i~0=v_~i~0_568, ~q2~0.offset=v_~q2~0.offset_434, ~n1~0=v_~n1~0_410, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_318|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_499|, ~q2_front~0=v_~q2_front~0_667, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_336|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_499|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_487|, ~q1_back~0=v_~q1_back~0_682, ~q1~0.base=v_~q1~0.base_433, #memory_int=|v_#memory_int_793|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_324|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_487|, ~q2~0.base=v_~q2~0.base_434, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_318|, ~q2_back~0=v_~q2_back~0_653} AuxVars[] AssignedVars[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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:32:37,953 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,953 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,953 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,953 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,953 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,953 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,953 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,954 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,954 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:37,954 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:38,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [927] L47-1-->L70: Formula: (let ((.cse0 (select |v_#memory_int_811| v_~q2~0.base_450))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511|) (< v_~i~0_590 v_~N~0_434) (= (ite (= (select .cse0 (+ v_~q2~0.offset_450 (* 4 v_~q2_back~0_684))) v_~i~0_590) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|) (not (= (ite (and (< v_~q2_front~0_692 v_~n2~0_446) (< v_~q2_front~0_692 v_~q2_back~0_683) (<= 0 v_~q2_front~0_692)) 1 0) 0)) (= (+ v_~q2_front~0_692 1) v_~q2_front~0_691) (= v_~j~0_661 (+ (select .cse0 (+ v_~q2~0.offset_450 (* v_~q2_front~0_692 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515|) (not (= (ite (and (< v_~q2_back~0_684 v_~n2~0_446) (<= 0 v_~q2_back~0_684)) 1 0) 0)) (= (+ v_~q2_back~0_684 1) v_~q2_back~0_683) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515| (ite (= v_~j~0_661 (select (select |v_#memory_int_811| v_~q1~0.base_445) (+ (* v_~q1_back~0_701 4) v_~q1~0.offset_445))) 1 0)) (= (+ v_~q1_back~0_701 1) v_~q1_back~0_700) (< v_~j~0_661 v_~N~0_434) (not (= (ite (and (<= 0 v_~q1_back~0_701) (< v_~q1_back~0_701 v_~n1~0_422)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511| 0)))) InVars {~q1~0.offset=v_~q1~0.offset_445, ~n2~0=v_~n2~0_446, ~q1_back~0=v_~q1_back~0_701, ~i~0=v_~i~0_590, ~n1~0=v_~n1~0_422, ~q2~0.offset=v_~q2~0.offset_450, ~q1~0.base=v_~q1~0.base_445, #memory_int=|v_#memory_int_811|, ~q2_front~0=v_~q2_front~0_692, ~q2~0.base=v_~q2~0.base_450, ~N~0=v_~N~0_434, ~q2_back~0=v_~q2_back~0_684} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_258|, ~j~0=v_~j~0_661, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_354|, ~q1~0.offset=v_~q1~0.offset_445, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_348|, ~n2~0=v_~n2~0_446, ~i~0=v_~i~0_590, ~n1~0=v_~n1~0_422, ~q2~0.offset=v_~q2~0.offset_450, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_290|, ~q2_front~0=v_~q2_front~0_691, ~N~0=v_~N~0_434, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_290|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_348|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|, ~q1_back~0=v_~q1_back~0_700, ~q1~0.base=v_~q1~0.base_445, #memory_int=|v_#memory_int_811|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511|, ~q2~0.base=v_~q2~0.base_450, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_258|, ~q2_back~0=v_~q2_back~0_683} 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 [923] L52-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_805| v_~q2~0.base_444))) (and (= (+ v_~q2_back~0_672 1) v_~q2_back~0_671) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_503| 0)) (not (= (ite (and (< v_~q2_back~0_672 v_~n2~0_440) (<= 0 v_~q2_back~0_672)) 1 0) 0)) (< v_~i~0_582 v_~N~0_428) (= v_~j~0_653 (+ (select .cse0 (+ (* v_~q2_front~0_680 4) v_~q2~0.offset_444)) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_503| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_503|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_507| 0)) (= (ite (= (select .cse0 (+ v_~q2~0.offset_444 (* 4 v_~q2_back~0_672))) v_~i~0_582) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_503|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_507| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_507|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_507| (ite (and (< v_~q2_front~0_680 v_~q2_back~0_671) (< v_~q2_front~0_680 v_~n2~0_440) (<= 0 v_~q2_front~0_680)) 1 0)) (= (+ v_~q1_front~0_653 1) v_~q1_front~0_652) (not (= (ite (and (< v_~q1_front~0_653 v_~q1_back~0_692) (<= 0 v_~q1_front~0_653) (< v_~q1_front~0_653 v_~n1~0_418)) 1 0) 0)) (= (+ v_~q2_front~0_680 1) v_~q2_front~0_679) (= (+ (select (select |v_#memory_int_805| v_~q1~0.base_441) (+ v_~q1~0.offset_441 (* v_~q1_front~0_653 4))) 1) v_~i~0_582))) InVars {~q1~0.offset=v_~q1~0.offset_441, ~n2~0=v_~n2~0_440, ~q1_front~0=v_~q1_front~0_653, ~q1_back~0=v_~q1_back~0_692, ~q2~0.offset=v_~q2~0.offset_444, ~n1~0=v_~n1~0_418, ~q1~0.base=v_~q1~0.base_441, #memory_int=|v_#memory_int_805|, ~q2_front~0=v_~q2_front~0_680, ~q2~0.base=v_~q2~0.base_444, ~N~0=v_~N~0_428, ~q2_back~0=v_~q2_back~0_672} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_252|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_348|, ~j~0=v_~j~0_653, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_342|, ~q1_front~0=v_~q1_front~0_652, ~q2~0.offset=v_~q2~0.offset_444, ~n1~0=v_~n1~0_418, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_507|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_342|, ~q1_back~0=v_~q1_back~0_692, ~q1~0.base=v_~q1~0.base_441, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_503|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_332|, ~q2~0.base=v_~q2~0.base_444, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_326|, ~q2_back~0=v_~q2_back~0_671, ~q1~0.offset=v_~q1~0.offset_441, ~n2~0=v_~n2~0_440, ~i~0=v_~i~0_582, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_326|, ~q2_front~0=v_~q2_front~0_679, ~N~0=v_~N~0_428, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_507|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_503|, #memory_int=|v_#memory_int_805|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_252|} 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~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#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-06 00:32:38,180 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:38,180 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:38,180 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:38,180 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:38,180 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:38,180 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:38,180 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:38,180 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:38,180 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:38,180 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:39,666 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:39,667 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:39,667 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:39,667 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:39,667 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:39,667 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:42,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L65-1-->L52: Formula: (let ((.cse0 (+ v_~q2_front~0_648 1)) (.cse2 (select |v_#memory_int_781| v_~q1~0.base_427)) (.cse1 (select |v_#memory_int_781| v_~q2~0.base_426))) (and (not (= (ite (and (<= 1 v_~q2_back~0_635) (< v_~q2_back~0_635 (+ v_~n2~0_422 1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_472| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_483| (ite (and (<= 0 v_~q2_front~0_648) (< .cse0 v_~q2_back~0_635) (< v_~q2_front~0_648 v_~n2~0_422)) 1 0)) (= (+ 2 v_~q2_back~0_637) v_~q2_back~0_635) (= (+ v_~q1_front~0_625 1) v_~q1_front~0_624) (= .cse0 v_~q2_front~0_647) (= (ite (= (select .cse1 (+ v_~q2~0.offset_426 (- 4) (* 4 v_~q2_back~0_635))) v_~i~0_557) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_472|) (not (= (ite (and (<= 0 v_~q1_front~0_625) (< v_~q1_front~0_625 v_~n1~0_404) (< v_~q1_front~0_625 v_~q1_back~0_668)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_483| 0)) (not (= (ite (= v_~j~0_630 (select .cse2 (+ v_~q1~0.offset_427 (* v_~q1_back~0_669 4)))) 1 0) 0)) (< v_~i~0_557 v_~N~0_410) (= (+ v_~q1_back~0_669 1) v_~q1_back~0_668) (= (+ 1 (select .cse2 (+ v_~q1~0.offset_427 (* v_~q1_front~0_625 4)))) v_~i~0_557) (< v_~j~0_630 v_~N~0_410) (< v_~i~0_558 v_~N~0_410) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_483| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_483|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_472| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_472|) (= v_~j~0_629 (+ (select .cse1 (+ v_~q2~0.offset_426 (* v_~q2_front~0_648 4))) 1)) (not (= (ite (and (<= 0 v_~q1_back~0_669) (< v_~q1_back~0_669 v_~n1~0_404)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ (* 4 v_~q2_back~0_637) v_~q2~0.offset_426)) v_~i~0_558) 1 0) 0)))) InVars {~j~0=v_~j~0_630, ~q1~0.offset=v_~q1~0.offset_427, ~n2~0=v_~n2~0_422, ~q1_front~0=v_~q1_front~0_625, ~i~0=v_~i~0_558, ~q2~0.offset=v_~q2~0.offset_426, ~n1~0=v_~n1~0_404, ~q2_front~0=v_~q2_front~0_648, ~N~0=v_~N~0_410, ~q1_back~0=v_~q1_back~0_669, ~q1~0.base=v_~q1~0.base_427, #memory_int=|v_#memory_int_781|, ~q2~0.base=v_~q2~0.base_426, ~q2_back~0=v_~q2_back~0_637} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_233|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_329|, ~j~0=v_~j~0_629, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_323|, ~q1_front~0=v_~q1_front~0_624, ~q2~0.offset=v_~q2~0.offset_426, ~n1~0=v_~n1~0_404, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_483|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_323|, ~q1_back~0=v_~q1_back~0_668, ~q1~0.base=v_~q1~0.base_427, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_472|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_315|, ~q2~0.base=v_~q2~0.base_426, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_309|, ~q2_back~0=v_~q2_back~0_635, ~q1~0.offset=v_~q1~0.offset_427, ~n2~0=v_~n2~0_422, ~i~0=v_~i~0_557, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_309|, ~q2_front~0=v_~q2_front~0_647, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_275|, ~N~0=v_~N~0_410, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_275|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_483|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_472|, #memory_int=|v_#memory_int_781|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_233|} 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 [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-06 00:32:43,262 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-06 00:32:43,339 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:43,339 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:43,451 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:43,451 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:43,451 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:43,451 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:43,451 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:43,452 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:32:44,502 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L65-1-->L47-1: Formula: (let ((.cse2 (select |v_#memory_int_833| v_~q1~0.base_467))) (let ((.cse3 (* v_~q1_back~0_747 4)) (.cse0 (+ (select .cse2 (+ (* v_~q1_front~0_690 4) v_~q1~0.offset_467)) 1)) (.cse1 (select |v_#memory_int_833| v_~q2~0.base_470)) (.cse4 (+ v_~q2_front~0_738 1))) (and (= (+ 2 v_~q2_back~0_729) v_~q2_back~0_727) (< v_~j~0_701 v_~N~0_456) (< .cse0 v_~N~0_456) (not (= (ite (= (select .cse1 (+ v_~q2~0.offset_470 (* 4 v_~q2_back~0_729))) v_~i~0_622) 1 0) 0)) (not (= (ite (= v_~j~0_702 (select .cse2 (+ v_~q1~0.offset_467 .cse3))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_553| (ite (= v_~j~0_701 (select .cse2 (+ v_~q1~0.offset_467 .cse3 4))) 1 0)) (< v_~i~0_622 v_~N~0_456) (= v_~q2_front~0_737 .cse4) (not (= (ite (= (select .cse1 (+ v_~q2~0.offset_470 (- 4) (* 4 v_~q2_back~0_727))) .cse0) 1 0) 0)) (< v_~j~0_702 v_~N~0_456) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_553| 0)) (not (= (ite (and (< v_~q1_front~0_690 v_~q1_back~0_746) (<= 0 v_~q1_front~0_690) (< v_~q1_front~0_690 v_~n1~0_444)) 1 0) 0)) (= (+ 2 v_~q1_back~0_747) v_~q1_back~0_746) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_541|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_553| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_553|) (not (= (ite (let ((.cse5 (+ v_~q1_back~0_747 1))) (and (<= 0 .cse5) (< .cse5 v_~n1~0_444))) 1 0) 0)) (= v_~q1_front~0_688 (+ 2 v_~q1_front~0_690)) (= v_~j~0_701 (+ (select .cse1 (+ v_~q2~0.offset_470 (* v_~q2_front~0_738 4))) 1)) (= (+ (select .cse2 (+ (* v_~q1_front~0_688 4) v_~q1~0.offset_467 (- 4))) 1) v_~i~0_620) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_541| 0)) (not (= (ite (and (<= 1 v_~q2_back~0_727) (< v_~q2_back~0_727 (+ v_~n2~0_466 1))) 1 0) 0)) (= (ite (and (< v_~q1_front~0_688 (+ v_~q1_back~0_746 1)) (<= 1 v_~q1_front~0_688) (< v_~q1_front~0_688 (+ v_~n1~0_444 1))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541|) (not (= (ite (and (< .cse4 v_~q2_back~0_727) (<= 0 v_~q2_front~0_738) (< v_~q2_front~0_738 v_~n2~0_466)) 1 0) 0))))) InVars {~j~0=v_~j~0_702, ~q1~0.offset=v_~q1~0.offset_467, ~q1_front~0=v_~q1_front~0_690, ~n2~0=v_~n2~0_466, ~i~0=v_~i~0_622, ~n1~0=v_~n1~0_444, ~q2~0.offset=v_~q2~0.offset_470, ~q2_front~0=v_~q2_front~0_738, ~N~0=v_~N~0_456, ~q1_back~0=v_~q1_back~0_747, ~q1~0.base=v_~q1~0.base_467, #memory_int=|v_#memory_int_833|, ~q2~0.base=v_~q2~0.base_470, ~q2_back~0=v_~q2_back~0_729} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_282|, ~j~0=v_~j~0_701, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_382|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_376|, ~q1_front~0=v_~q1_front~0_688, ~n1~0=v_~n1~0_444, ~q2~0.offset=v_~q2~0.offset_470, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_553|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_376|, ~q1_back~0=v_~q1_back~0_746, ~q1~0.base=v_~q1~0.base_467, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_350|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_541|, ~q2~0.base=v_~q2~0.base_470, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_344|, ~q2_back~0=v_~q2_back~0_727, ~q1~0.offset=v_~q1~0.offset_467, ~n2~0=v_~n2~0_466, ~i~0=v_~i~0_620, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_344|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_314|, ~q2_front~0=v_~q2_front~0_737, ~N~0=v_~N~0_456, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_314|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_553|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_541|, #memory_int=|v_#memory_int_833|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_282|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#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_#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-06 00:32:44,976 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [932] L65-1-->L70: Formula: (let ((.cse0 (+ v_~q1_front~0_665 1)) (.cse1 (select |v_#memory_int_819| v_~q2~0.base_456)) (.cse2 (select |v_#memory_int_819| v_~q1~0.base_453))) (and (not (= (ite (and (< v_~q2_front~0_700 v_~n2~0_452) (< v_~q2_front~0_700 v_~q2_back~0_693) (<= 0 v_~q2_front~0_700)) 1 0) 0)) (= v_~q2_front~0_699 (+ v_~q2_front~0_700 1)) (not (= 0 (ite (and (<= 1 v_~q1_back~0_716) (< v_~q1_back~0_716 (+ v_~n1~0_430 1))) 1 0))) (= (+ v_~q2_back~0_694 1) v_~q2_back~0_693) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_527| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_527|) (< v_~i~0_596 v_~N~0_442) (= v_~q1_front~0_664 .cse0) (< v_~j~0_672 v_~N~0_442) (not (= (ite (and (< v_~q1_front~0_665 v_~n1~0_430) (<= 0 v_~q1_front~0_665) (< .cse0 v_~q1_back~0_716)) 1 0) 0)) (not (= (ite (and (<= 0 v_~q2_back~0_694) (< v_~q2_back~0_694 v_~n2~0_452)) 1 0) 0)) (= (ite (= (select .cse1 (+ v_~q2~0.offset_456 (* 4 v_~q2_back~0_694))) v_~i~0_596) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_517|) (= v_~i~0_596 (+ (select .cse2 (+ (* v_~q1_front~0_665 4) v_~q1~0.offset_453)) 1)) (= v_~j~0_671 (+ (select .cse1 (+ (* v_~q2_front~0_700 4) v_~q2~0.offset_456)) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_527| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_527| (ite (= v_~j~0_671 (select .cse2 (+ v_~q1~0.offset_453 (- 4) (* v_~q1_back~0_716 4)))) 1 0)) (= (+ 2 v_~q1_back~0_718) v_~q1_back~0_716) (< v_~j~0_671 v_~N~0_442) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_517| 0)) (not (= (ite (= v_~j~0_672 (select .cse2 (+ v_~q1~0.offset_453 (* v_~q1_back~0_718 4)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_517| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_517|))) InVars {~j~0=v_~j~0_672, ~q1~0.offset=v_~q1~0.offset_453, ~q1_front~0=v_~q1_front~0_665, ~n2~0=v_~n2~0_452, ~n1~0=v_~n1~0_430, ~q2~0.offset=v_~q2~0.offset_456, ~q2_front~0=v_~q2_front~0_700, ~N~0=v_~N~0_442, ~q1_back~0=v_~q1_back~0_718, ~q1~0.base=v_~q1~0.base_453, #memory_int=|v_#memory_int_819|, ~q2~0.base=v_~q2~0.base_456, ~q2_back~0=v_~q2_back~0_694} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_262|, ~j~0=v_~j~0_671, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_358|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_352|, ~q1_front~0=v_~q1_front~0_664, ~n1~0=v_~n1~0_430, ~q2~0.offset=v_~q2~0.offset_456, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_527|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_352|, ~q1_back~0=v_~q1_back~0_716, ~q1~0.base=v_~q1~0.base_453, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_517|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_338|, ~q2~0.base=v_~q2~0.base_456, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_332|, ~q2_back~0=v_~q2_back~0_693, ~q1~0.offset=v_~q1~0.offset_453, ~n2~0=v_~n2~0_452, ~i~0=v_~i~0_596, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_332|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_298|, ~q2_front~0=v_~q2_front~0_699, ~N~0=v_~N~0_442, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_298|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_527|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_517|, #memory_int=|v_#memory_int_819|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_262|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#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~post5#1, thread1Thread1of1ForFork0_#t~mem3#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-06 00:32:45,607 INFO L203 LiptonReduction]: Total number of compositions: 19 [2022-12-06 00:32:45,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10278 [2022-12-06 00:32:45,608 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 324 transitions, 12728 flow [2022-12-06 00:32:45,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:45,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:45,608 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:45,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 00:32:45,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:45,814 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:32:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1300440162, now seen corresponding path program 1 times [2022-12-06 00:32:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:45,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802718057] [2022-12-06 00:32:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:45,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:46,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:46,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802718057] [2022-12-06 00:32:46,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802718057] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:46,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631559837] [2022-12-06 00:32:46,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:46,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:46,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:46,763 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:32:46,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 00:32:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:46,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 00:32:46,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:46,951 INFO L321 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2022-12-06 00:32:46,951 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 2 case distinctions, treesize of input 12 treesize of output 23 [2022-12-06 00:32:47,005 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-06 00:32:47,006 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 16 treesize of output 18 [2022-12-06 00:32:47,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 14 treesize of output 14 [2022-12-06 00:32:47,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:32:47,069 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-06 00:32:47,146 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 54 treesize of output 20 [2022-12-06 00:32:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:47,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:47,341 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (* c_~q1_front~0 4)) (.cse1 (* c_~q1_back~0 4))) (and (forall ((v_ArrVal_2602 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2602))) (or (forall ((~q1~0.offset Int)) (let ((.cse0 (select .cse3 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse0 (+ .cse1 ~q1~0.offset)))) (< (+ (select .cse0 (+ .cse2 ~q1~0.offset)) 1) c_~N~0)))) (< (select (select .cse3 c_~q2~0.base) .cse4) c_~N~0)))) (forall ((v_ArrVal_2602 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2602))) (or (< (+ (select (select .cse5 c_~q2~0.base) .cse4) 1) c_~N~0) (forall ((~q1~0.offset Int)) (let ((.cse6 (select .cse5 c_~q1~0.base))) (or (< (select .cse6 (+ .cse2 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse6 (+ .cse1 ~q1~0.offset)))))))))))) is different from false [2022-12-06 00:32:47,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:32:47,440 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 1 case distinctions, treesize of input 177 treesize of output 129 [2022-12-06 00:32:47,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:32:47,507 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 522 treesize of output 686 [2022-12-06 00:32:47,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:32:47,533 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 443 treesize of output 444 [2022-12-06 00:32:47,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:32:47,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 426 treesize of output 582 [2022-12-06 00:32:47,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:32:47,670 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 367 treesize of output 376 Received shutdown request... [2022-12-06 00:41:00,984 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 00:41:00,985 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 00:41:00,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 00:41:00,995 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 00:41:00,995 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 00:41:01,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-06 00:41:01,188 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 27ms.. [2022-12-06 00:41:01,201 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 00:41:01,201 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 00:41:01,201 INFO L458 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, 1, 1, 1, 1, 1, 1] [2022-12-06 00:41:01,203 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:41:01,203 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:41:01,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:41:01 BasicIcfg [2022-12-06 00:41:01,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:41:01,205 INFO L158 Benchmark]: Toolchain (without parser) took 836162.29ms. Allocated memory was 200.3MB in the beginning and 987.8MB in the end (delta: 787.5MB). Free memory was 176.7MB in the beginning and 465.1MB in the end (delta: -288.3MB). Peak memory consumption was 636.4MB. Max. memory is 8.0GB. [2022-12-06 00:41:01,205 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory is still 176.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:41:01,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.67ms. Allocated memory is still 200.3MB. Free memory was 176.2MB in the beginning and 163.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 00:41:01,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.73ms. Allocated memory is still 200.3MB. Free memory was 163.8MB in the beginning and 161.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:41:01,205 INFO L158 Benchmark]: Boogie Preprocessor took 20.13ms. Allocated memory is still 200.3MB. Free memory was 161.8MB in the beginning and 160.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:41:01,205 INFO L158 Benchmark]: RCFGBuilder took 587.06ms. Allocated memory is still 200.3MB. Free memory was 159.7MB in the beginning and 131.9MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 00:41:01,205 INFO L158 Benchmark]: TraceAbstraction took 835312.67ms. Allocated memory was 200.3MB in the beginning and 987.8MB in the end (delta: 787.5MB). Free memory was 131.4MB in the beginning and 465.1MB in the end (delta: -333.7MB). Peak memory consumption was 591.3MB. Max. memory is 8.0GB. [2022-12-06 00:41:01,206 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory is still 176.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.67ms. Allocated memory is still 200.3MB. Free memory was 176.2MB in the beginning and 163.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.73ms. Allocated memory is still 200.3MB. Free memory was 163.8MB in the beginning and 161.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.13ms. Allocated memory is still 200.3MB. Free memory was 161.8MB in the beginning and 160.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 587.06ms. Allocated memory is still 200.3MB. Free memory was 159.7MB in the beginning and 131.9MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 835312.67ms. Allocated memory was 200.3MB in the beginning and 987.8MB in the end (delta: 787.5MB). Free memory was 131.4MB in the beginning and 465.1MB in the end (delta: -333.7MB). Peak memory consumption was 591.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 294, independent: 286, independent conditional: 0, independent unconditional: 286, 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: 294, independent: 283, independent conditional: 0, independent unconditional: 283, 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: 36, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 294, unknown conditional: 0, unknown unconditional: 294] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 469, Positive conditional cache size: 0, Positive unconditional cache size: 469, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 2, dependent unconditional: 5, 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: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 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): 15, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.1s, 76 PlacesBefore, 70 PlacesAfterwards, 108 TransitionsBefore, 102 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 13, independent conditional: 8, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 20, Positive conditional cache size: 10, Positive unconditional cache size: 10, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 103 PlacesBefore, 97 PlacesAfterwards, 230 TransitionsBefore, 224 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 10 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 56, independent conditional: 49, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 49, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 11, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 56, independent: 42, independent conditional: 38, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 11, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 40, Positive conditional cache size: 21, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 191 TransitionsBefore, 191 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 40, Positive conditional cache size: 21, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 418 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 40, Positive conditional cache size: 21, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 40, Positive conditional cache size: 21, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 81 PlacesBefore, 81 PlacesAfterwards, 148 TransitionsBefore, 148 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 44, Positive conditional cache size: 25, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 107 PlacesBefore, 103 PlacesAfterwards, 175 TransitionsBefore, 171 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 8, independent: 5, independent conditional: 2, independent unconditional: 3, 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): 53, Positive cache size: 47, Positive conditional cache size: 28, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 109 PlacesBefore, 109 PlacesAfterwards, 178 TransitionsBefore, 177 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 9, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 9, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 15, independent: 12, independent conditional: 6, independent unconditional: 6, 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): 60, Positive cache size: 54, Positive conditional cache size: 31, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 54, Positive conditional cache size: 31, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 108 PlacesBefore, 106 PlacesAfterwards, 175 TransitionsBefore, 173 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 10, independent: 9, independent conditional: 9, 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): 66, Positive cache size: 60, Positive conditional cache size: 32, Positive unconditional cache size: 28, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 118 PlacesBefore, 115 PlacesAfterwards, 182 TransitionsBefore, 179 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 25, independent conditional: 22, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 22, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 25, independent: 19, independent conditional: 18, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 78, Positive conditional cache size: 36, Positive unconditional cache size: 42, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 105 PlacesBefore, 105 PlacesAfterwards, 182 TransitionsBefore, 182 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 78, Positive conditional cache size: 36, Positive unconditional cache size: 42, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 102 PlacesBefore, 100 PlacesAfterwards, 176 TransitionsBefore, 174 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 78, Positive conditional cache size: 36, Positive unconditional cache size: 42, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 151 TransitionsBefore, 151 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 78, Positive conditional cache size: 36, Positive unconditional cache size: 42, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 107 PlacesBefore, 106 PlacesAfterwards, 152 TransitionsBefore, 151 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 80, Positive conditional cache size: 36, Positive unconditional cache size: 44, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 157 TransitionsBefore, 157 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 80, Positive conditional cache size: 36, Positive unconditional cache size: 44, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 157 TransitionsBefore, 157 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 80, Positive conditional cache size: 36, Positive unconditional cache size: 44, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 122 PlacesBefore, 118 PlacesAfterwards, 157 TransitionsBefore, 154 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 92, Positive conditional cache size: 40, Positive unconditional cache size: 52, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 150 TransitionsBefore, 150 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 92, Positive conditional cache size: 40, Positive unconditional cache size: 52, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 119 PlacesBefore, 117 PlacesAfterwards, 172 TransitionsBefore, 170 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 93, Positive conditional cache size: 41, Positive unconditional cache size: 52, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 142 TransitionsBefore, 142 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 93, Positive conditional cache size: 41, Positive unconditional cache size: 52, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 132 PlacesBefore, 130 PlacesAfterwards, 211 TransitionsBefore, 209 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 100, Positive conditional cache size: 42, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 150 PlacesBefore, 150 PlacesAfterwards, 225 TransitionsBefore, 225 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 109, Positive cache size: 103, Positive conditional cache size: 45, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.1s, 173 PlacesBefore, 169 PlacesAfterwards, 234 TransitionsBefore, 231 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 11, independent: 10, independent conditional: 10, 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): 126, Positive cache size: 120, Positive conditional cache size: 46, Positive unconditional cache size: 74, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.6s, 179 PlacesBefore, 175 PlacesAfterwards, 227 TransitionsBefore, 223 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 18, independent: 15, independent conditional: 15, 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): 131, Positive cache size: 125, Positive conditional cache size: 49, Positive unconditional cache size: 76, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 174 PlacesBefore, 170 PlacesAfterwards, 217 TransitionsBefore, 214 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 7, independent: 5, independent conditional: 5, 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): 138, Positive cache size: 132, Positive conditional cache size: 51, Positive unconditional cache size: 81, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 174 PlacesBefore, 172 PlacesAfterwards, 213 TransitionsBefore, 212 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 132, Positive conditional cache size: 51, Positive unconditional cache size: 81, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 179 PlacesBefore, 176 PlacesAfterwards, 234 TransitionsBefore, 231 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 136, Positive conditional cache size: 55, Positive unconditional cache size: 81, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 166 PlacesBefore, 166 PlacesAfterwards, 240 TransitionsBefore, 240 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 136, Positive conditional cache size: 55, Positive unconditional cache size: 81, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 177 PlacesBefore, 175 PlacesAfterwards, 250 TransitionsBefore, 248 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 2, independent unconditional: 1, 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): 146, Positive cache size: 140, Positive conditional cache size: 57, Positive unconditional cache size: 83, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 177 PlacesBefore, 177 PlacesAfterwards, 247 TransitionsBefore, 247 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 140, Positive conditional cache size: 57, Positive unconditional cache size: 83, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 183 PlacesBefore, 182 PlacesAfterwards, 250 TransitionsBefore, 249 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 141, Positive conditional cache size: 57, Positive unconditional cache size: 84, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 183 PlacesBefore, 182 PlacesAfterwards, 248 TransitionsBefore, 247 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 2, 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): 148, Positive cache size: 142, Positive conditional cache size: 57, Positive unconditional cache size: 85, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 186 PlacesBefore, 186 PlacesAfterwards, 244 TransitionsBefore, 244 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 142, Positive conditional cache size: 57, Positive unconditional cache size: 85, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 199 PlacesBefore, 199 PlacesAfterwards, 256 TransitionsBefore, 256 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 143, Positive conditional cache size: 58, Positive unconditional cache size: 85, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 219 PlacesBefore, 219 PlacesAfterwards, 272 TransitionsBefore, 272 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 145, Positive conditional cache size: 60, Positive unconditional cache size: 85, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 225 PlacesBefore, 225 PlacesAfterwards, 269 TransitionsBefore, 269 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 145, Positive conditional cache size: 60, Positive unconditional cache size: 85, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.1s, 262 PlacesBefore, 247 PlacesAfterwards, 339 TransitionsBefore, 324 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 18 ConcurrentYvCompositions, 0 ChoiceCompositions, 19 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 169, Positive conditional cache size: 74, Positive unconditional cache size: 95, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 27ms.. - 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 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 27ms.. - 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 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 27ms.. - 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: 835.2s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 129.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 211 mSolverCounterUnknown, 4358 SdHoareTripleChecker+Valid, 36.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4358 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 33.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 191 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21878 IncrementalHoareTripleChecker+Invalid, 24616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2336 mSolverCounterUnsat, 0 mSDtfsCounter, 21878 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1382 GetRequests, 449 SyntacticMatches, 34 SemanticMatches, 899 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5121 ImplicationChecksByTransitivity, 99.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12787occurred in iteration=45, InterpolantAutomatonStates: 625, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 118.5s InterpolantComputationTime, 1022 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 1311 ConstructedInterpolants, 101 QuantifiedInterpolants, 52271 SizeOfPredicates, 609 NumberOfNonLiveVariables, 7454 ConjunctsInSsa, 1292 ConjunctsInUnsatCore, 107 InterpolantComputations, 15 PerfectInterpolantSequences, 25/171 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