/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:35:04,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:35:04,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:35:04,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:35:04,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:35:04,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:35:04,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:35:04,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:35:04,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:35:04,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:35:04,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:35:04,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:35:04,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:35:04,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:35:04,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:35:04,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:35:04,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:35:04,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:35:04,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:35:04,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:35:04,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:35:04,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:35:04,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:35:04,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:35:04,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:35:04,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:35:04,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:35:04,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:35:04,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:35:04,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:35:04,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:35:04,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:35:04,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:35:04,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:35:04,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:35:04,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:35:04,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:35:04,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:35:04,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:35:04,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:35:04,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:35:04,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:35:04,851 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:35:04,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:35:04,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:35:04,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:35:04,853 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:35:04,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:35:04,854 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:35:04,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:35:04,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:35:04,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:35:04,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:35:04,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:35:04,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:35:04,855 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:35:04,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:35:04,855 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:35:04,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:35:04,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:35:04,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:35:04,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:35:04,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:35:04,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:35:04,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:35:04,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:35:04,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:35:04,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:35:04,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:35:04,856 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:35:04,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:35:05,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:35:05,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:35:05,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:35:05,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:35:05,295 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:35:05,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2022-12-06 07:35:06,286 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:35:06,470 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:35:06,471 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2022-12-06 07:35:06,477 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e141f330/799fdb7c6eb640b99ac4506a8b4f438d/FLAG00ead95ca [2022-12-06 07:35:06,492 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e141f330/799fdb7c6eb640b99ac4506a8b4f438d [2022-12-06 07:35:06,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:35:06,495 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:35:06,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:35:06,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:35:06,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:35:06,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@418b5240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06, skipping insertion in model container [2022-12-06 07:35:06,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:35:06,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:35:06,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,663 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-bad-ring.wvr.c[3947,3960] [2022-12-06 07:35:06,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:35:06,688 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:35:06,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:35:06,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:35:06,712 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-bad-ring.wvr.c[3947,3960] [2022-12-06 07:35:06,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:35:06,726 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:35:06,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06 WrapperNode [2022-12-06 07:35:06,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:35:06,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:35:06,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:35:06,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:35:06,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,795 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 315 [2022-12-06 07:35:06,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:35:06,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:35:06,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:35:06,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:35:06,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,848 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:35:06,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:35:06,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:35:06,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:35:06,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (1/1) ... [2022-12-06 07:35:06,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:35:06,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:06,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:35:06,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:35:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:35:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:35:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:35:06,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:35:06,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:35:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:35:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:35:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:35:06,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:35:06,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:35:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:35:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:35:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:35:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:35:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:35:06,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:35:06,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:35:06,943 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:35:07,076 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:35:07,077 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:35:07,402 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:35:07,597 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:35:07,597 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 07:35:07,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:35:07 BoogieIcfgContainer [2022-12-06 07:35:07,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:35:07,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:35:07,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:35:07,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:35:07,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:35:06" (1/3) ... [2022-12-06 07:35:07,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdfd6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:35:07, skipping insertion in model container [2022-12-06 07:35:07,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:06" (2/3) ... [2022-12-06 07:35:07,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdfd6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:35:07, skipping insertion in model container [2022-12-06 07:35:07,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:35:07" (3/3) ... [2022-12-06 07:35:07,607 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2022-12-06 07:35:07,619 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:35:07,619 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:35:07,619 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:35:07,724 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:35:07,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 245 transitions, 514 flow [2022-12-06 07:35:07,905 INFO L130 PetriNetUnfolder]: 22/242 cut-off events. [2022-12-06 07:35:07,905 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:35:07,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 242 events. 22/242 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 158 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2022-12-06 07:35:07,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 245 transitions, 514 flow [2022-12-06 07:35:07,921 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 232 transitions, 482 flow [2022-12-06 07:35:07,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:07,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-06 07:35:07,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 232 transitions, 482 flow [2022-12-06 07:35:08,004 INFO L130 PetriNetUnfolder]: 22/232 cut-off events. [2022-12-06 07:35:08,004 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:35:08,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 232 events. 22/232 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 155 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2022-12-06 07:35:08,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-06 07:35:08,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-06 07:35:16,619 INFO L203 LiptonReduction]: Total number of compositions: 200 [2022-12-06 07:35:16,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:35:16,642 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;@71272d9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:35:16,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:35:16,647 INFO L130 PetriNetUnfolder]: 7/30 cut-off events. [2022-12-06 07:35:16,647 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:35:16,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:16,648 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:16,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:16,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:16,651 INFO L85 PathProgramCache]: Analyzing trace with hash -32754915, now seen corresponding path program 1 times [2022-12-06 07:35:16,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:16,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066554414] [2022-12-06 07:35:16,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:16,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:16,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:16,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066554414] [2022-12-06 07:35:16,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066554414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:16,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:16,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:35:16,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302141629] [2022-12-06 07:35:16,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:16,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:35:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:16,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:35:16,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:35:16,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:35:16,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:16,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:35:16,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:17,179 INFO L130 PetriNetUnfolder]: 472/690 cut-off events. [2022-12-06 07:35:17,180 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 07:35:17,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 690 events. 472/690 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2132 event pairs, 135 based on Foata normal form. 30/575 useless extension candidates. Maximal degree in co-relation 1216. Up to 449 conditions per place. [2022-12-06 07:35:17,201 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-06 07:35:17,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 196 flow [2022-12-06 07:35:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:35:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:35:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 07:35:17,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2022-12-06 07:35:17,212 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 80 flow. Second operand 3 states and 47 transitions. [2022-12-06 07:35:17,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 196 flow [2022-12-06 07:35:17,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:35:17,216 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 87 flow [2022-12-06 07:35:17,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2022-12-06 07:35:17,219 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 07:35:17,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:17,220 INFO L89 Accepts]: Start accepts. Operand has 31 places, 32 transitions, 87 flow [2022-12-06 07:35:17,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:17,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:17,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 32 transitions, 87 flow [2022-12-06 07:35:17,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 32 transitions, 87 flow [2022-12-06 07:35:17,231 INFO L130 PetriNetUnfolder]: 14/43 cut-off events. [2022-12-06 07:35:17,231 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:35:17,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 43 events. 14/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 45. Up to 17 conditions per place. [2022-12-06 07:35:17,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 32 transitions, 87 flow [2022-12-06 07:35:17,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 07:35:17,246 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:17,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 07:35:17,247 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 87 flow [2022-12-06 07:35:17,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:17,247 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:17,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:35:17,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2034944899, now seen corresponding path program 1 times [2022-12-06 07:35:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:17,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315366958] [2022-12-06 07:35:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:17,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:17,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:17,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315366958] [2022-12-06 07:35:17,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315366958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:17,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:17,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:35:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609414965] [2022-12-06 07:35:17,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:17,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:17,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:17,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:17,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:35:17,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:17,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:35:17,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:17,544 INFO L130 PetriNetUnfolder]: 529/810 cut-off events. [2022-12-06 07:35:17,545 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-06 07:35:17,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 810 events. 529/810 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2610 event pairs, 371 based on Foata normal form. 52/712 useless extension candidates. Maximal degree in co-relation 753. Up to 691 conditions per place. [2022-12-06 07:35:17,548 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 31 selfloop transitions, 2 changer transitions 27/60 dead transitions. [2022-12-06 07:35:17,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 60 transitions, 269 flow [2022-12-06 07:35:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:35:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:35:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 07:35:17,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2022-12-06 07:35:17,550 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 87 flow. Second operand 5 states and 64 transitions. [2022-12-06 07:35:17,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 60 transitions, 269 flow [2022-12-06 07:35:17,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:35:17,551 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 114 flow [2022-12-06 07:35:17,552 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2022-12-06 07:35:17,552 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-06 07:35:17,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:17,552 INFO L89 Accepts]: Start accepts. Operand has 37 places, 33 transitions, 114 flow [2022-12-06 07:35:17,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:17,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:17,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 33 transitions, 114 flow [2022-12-06 07:35:17,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 114 flow [2022-12-06 07:35:17,559 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-06 07:35:17,560 INFO L131 PetriNetUnfolder]: For 7/13 co-relation queries the response was YES. [2022-12-06 07:35:17,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 62 events. 22/62 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 146 event pairs, 4 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 19 conditions per place. [2022-12-06 07:35:17,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 114 flow [2022-12-06 07:35:17,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 07:35:18,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:18,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1404 [2022-12-06 07:35:18,957 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 110 flow [2022-12-06 07:35:18,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:18,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:18,957 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:18,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:35:18,957 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:18,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash 602269161, now seen corresponding path program 1 times [2022-12-06 07:35:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:18,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317036431] [2022-12-06 07:35:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:18,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:19,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:19,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317036431] [2022-12-06 07:35:19,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317036431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:19,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:19,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401263531] [2022-12-06 07:35:19,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:19,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:19,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:19,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:19,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:19,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:35:19,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:19,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:35:19,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:19,186 INFO L130 PetriNetUnfolder]: 759/1166 cut-off events. [2022-12-06 07:35:19,186 INFO L131 PetriNetUnfolder]: For 637/637 co-relation queries the response was YES. [2022-12-06 07:35:19,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3190 conditions, 1166 events. 759/1166 cut-off events. For 637/637 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4329 event pairs, 563 based on Foata normal form. 56/1039 useless extension candidates. Maximal degree in co-relation 3178. Up to 691 conditions per place. [2022-12-06 07:35:19,190 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 2 changer transitions 35/68 dead transitions. [2022-12-06 07:35:19,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 68 transitions, 358 flow [2022-12-06 07:35:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:35:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:35:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 07:35:19,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 07:35:19,191 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 110 flow. Second operand 5 states and 70 transitions. [2022-12-06 07:35:19,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 68 transitions, 358 flow [2022-12-06 07:35:19,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 68 transitions, 336 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 07:35:19,193 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 118 flow [2022-12-06 07:35:19,193 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-06 07:35:19,194 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 07:35:19,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:19,194 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 118 flow [2022-12-06 07:35:19,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:19,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:19,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 118 flow [2022-12-06 07:35:19,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 118 flow [2022-12-06 07:35:19,227 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-06 07:35:19,228 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-06 07:35:19,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 62 events. 22/62 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 144 event pairs, 4 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 17 conditions per place. [2022-12-06 07:35:19,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 33 transitions, 118 flow [2022-12-06 07:35:19,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 07:35:19,472 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:19,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-06 07:35:19,473 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 114 flow [2022-12-06 07:35:19,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:19,474 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:19,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:35:19,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1216932410, now seen corresponding path program 1 times [2022-12-06 07:35:19,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:19,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824493309] [2022-12-06 07:35:19,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:19,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:19,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:19,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824493309] [2022-12-06 07:35:19,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824493309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:19,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:19,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:19,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031228304] [2022-12-06 07:35:19,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:19,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:19,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:19,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:19,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:19,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:35:19,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:19,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:35:19,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:19,749 INFO L130 PetriNetUnfolder]: 797/1197 cut-off events. [2022-12-06 07:35:19,749 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-12-06 07:35:19,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3572 conditions, 1197 events. 797/1197 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4404 event pairs, 586 based on Foata normal form. 70/1030 useless extension candidates. Maximal degree in co-relation 3554. Up to 691 conditions per place. [2022-12-06 07:35:19,754 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 2 changer transitions 21/54 dead transitions. [2022-12-06 07:35:19,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 301 flow [2022-12-06 07:35:19,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 07:35:19,755 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2022-12-06 07:35:19,755 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 114 flow. Second operand 4 states and 53 transitions. [2022-12-06 07:35:19,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 301 flow [2022-12-06 07:35:19,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 261 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-06 07:35:19,759 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 108 flow [2022-12-06 07:35:19,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2022-12-06 07:35:19,760 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-06 07:35:19,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:19,761 INFO L89 Accepts]: Start accepts. Operand has 36 places, 33 transitions, 108 flow [2022-12-06 07:35:19,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:19,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:19,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 108 flow [2022-12-06 07:35:19,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 108 flow [2022-12-06 07:35:19,769 INFO L130 PetriNetUnfolder]: 38/84 cut-off events. [2022-12-06 07:35:19,769 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 07:35:19,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 84 events. 38/84 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 208 event pairs, 10 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 160. Up to 33 conditions per place. [2022-12-06 07:35:19,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 108 flow [2022-12-06 07:35:19,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 07:35:19,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:20,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 07:35:20,000 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 104 flow [2022-12-06 07:35:20,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:20,000 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:20,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:35:20,000 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:20,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash -582879671, now seen corresponding path program 1 times [2022-12-06 07:35:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:20,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324074836] [2022-12-06 07:35:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:20,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324074836] [2022-12-06 07:35:20,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324074836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:20,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:20,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109306911] [2022-12-06 07:35:20,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:20,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:35:20,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:20,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:35:20,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:35:20,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:35:20,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 104 flow. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:20,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:35:20,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:20,309 INFO L130 PetriNetUnfolder]: 839/1226 cut-off events. [2022-12-06 07:35:20,310 INFO L131 PetriNetUnfolder]: For 361/361 co-relation queries the response was YES. [2022-12-06 07:35:20,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3364 conditions, 1226 events. 839/1226 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4517 event pairs, 317 based on Foata normal form. 1/961 useless extension candidates. Maximal degree in co-relation 3344. Up to 645 conditions per place. [2022-12-06 07:35:20,314 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 46 selfloop transitions, 2 changer transitions 6/54 dead transitions. [2022-12-06 07:35:20,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 285 flow [2022-12-06 07:35:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:35:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:35:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 07:35:20,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 07:35:20,317 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 104 flow. Second operand 3 states and 51 transitions. [2022-12-06 07:35:20,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 285 flow [2022-12-06 07:35:20,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 277 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:35:20,320 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 110 flow [2022-12-06 07:35:20,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2022-12-06 07:35:20,321 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-06 07:35:20,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:20,321 INFO L89 Accepts]: Start accepts. Operand has 35 places, 33 transitions, 110 flow [2022-12-06 07:35:20,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:20,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:20,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 33 transitions, 110 flow [2022-12-06 07:35:20,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 110 flow [2022-12-06 07:35:20,332 INFO L130 PetriNetUnfolder]: 46/107 cut-off events. [2022-12-06 07:35:20,332 INFO L131 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2022-12-06 07:35:20,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 107 events. 46/107 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 337 event pairs, 14 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 194. Up to 39 conditions per place. [2022-12-06 07:35:20,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 110 flow [2022-12-06 07:35:20,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 07:35:20,334 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:20,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 07:35:20,338 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 110 flow [2022-12-06 07:35:20,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:20,338 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:20,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:35:20,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:20,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash 971652712, now seen corresponding path program 1 times [2022-12-06 07:35:20,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:20,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381409235] [2022-12-06 07:35:20,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:20,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:20,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:20,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381409235] [2022-12-06 07:35:20,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381409235] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:20,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522731915] [2022-12-06 07:35:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:20,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:20,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:20,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:20,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:35:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:20,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:35:20,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:20,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:35:20,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522731915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:20,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:35:20,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 07:35:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664178052] [2022-12-06 07:35:20,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:20,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:35:20,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:35:20,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:35:20,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:35:20,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:20,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:35:20,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:21,012 INFO L130 PetriNetUnfolder]: 1774/2682 cut-off events. [2022-12-06 07:35:21,012 INFO L131 PetriNetUnfolder]: For 1111/1111 co-relation queries the response was YES. [2022-12-06 07:35:21,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7582 conditions, 2682 events. 1774/2682 cut-off events. For 1111/1111 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12250 event pairs, 784 based on Foata normal form. 148/2294 useless extension candidates. Maximal degree in co-relation 4829. Up to 1227 conditions per place. [2022-12-06 07:35:21,020 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 32 selfloop transitions, 2 changer transitions 75/109 dead transitions. [2022-12-06 07:35:21,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 109 transitions, 554 flow [2022-12-06 07:35:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:35:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:35:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 07:35:21,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-06 07:35:21,021 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 110 flow. Second operand 7 states and 106 transitions. [2022-12-06 07:35:21,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 109 transitions, 554 flow [2022-12-06 07:35:21,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 109 transitions, 550 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:35:21,024 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 146 flow [2022-12-06 07:35:21,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-06 07:35:21,025 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 07:35:21,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:21,025 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 146 flow [2022-12-06 07:35:21,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:21,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:21,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 146 flow [2022-12-06 07:35:21,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 146 flow [2022-12-06 07:35:21,035 INFO L130 PetriNetUnfolder]: 46/108 cut-off events. [2022-12-06 07:35:21,035 INFO L131 PetriNetUnfolder]: For 81/95 co-relation queries the response was YES. [2022-12-06 07:35:21,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 108 events. 46/108 cut-off events. For 81/95 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 346 event pairs, 14 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 293. Up to 39 conditions per place. [2022-12-06 07:35:21,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 146 flow [2022-12-06 07:35:21,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 07:35:22,740 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:22,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1716 [2022-12-06 07:35:22,741 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 142 flow [2022-12-06 07:35:22,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:22,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:22,741 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:22,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:35:22,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 07:35:22,942 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:22,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash -651039405, now seen corresponding path program 1 times [2022-12-06 07:35:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:22,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882763418] [2022-12-06 07:35:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:23,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:23,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882763418] [2022-12-06 07:35:23,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882763418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:23,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:23,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:35:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493306774] [2022-12-06 07:35:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:23,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:35:23,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:23,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:35:23,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:35:23,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:35:23,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:23,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:35:23,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:23,210 INFO L130 PetriNetUnfolder]: 658/961 cut-off events. [2022-12-06 07:35:23,210 INFO L131 PetriNetUnfolder]: For 1575/1575 co-relation queries the response was YES. [2022-12-06 07:35:23,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3461 conditions, 961 events. 658/961 cut-off events. For 1575/1575 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3026 event pairs, 269 based on Foata normal form. 38/754 useless extension candidates. Maximal degree in co-relation 3443. Up to 512 conditions per place. [2022-12-06 07:35:23,214 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 38 selfloop transitions, 3 changer transitions 5/46 dead transitions. [2022-12-06 07:35:23,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 300 flow [2022-12-06 07:35:23,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:35:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:35:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 07:35:23,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-06 07:35:23,215 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 142 flow. Second operand 3 states and 44 transitions. [2022-12-06 07:35:23,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 300 flow [2022-12-06 07:35:23,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 258 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-06 07:35:23,219 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 141 flow [2022-12-06 07:35:23,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2022-12-06 07:35:23,219 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-06 07:35:23,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:23,220 INFO L89 Accepts]: Start accepts. Operand has 38 places, 35 transitions, 141 flow [2022-12-06 07:35:23,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:23,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:23,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 35 transitions, 141 flow [2022-12-06 07:35:23,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 141 flow [2022-12-06 07:35:23,277 INFO L130 PetriNetUnfolder]: 33/105 cut-off events. [2022-12-06 07:35:23,278 INFO L131 PetriNetUnfolder]: For 32/38 co-relation queries the response was YES. [2022-12-06 07:35:23,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 105 events. 33/105 cut-off events. For 32/38 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 358 event pairs, 8 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 205. Up to 29 conditions per place. [2022-12-06 07:35:23,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 35 transitions, 141 flow [2022-12-06 07:35:23,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 07:35:23,279 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:23,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 07:35:23,281 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 141 flow [2022-12-06 07:35:23,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:23,281 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:23,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:35:23,282 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:23,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:23,282 INFO L85 PathProgramCache]: Analyzing trace with hash -965008021, now seen corresponding path program 2 times [2022-12-06 07:35:23,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:23,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594534667] [2022-12-06 07:35:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:23,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:23,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:23,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594534667] [2022-12-06 07:35:23,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594534667] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:23,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41405739] [2022-12-06 07:35:23,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:35:23,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:23,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:23,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:23,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:35:24,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:35:24,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:35:24,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:35:24,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:24,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:35:24,243 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 18 treesize of output 20 [2022-12-06 07:35:24,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 7 [2022-12-06 07:35:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:24,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:35:24,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41405739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:24,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:35:24,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2022-12-06 07:35:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227859166] [2022-12-06 07:35:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:24,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:35:24,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:24,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:35:24,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:35:24,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:35:24,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:24,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:35:24,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:24,508 INFO L130 PetriNetUnfolder]: 494/770 cut-off events. [2022-12-06 07:35:24,509 INFO L131 PetriNetUnfolder]: For 638/638 co-relation queries the response was YES. [2022-12-06 07:35:24,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 770 events. 494/770 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2614 event pairs, 108 based on Foata normal form. 12/611 useless extension candidates. Maximal degree in co-relation 1658. Up to 599 conditions per place. [2022-12-06 07:35:24,512 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 60 selfloop transitions, 6 changer transitions 2/68 dead transitions. [2022-12-06 07:35:24,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 411 flow [2022-12-06 07:35:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:35:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:35:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-06 07:35:24,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29523809523809524 [2022-12-06 07:35:24,513 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 141 flow. Second operand 7 states and 62 transitions. [2022-12-06 07:35:24,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 411 flow [2022-12-06 07:35:24,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 380 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 07:35:24,514 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 171 flow [2022-12-06 07:35:24,515 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-06 07:35:24,515 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 07:35:24,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:24,515 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 171 flow [2022-12-06 07:35:24,516 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:24,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:24,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 171 flow [2022-12-06 07:35:24,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 171 flow [2022-12-06 07:35:24,525 INFO L130 PetriNetUnfolder]: 44/118 cut-off events. [2022-12-06 07:35:24,526 INFO L131 PetriNetUnfolder]: For 60/61 co-relation queries the response was YES. [2022-12-06 07:35:24,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 118 events. 44/118 cut-off events. For 60/61 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 338 event pairs, 4 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 182. Up to 36 conditions per place. [2022-12-06 07:35:24,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 171 flow [2022-12-06 07:35:24,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 07:35:24,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 07:35:24,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1061] L142-3-->L143-3: Formula: (and (= |v_#pthreadsForks_66| (+ |v_#pthreadsForks_67| 1)) (= (store |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre32#1_25|)) |v_#memory_int_227|) (= |v_#pthreadsForks_67| |v_ULTIMATE.start_main_#t~pre32#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_228|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_66|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_11|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1] [2022-12-06 07:35:24,747 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:24,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 07:35:24,747 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 173 flow [2022-12-06 07:35:24,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:24,748 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:24,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:35:24,948 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 07:35:24,948 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1991254802, now seen corresponding path program 1 times [2022-12-06 07:35:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:24,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292637026] [2022-12-06 07:35:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:25,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292637026] [2022-12-06 07:35:25,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292637026] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:25,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002258136] [2022-12-06 07:35:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:25,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:25,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:25,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:25,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:35:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:25,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 07:35:25,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:25,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:35:25,684 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 18 treesize of output 20 [2022-12-06 07:35:25,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:35:25,711 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 18 treesize of output 20 [2022-12-06 07:35:25,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 7 [2022-12-06 07:35:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:25,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:35:25,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002258136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:25,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:35:25,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2022-12-06 07:35:25,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795631536] [2022-12-06 07:35:25,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:25,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:35:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:25,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:35:25,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:35:25,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:35:25,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 173 flow. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:25,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:25,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:35:25,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:25,989 INFO L130 PetriNetUnfolder]: 407/628 cut-off events. [2022-12-06 07:35:25,989 INFO L131 PetriNetUnfolder]: For 778/778 co-relation queries the response was YES. [2022-12-06 07:35:25,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2251 conditions, 628 events. 407/628 cut-off events. For 778/778 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2026 event pairs, 34 based on Foata normal form. 20/516 useless extension candidates. Maximal degree in co-relation 1253. Up to 296 conditions per place. [2022-12-06 07:35:25,993 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 75 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2022-12-06 07:35:25,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 85 transitions, 553 flow [2022-12-06 07:35:25,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:35:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:35:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2022-12-06 07:35:25,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2673611111111111 [2022-12-06 07:35:25,994 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 173 flow. Second operand 9 states and 77 transitions. [2022-12-06 07:35:25,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 85 transitions, 553 flow [2022-12-06 07:35:25,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 85 transitions, 535 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 07:35:25,996 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 216 flow [2022-12-06 07:35:25,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-06 07:35:25,997 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-06 07:35:25,997 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:25,997 INFO L89 Accepts]: Start accepts. Operand has 50 places, 42 transitions, 216 flow [2022-12-06 07:35:25,998 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:25,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:25,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 216 flow [2022-12-06 07:35:25,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 216 flow [2022-12-06 07:35:26,011 INFO L130 PetriNetUnfolder]: 64/153 cut-off events. [2022-12-06 07:35:26,011 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2022-12-06 07:35:26,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 153 events. 64/153 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 12 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 242. Up to 51 conditions per place. [2022-12-06 07:35:26,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 216 flow [2022-12-06 07:35:26,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 07:35:26,013 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:26,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 07:35:26,014 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 216 flow [2022-12-06 07:35:26,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:26,014 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:26,030 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 07:35:26,219 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 07:35:26,219 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash -927655443, now seen corresponding path program 1 times [2022-12-06 07:35:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756730826] [2022-12-06 07:35:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:26,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:26,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756730826] [2022-12-06 07:35:26,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756730826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:26,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692625287] [2022-12-06 07:35:26,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:26,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:26,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:26,320 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:26,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:35:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:26,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:35:26,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:26,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:35:26,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692625287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:26,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:35:26,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-06 07:35:26,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928948229] [2022-12-06 07:35:26,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:26,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:35:26,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:26,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:35:26,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:35:26,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:35:26,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:26,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:35:26,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:26,767 INFO L130 PetriNetUnfolder]: 892/1436 cut-off events. [2022-12-06 07:35:26,767 INFO L131 PetriNetUnfolder]: For 2609/2609 co-relation queries the response was YES. [2022-12-06 07:35:26,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 1436 events. 892/1436 cut-off events. For 2609/2609 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5841 event pairs, 334 based on Foata normal form. 136/1335 useless extension candidates. Maximal degree in co-relation 1903. Up to 629 conditions per place. [2022-12-06 07:35:26,773 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 41 selfloop transitions, 2 changer transitions 69/112 dead transitions. [2022-12-06 07:35:26,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 794 flow [2022-12-06 07:35:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:35:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:35:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-12-06 07:35:26,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2022-12-06 07:35:26,774 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 216 flow. Second operand 7 states and 92 transitions. [2022-12-06 07:35:26,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 794 flow [2022-12-06 07:35:26,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 112 transitions, 746 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:26,778 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 222 flow [2022-12-06 07:35:26,778 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2022-12-06 07:35:26,779 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2022-12-06 07:35:26,779 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:26,779 INFO L89 Accepts]: Start accepts. Operand has 58 places, 43 transitions, 222 flow [2022-12-06 07:35:26,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:26,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:26,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 43 transitions, 222 flow [2022-12-06 07:35:26,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 222 flow [2022-12-06 07:35:26,794 INFO L130 PetriNetUnfolder]: 64/154 cut-off events. [2022-12-06 07:35:26,794 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-06 07:35:26,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 154 events. 64/154 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 12 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 486. Up to 51 conditions per place. [2022-12-06 07:35:26,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 222 flow [2022-12-06 07:35:26,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 07:35:27,147 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:27,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 368 [2022-12-06 07:35:27,147 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 218 flow [2022-12-06 07:35:27,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:27,148 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:27,153 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 07:35:27,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:27,348 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:27,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash 990816050, now seen corresponding path program 1 times [2022-12-06 07:35:27,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:27,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670756563] [2022-12-06 07:35:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:27,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:27,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670756563] [2022-12-06 07:35:27,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670756563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:27,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006971267] [2022-12-06 07:35:27,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:27,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:27,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:27,826 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:27,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:35:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:27,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 07:35:27,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:28,236 INFO L321 Elim1Store]: treesize reduction 7, result has 86.8 percent of original size [2022-12-06 07:35:28,236 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 44 treesize of output 57 [2022-12-06 07:35:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:28,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:35:28,416 INFO L321 Elim1Store]: treesize reduction 4, result has 96.0 percent of original size [2022-12-06 07:35:28,416 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 45 treesize of output 109 [2022-12-06 07:35:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:28,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006971267] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:28,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:35:28,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 19 [2022-12-06 07:35:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458660914] [2022-12-06 07:35:28,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:28,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:35:28,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:28,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:35:28,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-12-06 07:35:28,746 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:35:28,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 218 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:28,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:28,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:35:28,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:29,266 INFO L130 PetriNetUnfolder]: 933/1457 cut-off events. [2022-12-06 07:35:29,266 INFO L131 PetriNetUnfolder]: For 2824/2824 co-relation queries the response was YES. [2022-12-06 07:35:29,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5869 conditions, 1457 events. 933/1457 cut-off events. For 2824/2824 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5676 event pairs, 270 based on Foata normal form. 8/1221 useless extension candidates. Maximal degree in co-relation 3361. Up to 556 conditions per place. [2022-12-06 07:35:29,273 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 106 selfloop transitions, 24 changer transitions 6/136 dead transitions. [2022-12-06 07:35:29,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 136 transitions, 915 flow [2022-12-06 07:35:29,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:35:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:35:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2022-12-06 07:35:29,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3020833333333333 [2022-12-06 07:35:29,275 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 218 flow. Second operand 12 states and 116 transitions. [2022-12-06 07:35:29,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 136 transitions, 915 flow [2022-12-06 07:35:29,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 136 transitions, 859 flow, removed 28 selfloop flow, removed 6 redundant places. [2022-12-06 07:35:29,286 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 446 flow [2022-12-06 07:35:29,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=446, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2022-12-06 07:35:29,288 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2022-12-06 07:35:29,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:29,288 INFO L89 Accepts]: Start accepts. Operand has 68 places, 64 transitions, 446 flow [2022-12-06 07:35:29,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:29,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:29,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 64 transitions, 446 flow [2022-12-06 07:35:29,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 446 flow [2022-12-06 07:35:29,327 INFO L130 PetriNetUnfolder]: 171/400 cut-off events. [2022-12-06 07:35:29,327 INFO L131 PetriNetUnfolder]: For 779/807 co-relation queries the response was YES. [2022-12-06 07:35:29,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 400 events. 171/400 cut-off events. For 779/807 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1849 event pairs, 18 based on Foata normal form. 4/310 useless extension candidates. Maximal degree in co-relation 1325. Up to 129 conditions per place. [2022-12-06 07:35:29,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 64 transitions, 446 flow [2022-12-06 07:35:29,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-06 07:35:29,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 07:35:29,431 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 07:35:29,720 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 07:35:29,809 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 07:35:30,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1115] L52-2-->L81: Formula: (let ((.cse0 (select |v_#memory_int_330| v_~q1~0.base_112))) (and (< v_~q1_back~0_186 v_~n1~0_100) (= (+ v_~q1_front~0_130 1) v_~q1_front~0_129) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= (select .cse0 (+ v_~q1~0.offset_111 (* v_~q1_back~0_186 4))) 2) (= (ite |v_thread1_#t~short2#1_86| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= (+ v_~q1_back~0_186 1) v_~q1_back~0_185) (= (ite (and (<= 0 v_~q1_front~0_130) (< v_~q1_front~0_130 v_~n1~0_100) (< v_~q1_front~0_130 v_~q1_back~0_185)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_67| (select .cse0 (+ v_~q1~0.offset_111 (* v_~q1_front~0_130 4)))) |v_thread1_#t~short2#1_85| (< |v_thread1Thread1of1ForFork0_~i~0#1_66| v_~N~0_73))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_130, ~q1_back~0=v_~q1_back~0_186, ~n1~0=v_~n1~0_100, ~q1~0.base=v_~q1~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_66|, #memory_int=|v_#memory_int_330|, ~N~0=v_~N~0_73} OutVars{~q1~0.offset=v_~q1~0.offset_111, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_67|, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_18|, ~q1_front~0=v_~q1_front~0_129, ~n1~0=v_~n1~0_100, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~N~0=v_~N~0_73, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_27|, ~q1_back~0=v_~q1_back~0_185, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_18|, ~q1~0.base=v_~q1~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_66|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_27|, #memory_int=|v_#memory_int_330|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_20|} AuxVars[|v_thread1_#t~short2#1_86|, |v_thread1_#t~short2#1_85|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#t~short2#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork1_#t~mem10#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 07:35:34,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1115] L52-2-->L81: Formula: (let ((.cse0 (select |v_#memory_int_330| v_~q1~0.base_112))) (and (< v_~q1_back~0_186 v_~n1~0_100) (= (+ v_~q1_front~0_130 1) v_~q1_front~0_129) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= (select .cse0 (+ v_~q1~0.offset_111 (* v_~q1_back~0_186 4))) 2) (= (ite |v_thread1_#t~short2#1_86| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= (+ v_~q1_back~0_186 1) v_~q1_back~0_185) (= (ite (and (<= 0 v_~q1_front~0_130) (< v_~q1_front~0_130 v_~n1~0_100) (< v_~q1_front~0_130 v_~q1_back~0_185)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_67| (select .cse0 (+ v_~q1~0.offset_111 (* v_~q1_front~0_130 4)))) |v_thread1_#t~short2#1_85| (< |v_thread1Thread1of1ForFork0_~i~0#1_66| v_~N~0_73))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_130, ~q1_back~0=v_~q1_back~0_186, ~n1~0=v_~n1~0_100, ~q1~0.base=v_~q1~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_66|, #memory_int=|v_#memory_int_330|, ~N~0=v_~N~0_73} OutVars{~q1~0.offset=v_~q1~0.offset_111, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_67|, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_18|, ~q1_front~0=v_~q1_front~0_129, ~n1~0=v_~n1~0_100, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~N~0=v_~N~0_73, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_27|, ~q1_back~0=v_~q1_back~0_185, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_18|, ~q1~0.base=v_~q1~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_66|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_27|, #memory_int=|v_#memory_int_330|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_20|} AuxVars[|v_thread1_#t~short2#1_86|, |v_thread1_#t~short2#1_85|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#t~short2#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork1_#t~mem10#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 07:35:35,125 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:35:35,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5838 [2022-12-06 07:35:35,126 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 492 flow [2022-12-06 07:35:35,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:35,126 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:35,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:35:35,326 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,SelfDestructingSolverStorable10 [2022-12-06 07:35:35,326 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:35,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:35,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1776517051, now seen corresponding path program 1 times [2022-12-06 07:35:35,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:35,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248681188] [2022-12-06 07:35:35,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:35,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:35,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:35,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248681188] [2022-12-06 07:35:35,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248681188] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:35,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310440769] [2022-12-06 07:35:35,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:35,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:35,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:35,817 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:35,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:35:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:35,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 07:35:35,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:36,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 7 [2022-12-06 07:35:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:36,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:35:36,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310440769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:36,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:35:36,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-12-06 07:35:36,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190159691] [2022-12-06 07:35:36,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:36,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:35:36,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:36,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:35:36,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:35:36,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:35:36,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:36,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:35:36,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:36,392 INFO L130 PetriNetUnfolder]: 929/1442 cut-off events. [2022-12-06 07:35:36,392 INFO L131 PetriNetUnfolder]: For 3840/3840 co-relation queries the response was YES. [2022-12-06 07:35:36,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6369 conditions, 1442 events. 929/1442 cut-off events. For 3840/3840 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5662 event pairs, 325 based on Foata normal form. 16/1214 useless extension candidates. Maximal degree in co-relation 5176. Up to 718 conditions per place. [2022-12-06 07:35:36,409 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 103 selfloop transitions, 13 changer transitions 1/117 dead transitions. [2022-12-06 07:35:36,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 117 transitions, 1022 flow [2022-12-06 07:35:36,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:35:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:35:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-12-06 07:35:36,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3516483516483517 [2022-12-06 07:35:36,411 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 492 flow. Second operand 7 states and 96 transitions. [2022-12-06 07:35:36,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 117 transitions, 1022 flow [2022-12-06 07:35:36,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 117 transitions, 934 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-12-06 07:35:36,418 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 531 flow [2022-12-06 07:35:36,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=531, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2022-12-06 07:35:36,420 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-12-06 07:35:36,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:36,420 INFO L89 Accepts]: Start accepts. Operand has 65 places, 65 transitions, 531 flow [2022-12-06 07:35:36,420 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:36,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:36,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 65 transitions, 531 flow [2022-12-06 07:35:36,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 65 transitions, 531 flow [2022-12-06 07:35:36,468 INFO L130 PetriNetUnfolder]: 206/442 cut-off events. [2022-12-06 07:35:36,468 INFO L131 PetriNetUnfolder]: For 1124/1133 co-relation queries the response was YES. [2022-12-06 07:35:36,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 442 events. 206/442 cut-off events. For 1124/1133 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1971 event pairs, 12 based on Foata normal form. 5/331 useless extension candidates. Maximal degree in co-relation 1078. Up to 166 conditions per place. [2022-12-06 07:35:36,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 65 transitions, 531 flow [2022-12-06 07:35:36,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 07:35:36,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 07:35:36,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:36,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 421 [2022-12-06 07:35:36,842 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 527 flow [2022-12-06 07:35:36,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:36,842 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:36,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:35:37,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:37,042 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash -208767707, now seen corresponding path program 1 times [2022-12-06 07:35:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:37,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647403349] [2022-12-06 07:35:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:38,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:38,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647403349] [2022-12-06 07:35:38,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647403349] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:38,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256237775] [2022-12-06 07:35:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:38,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:38,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:38,112 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:38,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:35:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:38,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 07:35:38,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:38,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:35:38,402 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:35:38,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 48 [2022-12-06 07:35:38,415 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 31 treesize of output 17 [2022-12-06 07:35:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:38,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:35:38,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256237775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:38,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:35:38,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-12-06 07:35:38,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290853208] [2022-12-06 07:35:38,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:38,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:35:38,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:38,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:35:38,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:35:38,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:35:38,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 527 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:38,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:35:38,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:38,841 INFO L130 PetriNetUnfolder]: 1445/2244 cut-off events. [2022-12-06 07:35:38,841 INFO L131 PetriNetUnfolder]: For 7644/7644 co-relation queries the response was YES. [2022-12-06 07:35:38,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10758 conditions, 2244 events. 1445/2244 cut-off events. For 7644/7644 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9764 event pairs, 544 based on Foata normal form. 4/1864 useless extension candidates. Maximal degree in co-relation 7885. Up to 1432 conditions per place. [2022-12-06 07:35:38,858 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 116 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2022-12-06 07:35:38,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 127 transitions, 1228 flow [2022-12-06 07:35:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:35:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:35:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-06 07:35:38,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2022-12-06 07:35:38,860 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 527 flow. Second operand 6 states and 87 transitions. [2022-12-06 07:35:38,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 127 transitions, 1228 flow [2022-12-06 07:35:38,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 127 transitions, 1207 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:38,870 INFO L231 Difference]: Finished difference. Result has 69 places, 74 transitions, 675 flow [2022-12-06 07:35:38,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=675, PETRI_PLACES=69, PETRI_TRANSITIONS=74} [2022-12-06 07:35:38,871 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2022-12-06 07:35:38,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:38,871 INFO L89 Accepts]: Start accepts. Operand has 69 places, 74 transitions, 675 flow [2022-12-06 07:35:38,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:38,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:38,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 74 transitions, 675 flow [2022-12-06 07:35:38,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 74 transitions, 675 flow [2022-12-06 07:35:38,930 INFO L130 PetriNetUnfolder]: 323/695 cut-off events. [2022-12-06 07:35:38,930 INFO L131 PetriNetUnfolder]: For 2262/2278 co-relation queries the response was YES. [2022-12-06 07:35:38,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3083 conditions, 695 events. 323/695 cut-off events. For 2262/2278 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3556 event pairs, 25 based on Foata normal form. 10/532 useless extension candidates. Maximal degree in co-relation 1638. Up to 253 conditions per place. [2022-12-06 07:35:38,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 74 transitions, 675 flow [2022-12-06 07:35:38,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 07:35:46,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 07:35:46,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1093] L52-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (<= 0 v_~q1_back~0_In_8) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_36| v_~q1~0.base_In_8) (+ (* v_~q1_back~0_In_8 4) v_~q1~0.offset_In_8)) 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_2| v_~N~0_In_3)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= (ite |v_thread1_#t~short8#1_65| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= (+ v_~q1_back~0_In_8 1) v_~q1_back~0_Out_24) |v_thread1_#t~short8#1_66| (< v_~q1_back~0_In_8 v_~n1~0_In_6) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q1~0.offset=v_~q1~0.offset_In_8, ~q1_back~0=v_~q1_back~0_In_8, ~n1~0=v_~n1~0_In_6, ~q1~0.base=v_~q1~0.base_In_8, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_36|, ~N~0=v_~N~0_In_3} OutVars{~q1~0.offset=v_~q1~0.offset_In_8, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n1~0=v_~n1~0_In_6, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, ~q1_back~0=v_~q1_back~0_Out_24, ~q1~0.base=v_~q1~0.base_In_8, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_Out_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[|v_thread1_#t~short8#1_65|, |v_thread1_#t~short8#1_66|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q1_back~0, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post9#1, thread1Thread1of1ForFork0_#t~short8#1, thread1Thread1of1ForFork0_#res#1.base] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 07:35:46,682 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 07:35:46,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 07:35:47,039 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1093] L52-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (<= 0 v_~q1_back~0_In_8) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_36| v_~q1~0.base_In_8) (+ (* v_~q1_back~0_In_8 4) v_~q1~0.offset_In_8)) 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_2| v_~N~0_In_3)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= (ite |v_thread1_#t~short8#1_65| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= (+ v_~q1_back~0_In_8 1) v_~q1_back~0_Out_24) |v_thread1_#t~short8#1_66| (< v_~q1_back~0_In_8 v_~n1~0_In_6) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q1~0.offset=v_~q1~0.offset_In_8, ~q1_back~0=v_~q1_back~0_In_8, ~n1~0=v_~n1~0_In_6, ~q1~0.base=v_~q1~0.base_In_8, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_36|, ~N~0=v_~N~0_In_3} OutVars{~q1~0.offset=v_~q1~0.offset_In_8, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n1~0=v_~n1~0_In_6, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, ~q1_back~0=v_~q1_back~0_Out_24, ~q1~0.base=v_~q1~0.base_In_8, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_Out_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[|v_thread1_#t~short8#1_65|, |v_thread1_#t~short8#1_66|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q1_back~0, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post9#1, thread1Thread1of1ForFork0_#t~short8#1, thread1Thread1of1ForFork0_#res#1.base] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 07:35:47,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1116] L52-2-->L143-3: Formula: (and (= (ite |v_thread1_#t~short2#1_90| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|) (< |v_thread1Thread1of1ForFork0_~i~0#1_68| v_~N~0_75) (= (+ v_~q1_back~0_190 1) v_~q1_back~0_189) (= |v_ULTIMATE.start_main_#t~pre32#1_58| |v_#pthreadsForks_117|) (= (store |v_#memory_int_333| |v_ULTIMATE.start_main_~#t2~0#1.base_47| (store (select |v_#memory_int_333| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) |v_ULTIMATE.start_main_~#t2~0#1.offset_47| |v_ULTIMATE.start_main_#t~pre32#1_58|)) |v_#memory_int_332|) (<= 0 v_~q1_back~0_190) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| 0)) (= (+ |v_#pthreadsForks_117| 1) |v_#pthreadsForks_116|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|) |v_thread1_#t~short2#1_89| (< v_~q1_back~0_190 v_~n1~0_102) (= 2 (select (select |v_#memory_int_333| v_~q1~0.base_114) (+ (* v_~q1_back~0_190 4) v_~q1~0.offset_113)))) InVars {~q1~0.offset=v_~q1~0.offset_113, #pthreadsForks=|v_#pthreadsForks_117|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~q1_back~0=v_~q1_back~0_190, ~n1~0=v_~n1~0_102, ~q1~0.base=v_~q1~0.base_114, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_68|, #memory_int=|v_#memory_int_333|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} OutVars{~q1~0.offset=v_~q1~0.offset_113, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_31|, ~N~0=v_~N~0_75, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_58|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_43|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|, #pthreadsForks=|v_#pthreadsForks_116|, ~q1_back~0=v_~q1_back~0_189, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_20|, ~q1~0.base=v_~q1~0.base_114, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_68|, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} AuxVars[|v_thread1_#t~short2#1_89|, |v_thread1_#t~short2#1_90|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, #pthreadsForks, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre32#1, thread1Thread1of1ForFork0_#t~mem1#1, ULTIMATE.start_main_#t~pre30#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 07:35:47,592 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:35:47,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8722 [2022-12-06 07:35:47,593 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 807 flow [2022-12-06 07:35:47,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:47,593 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:47,598 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 07:35:47,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:47,798 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:47,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1720087402, now seen corresponding path program 1 times [2022-12-06 07:35:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:47,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563759542] [2022-12-06 07:35:47,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:47,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:48,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:48,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563759542] [2022-12-06 07:35:48,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563759542] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:48,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704545550] [2022-12-06 07:35:48,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:48,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:48,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:48,614 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:48,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:35:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:48,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 07:35:48,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:48,780 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 296 treesize of output 288 [2022-12-06 07:35:48,884 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:35:48,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 46 [2022-12-06 07:35:48,889 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 29 treesize of output 17 [2022-12-06 07:35:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:48,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:35:48,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704545550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:48,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:35:48,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-12-06 07:35:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611154206] [2022-12-06 07:35:48,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:48,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:35:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:48,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:35:48,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:35:48,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:35:48,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 807 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:48,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:35:48,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:49,359 INFO L130 PetriNetUnfolder]: 1447/2250 cut-off events. [2022-12-06 07:35:49,359 INFO L131 PetriNetUnfolder]: For 9200/9200 co-relation queries the response was YES. [2022-12-06 07:35:49,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11358 conditions, 2250 events. 1447/2250 cut-off events. For 9200/9200 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9833 event pairs, 540 based on Foata normal form. 4/1875 useless extension candidates. Maximal degree in co-relation 6155. Up to 797 conditions per place. [2022-12-06 07:35:49,376 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 152 selfloop transitions, 19 changer transitions 1/172 dead transitions. [2022-12-06 07:35:49,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 172 transitions, 1641 flow [2022-12-06 07:35:49,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:35:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:35:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2022-12-06 07:35:49,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30260047281323876 [2022-12-06 07:35:49,378 INFO L175 Difference]: Start difference. First operand has 70 places, 80 transitions, 807 flow. Second operand 9 states and 128 transitions. [2022-12-06 07:35:49,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 172 transitions, 1641 flow [2022-12-06 07:35:49,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 172 transitions, 1629 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 07:35:49,392 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 782 flow [2022-12-06 07:35:49,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=782, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2022-12-06 07:35:49,393 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 46 predicate places. [2022-12-06 07:35:49,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:49,393 INFO L89 Accepts]: Start accepts. Operand has 80 places, 77 transitions, 782 flow [2022-12-06 07:35:49,394 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:49,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:49,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 77 transitions, 782 flow [2022-12-06 07:35:49,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 77 transitions, 782 flow [2022-12-06 07:35:49,455 INFO L130 PetriNetUnfolder]: 321/691 cut-off events. [2022-12-06 07:35:49,455 INFO L131 PetriNetUnfolder]: For 2792/2812 co-relation queries the response was YES. [2022-12-06 07:35:49,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 691 events. 321/691 cut-off events. For 2792/2812 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3557 event pairs, 32 based on Foata normal form. 12/533 useless extension candidates. Maximal degree in co-relation 1932. Up to 252 conditions per place. [2022-12-06 07:35:49,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 77 transitions, 782 flow [2022-12-06 07:35:49,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 07:35:49,462 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:49,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 07:35:49,463 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 782 flow [2022-12-06 07:35:49,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:49,463 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:49,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 07:35:49,668 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,SelfDestructingSolverStorable13 [2022-12-06 07:35:49,668 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:49,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:49,669 INFO L85 PathProgramCache]: Analyzing trace with hash -843807897, now seen corresponding path program 1 times [2022-12-06 07:35:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:49,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350452714] [2022-12-06 07:35:49,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:49,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:49,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350452714] [2022-12-06 07:35:49,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350452714] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875437473] [2022-12-06 07:35:49,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:49,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:49,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:49,743 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:49,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 07:35:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:49,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:35:49,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:49,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:35:49,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875437473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:49,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:35:49,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 07:35:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108623524] [2022-12-06 07:35:49,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:49,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:35:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:49,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:35:49,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:35:49,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:35:49,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 782 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:49,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:35:49,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:50,404 INFO L130 PetriNetUnfolder]: 2318/3859 cut-off events. [2022-12-06 07:35:50,404 INFO L131 PetriNetUnfolder]: For 20989/20989 co-relation queries the response was YES. [2022-12-06 07:35:50,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18734 conditions, 3859 events. 2318/3859 cut-off events. For 20989/20989 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 21138 event pairs, 862 based on Foata normal form. 250/3615 useless extension candidates. Maximal degree in co-relation 10003. Up to 2250 conditions per place. [2022-12-06 07:35:50,440 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 125 selfloop transitions, 7 changer transitions 21/153 dead transitions. [2022-12-06 07:35:50,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 153 transitions, 1833 flow [2022-12-06 07:35:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:35:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:35:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 07:35:50,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.395 [2022-12-06 07:35:50,441 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 782 flow. Second operand 5 states and 79 transitions. [2022-12-06 07:35:50,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 153 transitions, 1833 flow [2022-12-06 07:35:50,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 153 transitions, 1772 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-06 07:35:50,464 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 815 flow [2022-12-06 07:35:50,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=815, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2022-12-06 07:35:50,465 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 47 predicate places. [2022-12-06 07:35:50,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:50,465 INFO L89 Accepts]: Start accepts. Operand has 81 places, 81 transitions, 815 flow [2022-12-06 07:35:50,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:50,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:50,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 81 transitions, 815 flow [2022-12-06 07:35:50,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 81 transitions, 815 flow [2022-12-06 07:35:50,562 INFO L130 PetriNetUnfolder]: 383/954 cut-off events. [2022-12-06 07:35:50,562 INFO L131 PetriNetUnfolder]: For 3946/3976 co-relation queries the response was YES. [2022-12-06 07:35:50,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4349 conditions, 954 events. 383/954 cut-off events. For 3946/3976 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5891 event pairs, 39 based on Foata normal form. 16/770 useless extension candidates. Maximal degree in co-relation 2237. Up to 294 conditions per place. [2022-12-06 07:35:50,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 81 transitions, 815 flow [2022-12-06 07:35:50,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 07:35:55,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:55,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4595 [2022-12-06 07:35:55,060 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 830 flow [2022-12-06 07:35:55,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:55,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:55,061 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:35:55,066 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 07:35:55,261 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,SelfDestructingSolverStorable14 [2022-12-06 07:35:55,261 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:55,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1562394205, now seen corresponding path program 1 times [2022-12-06 07:35:55,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:55,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616175189] [2022-12-06 07:35:55,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:55,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:55,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:55,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616175189] [2022-12-06 07:35:55,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616175189] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:55,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648190024] [2022-12-06 07:35:55,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:55,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:55,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:56,008 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:56,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 07:35:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:56,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:35:56,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:56,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:35:56,253 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:35:56,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 48 [2022-12-06 07:35:56,260 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 31 treesize of output 17 [2022-12-06 07:35:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:56,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:35:56,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648190024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:56,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:35:56,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-06 07:35:56,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30297917] [2022-12-06 07:35:56,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:56,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:35:56,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:56,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:35:56,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:35:56,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:35:56,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 830 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:56,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:35:56,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:56,713 INFO L130 PetriNetUnfolder]: 1935/3200 cut-off events. [2022-12-06 07:35:56,713 INFO L131 PetriNetUnfolder]: For 15166/15166 co-relation queries the response was YES. [2022-12-06 07:35:56,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16115 conditions, 3200 events. 1935/3200 cut-off events. For 15166/15166 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16314 event pairs, 870 based on Foata normal form. 6/2790 useless extension candidates. Maximal degree in co-relation 8556. Up to 2747 conditions per place. [2022-12-06 07:35:56,733 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 70 selfloop transitions, 24 changer transitions 0/94 dead transitions. [2022-12-06 07:35:56,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 94 transitions, 1074 flow [2022-12-06 07:35:56,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:35:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:35:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 07:35:56,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28292682926829266 [2022-12-06 07:35:56,734 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 830 flow. Second operand 5 states and 58 transitions. [2022-12-06 07:35:56,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 94 transitions, 1074 flow [2022-12-06 07:35:56,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 94 transitions, 1058 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 07:35:56,767 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 930 flow [2022-12-06 07:35:56,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=930, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2022-12-06 07:35:56,769 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2022-12-06 07:35:56,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:56,769 INFO L89 Accepts]: Start accepts. Operand has 85 places, 84 transitions, 930 flow [2022-12-06 07:35:56,772 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:56,772 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:56,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 84 transitions, 930 flow [2022-12-06 07:35:56,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 84 transitions, 930 flow [2022-12-06 07:35:56,855 INFO L130 PetriNetUnfolder]: 387/960 cut-off events. [2022-12-06 07:35:56,855 INFO L131 PetriNetUnfolder]: For 4334/4364 co-relation queries the response was YES. [2022-12-06 07:35:56,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4487 conditions, 960 events. 387/960 cut-off events. For 4334/4364 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5892 event pairs, 52 based on Foata normal form. 16/776 useless extension candidates. Maximal degree in co-relation 2348. Up to 299 conditions per place. [2022-12-06 07:35:56,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 84 transitions, 930 flow [2022-12-06 07:35:56,865 INFO L188 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-06 07:35:56,867 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:56,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:35:56,867 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 930 flow [2022-12-06 07:35:56,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:56,868 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:56,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 07:35:57,073 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,SelfDestructingSolverStorable15 [2022-12-06 07:35:57,073 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:57,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1096053303, now seen corresponding path program 1 times [2022-12-06 07:35:57,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:57,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386198173] [2022-12-06 07:35:57,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:57,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:57,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:57,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386198173] [2022-12-06 07:35:57,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386198173] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:57,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4826449] [2022-12-06 07:35:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:57,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:57,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:57,168 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:57,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 07:35:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:57,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:35:57,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:57,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:35:57,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4826449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:57,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:35:57,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-06 07:35:57,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367499498] [2022-12-06 07:35:57,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:57,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:57,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:57,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:35:57,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:35:57,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 930 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:57,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:57,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:35:57,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:57,951 INFO L130 PetriNetUnfolder]: 3164/5127 cut-off events. [2022-12-06 07:35:57,951 INFO L131 PetriNetUnfolder]: For 26848/26848 co-relation queries the response was YES. [2022-12-06 07:35:57,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27432 conditions, 5127 events. 3164/5127 cut-off events. For 26848/26848 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 27791 event pairs, 702 based on Foata normal form. 158/4395 useless extension candidates. Maximal degree in co-relation 13760. Up to 1971 conditions per place. [2022-12-06 07:35:57,979 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 93 selfloop transitions, 38 changer transitions 0/131 dead transitions. [2022-12-06 07:35:57,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 131 transitions, 1519 flow [2022-12-06 07:35:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 07:35:57,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2022-12-06 07:35:57,980 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 930 flow. Second operand 4 states and 76 transitions. [2022-12-06 07:35:57,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 131 transitions, 1519 flow [2022-12-06 07:35:58,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 1501 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 07:35:58,008 INFO L231 Difference]: Finished difference. Result has 89 places, 98 transitions, 1217 flow [2022-12-06 07:35:58,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1217, PETRI_PLACES=89, PETRI_TRANSITIONS=98} [2022-12-06 07:35:58,009 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 55 predicate places. [2022-12-06 07:35:58,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:58,009 INFO L89 Accepts]: Start accepts. Operand has 89 places, 98 transitions, 1217 flow [2022-12-06 07:35:58,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:58,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:58,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 98 transitions, 1217 flow [2022-12-06 07:35:58,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 98 transitions, 1217 flow [2022-12-06 07:35:58,156 INFO L130 PetriNetUnfolder]: 655/1607 cut-off events. [2022-12-06 07:35:58,156 INFO L131 PetriNetUnfolder]: For 7970/8022 co-relation queries the response was YES. [2022-12-06 07:35:58,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8429 conditions, 1607 events. 655/1607 cut-off events. For 7970/8022 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11045 event pairs, 55 based on Foata normal form. 4/1209 useless extension candidates. Maximal degree in co-relation 8196. Up to 503 conditions per place. [2022-12-06 07:35:58,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 98 transitions, 1217 flow [2022-12-06 07:35:58,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 07:35:58,175 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:58,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:35:58,175 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 98 transitions, 1217 flow [2022-12-06 07:35:58,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:58,176 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:58,181 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 07:35:58,381 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,SelfDestructingSolverStorable16 [2022-12-06 07:35:58,381 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:58,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash 842607351, now seen corresponding path program 2 times [2022-12-06 07:35:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:58,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907928648] [2022-12-06 07:35:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:58,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907928648] [2022-12-06 07:35:58,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907928648] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:58,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738369444] [2022-12-06 07:35:58,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:35:58,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:58,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:58,954 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:58,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 07:35:59,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:35:59,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:35:59,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 07:35:59,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:59,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:35:59,225 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 18 treesize of output 20 [2022-12-06 07:35:59,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 7 [2022-12-06 07:35:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:59,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:35:59,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738369444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:59,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:35:59,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-12-06 07:35:59,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516613028] [2022-12-06 07:35:59,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:59,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:35:59,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:59,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:35:59,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:35:59,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:35:59,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 98 transitions, 1217 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:59,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:59,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:35:59,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:00,307 INFO L130 PetriNetUnfolder]: 3545/5714 cut-off events. [2022-12-06 07:36:00,307 INFO L131 PetriNetUnfolder]: For 39178/39178 co-relation queries the response was YES. [2022-12-06 07:36:00,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33542 conditions, 5714 events. 3545/5714 cut-off events. For 39178/39178 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 31394 event pairs, 1386 based on Foata normal form. 38/4816 useless extension candidates. Maximal degree in co-relation 33062. Up to 5091 conditions per place. [2022-12-06 07:36:00,343 INFO L137 encePairwiseOnDemand]: 28/41 looper letters, 159 selfloop transitions, 23 changer transitions 0/182 dead transitions. [2022-12-06 07:36:00,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 182 transitions, 2287 flow [2022-12-06 07:36:00,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:36:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:36:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-12-06 07:36:00,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3201219512195122 [2022-12-06 07:36:00,344 INFO L175 Difference]: Start difference. First operand has 89 places, 98 transitions, 1217 flow. Second operand 8 states and 105 transitions. [2022-12-06 07:36:00,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 182 transitions, 2287 flow [2022-12-06 07:36:00,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 182 transitions, 2155 flow, removed 66 selfloop flow, removed 0 redundant places. [2022-12-06 07:36:00,394 INFO L231 Difference]: Finished difference. Result has 101 places, 113 transitions, 1474 flow [2022-12-06 07:36:00,394 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1474, PETRI_PLACES=101, PETRI_TRANSITIONS=113} [2022-12-06 07:36:00,395 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 67 predicate places. [2022-12-06 07:36:00,395 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:00,395 INFO L89 Accepts]: Start accepts. Operand has 101 places, 113 transitions, 1474 flow [2022-12-06 07:36:00,396 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:00,396 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:00,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 113 transitions, 1474 flow [2022-12-06 07:36:00,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 113 transitions, 1474 flow [2022-12-06 07:36:00,579 INFO L130 PetriNetUnfolder]: 736/1804 cut-off events. [2022-12-06 07:36:00,579 INFO L131 PetriNetUnfolder]: For 12027/12069 co-relation queries the response was YES. [2022-12-06 07:36:00,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9915 conditions, 1804 events. 736/1804 cut-off events. For 12027/12069 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 12842 event pairs, 65 based on Foata normal form. 6/1379 useless extension candidates. Maximal degree in co-relation 9652. Up to 565 conditions per place. [2022-12-06 07:36:00,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 113 transitions, 1474 flow [2022-12-06 07:36:00,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-06 07:36:00,599 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:36:00,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 07:36:00,600 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 113 transitions, 1474 flow [2022-12-06 07:36:00,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:00,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:00,600 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:00,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 07:36:00,803 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,SelfDestructingSolverStorable17 [2022-12-06 07:36:00,804 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:00,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1365045397, now seen corresponding path program 3 times [2022-12-06 07:36:00,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:00,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220366009] [2022-12-06 07:36:00,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:00,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:01,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:01,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220366009] [2022-12-06 07:36:01,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220366009] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:36:01,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691973612] [2022-12-06 07:36:01,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 07:36:01,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:36:01,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:36:01,661 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:36:01,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 07:36:01,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 07:36:01,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:36:01,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:36:01,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:36:01,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:36:01,928 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 18 treesize of output 20 [2022-12-06 07:36:01,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:36:01,980 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 18 treesize of output 20 [2022-12-06 07:36:02,124 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 07:36:02,124 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 40 treesize of output 12 [2022-12-06 07:36:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:02,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:36:02,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691973612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:02,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:36:02,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-06 07:36:02,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811941324] [2022-12-06 07:36:02,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:02,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:36:02,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:36:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:36:02,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:36:02,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 113 transitions, 1474 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:02,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:36:02,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:03,157 INFO L130 PetriNetUnfolder]: 3628/5831 cut-off events. [2022-12-06 07:36:03,157 INFO L131 PetriNetUnfolder]: For 53784/53784 co-relation queries the response was YES. [2022-12-06 07:36:03,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36784 conditions, 5831 events. 3628/5831 cut-off events. For 53784/53784 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 31923 event pairs, 1359 based on Foata normal form. 2/4891 useless extension candidates. Maximal degree in co-relation 36250. Up to 5366 conditions per place. [2022-12-06 07:36:03,193 INFO L137 encePairwiseOnDemand]: 27/41 looper letters, 157 selfloop transitions, 27 changer transitions 0/184 dead transitions. [2022-12-06 07:36:03,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 184 transitions, 2316 flow [2022-12-06 07:36:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:36:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:36:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2022-12-06 07:36:03,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31097560975609756 [2022-12-06 07:36:03,194 INFO L175 Difference]: Start difference. First operand has 101 places, 113 transitions, 1474 flow. Second operand 8 states and 102 transitions. [2022-12-06 07:36:03,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 184 transitions, 2316 flow [2022-12-06 07:36:03,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 184 transitions, 2278 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-06 07:36:03,259 INFO L231 Difference]: Finished difference. Result has 110 places, 121 transitions, 1631 flow [2022-12-06 07:36:03,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1631, PETRI_PLACES=110, PETRI_TRANSITIONS=121} [2022-12-06 07:36:03,259 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 76 predicate places. [2022-12-06 07:36:03,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:03,260 INFO L89 Accepts]: Start accepts. Operand has 110 places, 121 transitions, 1631 flow [2022-12-06 07:36:03,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:03,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:03,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 121 transitions, 1631 flow [2022-12-06 07:36:03,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 121 transitions, 1631 flow [2022-12-06 07:36:03,445 INFO L130 PetriNetUnfolder]: 752/1839 cut-off events. [2022-12-06 07:36:03,445 INFO L131 PetriNetUnfolder]: For 11649/11693 co-relation queries the response was YES. [2022-12-06 07:36:03,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10140 conditions, 1839 events. 752/1839 cut-off events. For 11649/11693 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13090 event pairs, 65 based on Foata normal form. 8/1413 useless extension candidates. Maximal degree in co-relation 9874. Up to 580 conditions per place. [2022-12-06 07:36:03,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 121 transitions, 1631 flow [2022-12-06 07:36:03,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-06 07:36:03,470 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:36:03,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 07:36:03,470 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 121 transitions, 1631 flow [2022-12-06 07:36:03,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:03,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:03,471 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:03,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 07:36:03,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:36:03,676 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1009844971, now seen corresponding path program 4 times [2022-12-06 07:36:03,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:03,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678648841] [2022-12-06 07:36:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:04,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:04,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678648841] [2022-12-06 07:36:04,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678648841] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:36:04,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321332186] [2022-12-06 07:36:04,399 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 07:36:04,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:36:04,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:36:04,400 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:36:04,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 07:36:04,593 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 07:36:04,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:36:04,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 07:36:04,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:36:04,619 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 296 treesize of output 288 [2022-12-06 07:36:04,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:36:04,676 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 07:36:04,846 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:36:04,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2022-12-06 07:36:04,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:36:04,863 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 30 treesize of output 30 [2022-12-06 07:36:07,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:36:07,080 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 36 treesize of output 36 [2022-12-06 07:36:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:07,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:36:07,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:36:07,590 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 263 treesize of output 307 [2022-12-06 07:36:07,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:36:07,613 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 139 treesize of output 147 [2022-12-06 07:36:07,625 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 118 treesize of output 94 [2022-12-06 07:36:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:09,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321332186] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:36:09,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:36:09,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 07:36:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742329080] [2022-12-06 07:36:09,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:36:09,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 07:36:09,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:09,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 07:36:09,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-12-06 07:36:09,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:36:09,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 121 transitions, 1631 flow. Second operand has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:09,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:09,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:36:09,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:12,911 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 07:36:55,975 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 07:37:07,902 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 07:37:33,974 INFO L130 PetriNetUnfolder]: 5452/8729 cut-off events. [2022-12-06 07:37:33,974 INFO L131 PetriNetUnfolder]: For 87097/87097 co-relation queries the response was YES. [2022-12-06 07:37:34,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58197 conditions, 8729 events. 5452/8729 cut-off events. For 87097/87097 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 52681 event pairs, 1097 based on Foata normal form. 712/7777 useless extension candidates. Maximal degree in co-relation 57660. Up to 3318 conditions per place. [2022-12-06 07:37:34,041 INFO L137 encePairwiseOnDemand]: 18/41 looper letters, 325 selfloop transitions, 127 changer transitions 270/722 dead transitions. [2022-12-06 07:37:34,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 722 transitions, 8550 flow [2022-12-06 07:37:34,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-12-06 07:37:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2022-12-06 07:37:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 548 transitions. [2022-12-06 07:37:34,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1856368563685637 [2022-12-06 07:37:34,044 INFO L175 Difference]: Start difference. First operand has 110 places, 121 transitions, 1631 flow. Second operand 72 states and 548 transitions. [2022-12-06 07:37:34,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 722 transitions, 8550 flow [2022-12-06 07:37:34,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 722 transitions, 8469 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-12-06 07:37:34,148 INFO L231 Difference]: Finished difference. Result has 218 places, 231 transitions, 3878 flow [2022-12-06 07:37:34,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=3878, PETRI_PLACES=218, PETRI_TRANSITIONS=231} [2022-12-06 07:37:34,149 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 184 predicate places. [2022-12-06 07:37:34,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:34,149 INFO L89 Accepts]: Start accepts. Operand has 218 places, 231 transitions, 3878 flow [2022-12-06 07:37:34,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:34,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:34,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 231 transitions, 3878 flow [2022-12-06 07:37:34,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 231 transitions, 3878 flow [2022-12-06 07:37:34,409 INFO L130 PetriNetUnfolder]: 762/1834 cut-off events. [2022-12-06 07:37:34,409 INFO L131 PetriNetUnfolder]: For 65228/65541 co-relation queries the response was YES. [2022-12-06 07:37:34,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16615 conditions, 1834 events. 762/1834 cut-off events. For 65228/65541 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 12933 event pairs, 89 based on Foata normal form. 20/1591 useless extension candidates. Maximal degree in co-relation 16244. Up to 683 conditions per place. [2022-12-06 07:37:34,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 231 transitions, 3878 flow [2022-12-06 07:37:34,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 1110 [2022-12-06 07:37:34,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1092] L98-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| (ite |v_thread3_#t~short18#1_93| 1 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_4| 0) |v_thread3_#t~short18#1_94| (= (+ 1 (select (select |v_#memory_int_In_34| v_~q3~0.base_In_5) (+ (* v_~q3_back~0_In_5 4) v_~q3~0.offset_In_5))) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= v_~q2_front~0_Out_22 (+ v_~q2_front~0_In_3 1)) (not (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_4) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_4)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_Out_4| (+ |v_thread3Thread1of1ForFork2_~t~0#1_In_2| |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_Out_6| 0) (< v_~q3_back~0_In_5 v_~n3~0_In_6) (<= 0 v_~q3_back~0_In_5) (= (select (select |v_#memory_int_In_34| v_~q2~0.base_In_4) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_4)) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= (+ v_~q3_back~0_In_5 1) v_~q3_back~0_Out_20) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|)) InVars {~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, ~q2_front~0=v_~q2_front~0_In_3, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_back~0=v_~q3_back~0_In_5, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_In_2|, ~q2_back~0=v_~q2_back~0_In_4} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_Out_6|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_22, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_Out_4|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_Out_4|, ~q3~0.offset=v_~q3~0.offset_In_5, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_Out_4|, ~q3_back~0=v_~q3_back~0_Out_20, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_4, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_Out_6|} AuxVars[|v_thread3_#t~short18#1_93|, |v_thread3_#t~short18#1_94|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 07:37:39,753 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1092] L98-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| (ite |v_thread3_#t~short18#1_93| 1 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_4| 0) |v_thread3_#t~short18#1_94| (= (+ 1 (select (select |v_#memory_int_In_34| v_~q3~0.base_In_5) (+ (* v_~q3_back~0_In_5 4) v_~q3~0.offset_In_5))) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= v_~q2_front~0_Out_22 (+ v_~q2_front~0_In_3 1)) (not (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_4) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_4)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_Out_4| (+ |v_thread3Thread1of1ForFork2_~t~0#1_In_2| |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_Out_6| 0) (< v_~q3_back~0_In_5 v_~n3~0_In_6) (<= 0 v_~q3_back~0_In_5) (= (select (select |v_#memory_int_In_34| v_~q2~0.base_In_4) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_4)) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= (+ v_~q3_back~0_In_5 1) v_~q3_back~0_Out_20) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|)) InVars {~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, ~q2_front~0=v_~q2_front~0_In_3, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_back~0=v_~q3_back~0_In_5, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_In_2|, ~q2_back~0=v_~q2_back~0_In_4} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_Out_6|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_22, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_Out_4|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_Out_4|, ~q3~0.offset=v_~q3~0.offset_In_5, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_Out_4|, ~q3_back~0=v_~q3_back~0_Out_20, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_4, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_Out_6|} AuxVars[|v_thread3_#t~short18#1_93|, |v_thread3_#t~short18#1_94|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 07:37:39,998 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 07:37:40,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 07:37:40,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 07:37:44,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1092] L98-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| (ite |v_thread3_#t~short18#1_93| 1 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_4| 0) |v_thread3_#t~short18#1_94| (= (+ 1 (select (select |v_#memory_int_In_34| v_~q3~0.base_In_5) (+ (* v_~q3_back~0_In_5 4) v_~q3~0.offset_In_5))) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= v_~q2_front~0_Out_22 (+ v_~q2_front~0_In_3 1)) (not (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_4) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_4)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_Out_4| (+ |v_thread3Thread1of1ForFork2_~t~0#1_In_2| |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_Out_6| 0) (< v_~q3_back~0_In_5 v_~n3~0_In_6) (<= 0 v_~q3_back~0_In_5) (= (select (select |v_#memory_int_In_34| v_~q2~0.base_In_4) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_4)) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= (+ v_~q3_back~0_In_5 1) v_~q3_back~0_Out_20) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|)) InVars {~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, ~q2_front~0=v_~q2_front~0_In_3, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_back~0=v_~q3_back~0_In_5, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_In_2|, ~q2_back~0=v_~q2_back~0_In_4} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_Out_6|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_22, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_Out_4|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_Out_4|, ~q3~0.offset=v_~q3~0.offset_In_5, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_Out_4|, ~q3_back~0=v_~q3_back~0_Out_20, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_4, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_Out_6|} AuxVars[|v_thread3_#t~short18#1_93|, |v_thread3_#t~short18#1_94|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 07:37:44,601 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 07:37:44,743 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1058] L81-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_45| (+ (select (select |v_#memory_int_225| v_~q2~0.base_67) (+ v_~q2~0.offset_67 (* v_~q2_back~0_91 4))) 1)) (<= |v_thread2Thread1of1ForFork1_~j~0#1_45| 0) (<= 0 v_~q2_back~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (< v_~q2_back~0_91 v_~n2~0_58) (= |v_thread2Thread1of1ForFork1_#res#1.offset_17| 0) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite |v_thread2_#t~short13#1_67| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_17|) (= |v_thread2Thread1of1ForFork1_~s~0#1_31| (+ |v_thread2Thread1of1ForFork1_~s~0#1_32| |v_thread2Thread1of1ForFork1_~j~0#1_45|)) |v_thread2_#t~short13#1_68| (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_45|, ~n2~0=v_~n2~0_58, ~q2~0.offset=v_~q2~0.offset_67, #memory_int=|v_#memory_int_225|, ~q2~0.base=v_~q2~0.base_67, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_32|, ~q2_back~0=v_~q2_back~0_91} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_45|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_15|, ~n2~0=v_~n2~0_58, ~q2~0.offset=v_~q2~0.offset_67, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_17|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_31|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_17|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_15|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_25|, #memory_int=|v_#memory_int_225|, ~q2~0.base=v_~q2~0.base_67, ~q2_back~0=v_~q2_back~0_90} AuxVars[|v_thread2_#t~short13#1_68|, |v_thread2_#t~short13#1_67|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1092] L98-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| (ite |v_thread3_#t~short18#1_93| 1 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_4| 0) |v_thread3_#t~short18#1_94| (= (+ 1 (select (select |v_#memory_int_In_34| v_~q3~0.base_In_5) (+ (* v_~q3_back~0_In_5 4) v_~q3~0.offset_In_5))) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= v_~q2_front~0_Out_22 (+ v_~q2_front~0_In_3 1)) (not (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_4) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_4)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_Out_4| (+ |v_thread3Thread1of1ForFork2_~t~0#1_In_2| |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_Out_6| 0) (< v_~q3_back~0_In_5 v_~n3~0_In_6) (<= 0 v_~q3_back~0_In_5) (= (select (select |v_#memory_int_In_34| v_~q2~0.base_In_4) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_4)) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= (+ v_~q3_back~0_In_5 1) v_~q3_back~0_Out_20) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|)) InVars {~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, ~q2_front~0=v_~q2_front~0_In_3, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_back~0=v_~q3_back~0_In_5, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_In_2|, ~q2_back~0=v_~q2_back~0_In_4} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_Out_6|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_22, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_Out_4|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_Out_4|, ~q3~0.offset=v_~q3~0.offset_In_5, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_Out_4|, ~q3_back~0=v_~q3_back~0_Out_20, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_4, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_Out_6|} AuxVars[|v_thread3_#t~short18#1_93|, |v_thread3_#t~short18#1_94|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 07:37:45,017 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1058] L81-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_45| (+ (select (select |v_#memory_int_225| v_~q2~0.base_67) (+ v_~q2~0.offset_67 (* v_~q2_back~0_91 4))) 1)) (<= |v_thread2Thread1of1ForFork1_~j~0#1_45| 0) (<= 0 v_~q2_back~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (< v_~q2_back~0_91 v_~n2~0_58) (= |v_thread2Thread1of1ForFork1_#res#1.offset_17| 0) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite |v_thread2_#t~short13#1_67| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_17|) (= |v_thread2Thread1of1ForFork1_~s~0#1_31| (+ |v_thread2Thread1of1ForFork1_~s~0#1_32| |v_thread2Thread1of1ForFork1_~j~0#1_45|)) |v_thread2_#t~short13#1_68| (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_45|, ~n2~0=v_~n2~0_58, ~q2~0.offset=v_~q2~0.offset_67, #memory_int=|v_#memory_int_225|, ~q2~0.base=v_~q2~0.base_67, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_32|, ~q2_back~0=v_~q2_back~0_91} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_45|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_15|, ~n2~0=v_~n2~0_58, ~q2~0.offset=v_~q2~0.offset_67, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_17|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_31|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_17|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_15|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_25|, #memory_int=|v_#memory_int_225|, ~q2~0.base=v_~q2~0.base_67, ~q2_back~0=v_~q2_back~0_90} AuxVars[|v_thread2_#t~short13#1_68|, |v_thread2_#t~short13#1_67|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 07:37:45,257 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 07:37:54,476 INFO L203 LiptonReduction]: Total number of compositions: 14 [2022-12-06 07:37:54,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20328 [2022-12-06 07:37:54,477 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 223 transitions, 3976 flow [2022-12-06 07:37:54,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:54,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:54,477 INFO L213 CegarLoopForPetriNet]: trace histogram [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 07:37:54,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 07:37:54,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:54,678 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:54,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash -526103172, now seen corresponding path program 1 times [2022-12-06 07:37:54,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:54,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697734141] [2022-12-06 07:37:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:55,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697734141] [2022-12-06 07:37:55,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697734141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:37:55,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716011405] [2022-12-06 07:37:55,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:55,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:55,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:55,533 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:37:55,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 07:37:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:55,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 07:37:55,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:37:55,912 INFO L321 Elim1Store]: treesize reduction 9, result has 84.2 percent of original size [2022-12-06 07:37:55,913 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 61 treesize of output 64 [2022-12-06 07:37:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:55,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:37:56,148 INFO L321 Elim1Store]: treesize reduction 8, result has 97.0 percent of original size [2022-12-06 07:37:56,148 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 85 treesize of output 285 [2022-12-06 07:38:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:10,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716011405] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:38:10,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:38:10,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2022-12-06 07:38:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758851895] [2022-12-06 07:38:10,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:38:10,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:38:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:10,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:38:10,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:38:10,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:38:10,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 223 transitions, 3976 flow. Second operand has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:10,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:10,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:38:10,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:12,849 INFO L130 PetriNetUnfolder]: 5532/9244 cut-off events. [2022-12-06 07:38:12,850 INFO L131 PetriNetUnfolder]: For 336084/336084 co-relation queries the response was YES. [2022-12-06 07:38:12,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83354 conditions, 9244 events. 5532/9244 cut-off events. For 336084/336084 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 59572 event pairs, 1612 based on Foata normal form. 6/8664 useless extension candidates. Maximal degree in co-relation 81324. Up to 5125 conditions per place. [2022-12-06 07:38:12,937 INFO L137 encePairwiseOnDemand]: 32/55 looper letters, 398 selfloop transitions, 31 changer transitions 97/526 dead transitions. [2022-12-06 07:38:12,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 526 transitions, 9470 flow [2022-12-06 07:38:12,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:38:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:38:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 222 transitions. [2022-12-06 07:38:12,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21244019138755982 [2022-12-06 07:38:12,940 INFO L175 Difference]: Start difference. First operand has 188 places, 223 transitions, 3976 flow. Second operand 19 states and 222 transitions. [2022-12-06 07:38:12,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 526 transitions, 9470 flow [2022-12-06 07:38:15,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 526 transitions, 8024 flow, removed 716 selfloop flow, removed 19 redundant places. [2022-12-06 07:38:15,010 INFO L231 Difference]: Finished difference. Result has 193 places, 224 transitions, 3423 flow [2022-12-06 07:38:15,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=3300, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3423, PETRI_PLACES=193, PETRI_TRANSITIONS=224} [2022-12-06 07:38:15,010 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 159 predicate places. [2022-12-06 07:38:15,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:15,010 INFO L89 Accepts]: Start accepts. Operand has 193 places, 224 transitions, 3423 flow [2022-12-06 07:38:15,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:15,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:15,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 224 transitions, 3423 flow [2022-12-06 07:38:15,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 224 transitions, 3423 flow [2022-12-06 07:38:15,391 INFO L130 PetriNetUnfolder]: 1046/2557 cut-off events. [2022-12-06 07:38:15,392 INFO L131 PetriNetUnfolder]: For 76499/76805 co-relation queries the response was YES. [2022-12-06 07:38:15,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20532 conditions, 2557 events. 1046/2557 cut-off events. For 76499/76805 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 20066 event pairs, 133 based on Foata normal form. 36/2242 useless extension candidates. Maximal degree in co-relation 20464. Up to 925 conditions per place. [2022-12-06 07:38:15,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 224 transitions, 3423 flow [2022-12-06 07:38:15,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 1086 [2022-12-06 07:38:15,435 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1130] L81-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_394| v_~q2~0.base_122))) (and |v_thread3_#t~short18#1_160| (= (ite |v_thread2_#t~short13#1_174| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| (ite |v_thread3_#t~short18#1_159| 1 0)) (= (+ (select (select |v_#memory_int_394| v_~q3~0.base_106) (+ v_~q3~0.offset_106 (* 4 v_~q3_back~0_153))) 1) |v_thread3Thread1of1ForFork2_~k~0#1_56|) |v_thread2_#t~short13#1_173| (= |v_thread3Thread1of1ForFork2_~t~0#1_62| (+ |v_thread3Thread1of1ForFork2_~t~0#1_63| |v_thread3Thread1of1ForFork2_~k~0#1_56|)) (not (= (ite (and (< v_~q2_front~0_154 v_~q2_back~0_179) (< v_~q2_front~0_154 v_~n2~0_130) (<= 0 v_~q2_front~0_154)) 1 0) 0)) (= (+ v_~q2_front~0_154 1) v_~q2_front~0_153) (= (+ v_~q2_back~0_180 1) v_~q2_back~0_179) (< v_~q3_back~0_153 v_~n3~0_112) (= (+ v_~q3_back~0_153 1) v_~q3_back~0_152) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|) (= |v_thread2Thread1of1ForFork1_~s~0#1_87| (+ |v_thread2Thread1of1ForFork1_~s~0#1_88| |v_thread2Thread1of1ForFork1_~j~0#1_93|)) (= |v_thread2Thread1of1ForFork1_~j~0#1_93| (+ (select .cse0 (+ v_~q2~0.offset_122 (* 4 v_~q2_back~0_180))) 1)) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_56| 0)) (<= 0 v_~q3_back~0_153) (< v_~q2_back~0_180 v_~n2~0_130) (= (select .cse0 (+ v_~q2~0.offset_122 (* v_~q2_front~0_154 4))) |v_thread3Thread1of1ForFork2_~k~0#1_56|) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_93| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| 0)))) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_93|, ~n2~0=v_~n2~0_130, ~n3~0=v_~n3~0_112, ~q2~0.offset=v_~q2~0.offset_122, ~q2_front~0=v_~q2_front~0_154, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_88|, ~q3~0.offset=v_~q3~0.offset_106, ~q3_back~0=v_~q3_back~0_153, #memory_int=|v_#memory_int_394|, ~q3~0.base=v_~q3~0.base_106, ~q2~0.base=v_~q2~0.base_122, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_63|, ~q2_back~0=v_~q2_back~0_180} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_44|, ~n3~0=v_~n3~0_112, ~q2~0.offset=v_~q2~0.offset_122, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_39|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_39|, ~q3_back~0=v_~q3_back~0_152, ~q3~0.base=v_~q3~0.base_106, ~q2~0.base=v_~q2~0.base_122, ~q2_back~0=v_~q2_back~0_179, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_56|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_37|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_93|, ~n2~0=v_~n2~0_130, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_37|, ~q2_front~0=v_~q2_front~0_153, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_39|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_87|, ~q3~0.offset=v_~q3~0.offset_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_44|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_56|, #memory_int=|v_#memory_int_394|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_62|} AuxVars[|v_thread2_#t~short13#1_174|, |v_thread2_#t~short13#1_173|, |v_thread3_#t~short18#1_160|, |v_thread3_#t~short18#1_159|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_~s~0#1, thread3Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, ~q2_back~0, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] [2022-12-06 07:38:15,872 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 07:38:16,019 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1129] L52-2-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_391| v_~q2~0.base_120)) (.cse1 (select |v_#memory_int_391| v_~q1~0.base_135))) (and (= (+ v_~q2_back~0_175 1) v_~q2_back~0_174) |v_thread3_#t~short18#1_150| (not (= (ite (and (<= 0 v_~q2_front~0_149) (< v_~q2_front~0_149 v_~q2_back~0_174) (< v_~q2_front~0_149 v_~n2~0_128)) 1 0) 0)) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_91| 0)) (<= 0 v_~q3_back~0_149) (= (select .cse0 (+ v_~q2~0.offset_120 (* v_~q2_front~0_149 4))) |v_thread3Thread1of1ForFork2_~k~0#1_54|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|) (= |v_thread3Thread1of1ForFork2_~t~0#1_58| (+ |v_thread3Thread1of1ForFork2_~t~0#1_59| |v_thread3Thread1of1ForFork2_~k~0#1_54|)) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_54| 0)) (= (ite |v_thread3_#t~short18#1_149| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) |v_thread2_#t~short13#1_162| (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80| 0)) (= (+ (select .cse0 (+ v_~q2~0.offset_120 (* 4 v_~q2_back~0_175))) 1) |v_thread2Thread1of1ForFork1_~j~0#1_91|) (= |v_thread2Thread1of1ForFork1_~s~0#1_83| (+ |v_thread2Thread1of1ForFork1_~s~0#1_84| |v_thread2Thread1of1ForFork1_~j~0#1_91|)) (< v_~q3_back~0_149 v_~n3~0_110) (= (+ v_~q3_back~0_149 1) v_~q3_back~0_148) (not (= (ite (and (< v_~q1_front~0_162 v_~n1~0_118) (<= 0 v_~q1_front~0_162) (< v_~q1_front~0_162 v_~q1_back~0_222)) 1 0) 0)) (< v_~q1_back~0_223 v_~n1~0_118) |v_thread1_#t~short2#1_126| (< |v_thread1Thread1of1ForFork0_~i~0#1_83| v_~N~0_91) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|) (= (ite |v_thread1_#t~short2#1_125| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~q1_front~0_162 1) v_~q1_front~0_161) (< v_~q2_back~0_175 v_~n2~0_128) (= |v_thread2Thread1of1ForFork1_~j~0#1_91| (select .cse1 (+ v_~q1~0.offset_134 (* v_~q1_front~0_162 4)))) (= (ite |v_thread2_#t~short13#1_161| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|) (= 2 (select .cse1 (+ (* v_~q1_back~0_223 4) v_~q1~0.offset_134))) (= (+ v_~q2_front~0_149 1) v_~q2_front~0_148) (= (+ v_~q1_back~0_223 1) v_~q1_back~0_222) (= |v_thread3Thread1of1ForFork2_~k~0#1_54| (+ (select (select |v_#memory_int_391| v_~q3~0.base_104) (+ (* 4 v_~q3_back~0_149) v_~q3~0.offset_104)) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_134, ~n2~0=v_~n2~0_128, ~q1_front~0=v_~q1_front~0_162, ~n3~0=v_~n3~0_110, ~q2~0.offset=v_~q2~0.offset_120, ~n1~0=v_~n1~0_118, ~q2_front~0=v_~q2_front~0_149, ~N~0=v_~N~0_91, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_84|, ~q3~0.offset=v_~q3~0.offset_104, ~q3_back~0=v_~q3_back~0_149, ~q1_back~0=v_~q1_back~0_223, ~q1~0.base=v_~q1~0.base_135, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_83|, #memory_int=|v_#memory_int_391|, ~q3~0.base=v_~q3~0.base_104, ~q2~0.base=v_~q2~0.base_120, ~q2_back~0=v_~q2_back~0_175, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_59|} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_42|, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_34|, ~q1_front~0=v_~q1_front~0_161, ~n3~0=v_~n3~0_110, ~q2~0.offset=v_~q2~0.offset_120, ~n1~0=v_~n1~0_118, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_37|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_37|, ~q3_back~0=v_~q3_back~0_148, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_42|, ~q1_back~0=v_~q1_back~0_222, ~q1~0.base=v_~q1~0.base_135, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_42|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|, ~q3~0.base=v_~q3~0.base_104, ~q2~0.base=v_~q2~0.base_120, ~q2_back~0=v_~q2_back~0_174, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_54|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_91|, ~q1~0.offset=v_~q1~0.offset_134, ~n2~0=v_~n2~0_128, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_35|, ~q2_front~0=v_~q2_front~0_148, ~N~0=v_~N~0_91, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_37|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_83|, ~q3~0.offset=v_~q3~0.offset_104, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_42|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_54|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_34|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_83|, #memory_int=|v_#memory_int_391|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_36|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_58|} AuxVars[|v_thread1_#t~short2#1_126|, |v_thread3_#t~short18#1_150|, |v_thread2_#t~short13#1_161|, |v_thread2_#t~short13#1_162|, |v_thread1_#t~short2#1_125|, |v_thread3_#t~short18#1_149|] AssignedVars[thread2Thread1of1ForFork1_#t~short13#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_front~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post11#1, ~q1_back~0, thread2Thread1of1ForFork1_#t~mem10#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~q2_back~0, thread3Thread1of1ForFork2_~k~0#1, thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_~s~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread3Thread1of1ForFork2_~t~0#1] and [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] [2022-12-06 07:38:16,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1124] L52-2-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_369| v_~q2~0.base_112)) (.cse1 (select |v_#memory_int_369| v_~q1~0.base_123))) (and |v_thread3_#t~short18#1_143| (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_85| (+ 1 (select .cse0 (+ v_~q2~0.offset_112 (* 4 v_~q2_back~0_163))))) (= |v_thread3Thread1of1ForFork2_~k~0#1_52| (select .cse0 (+ v_~q2~0.offset_112 (* v_~q2_front~0_141 4)))) (<= 0 v_~q3_back~0_141) (= |v_thread2Thread1of1ForFork1_~s~0#1_75| (+ |v_thread2Thread1of1ForFork1_~s~0#1_76| |v_thread2Thread1of1ForFork1_~j~0#1_85|)) (not (= (ite (and (< v_~q2_front~0_141 v_~q2_back~0_162) (<= 0 v_~q2_front~0_141) (< v_~q2_front~0_141 v_~n2~0_120)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_77| v_~N~0_81) (= (ite |v_thread3_#t~short18#1_144| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) |v_thread2_#t~short13#1_149| (= 2 (select .cse1 (+ (* v_~q1_back~0_207 4) v_~q1~0.offset_122))) (= (+ (select (select |v_#memory_int_369| v_~q3~0.base_98) (+ (* 4 v_~q3_back~0_141) v_~q3~0.offset_98)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_52|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (= |v_thread3Thread1of1ForFork2_~t~0#1_54| (+ |v_thread3Thread1of1ForFork2_~t~0#1_55| |v_thread3Thread1of1ForFork2_~k~0#1_52|)) (= v_~q3_back~0_140 (+ v_~q3_back~0_141 1)) (= (+ v_~q2_back~0_163 1) v_~q2_back~0_162) (= (+ v_~q1_back~0_207 1) v_~q1_back~0_206) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70| 0)) (= (+ v_~q1_front~0_146 1) v_~q1_front~0_145) (< v_~q1_back~0_207 v_~n1~0_108) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (< v_~q3_back~0_141 v_~n3~0_104) (= (ite |v_thread1_#t~short2#1_113| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) |v_thread1_#t~short2#1_114| (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_52| 0)) (= (+ v_~q2_front~0_141 1) v_~q2_front~0_140) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_85| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_85| (select .cse1 (+ v_~q1~0.offset_122 (* v_~q1_front~0_146 4)))) (not (= (ite (and (< v_~q1_front~0_146 v_~n1~0_108) (<= 0 v_~q1_front~0_146) (< v_~q1_front~0_146 v_~q1_back~0_206)) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| 0)) (< v_~q2_back~0_163 v_~n2~0_120) (= (ite |v_thread2_#t~short13#1_150| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|))) InVars {~q1~0.offset=v_~q1~0.offset_122, ~n2~0=v_~n2~0_120, ~q1_front~0=v_~q1_front~0_146, ~n3~0=v_~n3~0_104, ~q2~0.offset=v_~q2~0.offset_112, ~n1~0=v_~n1~0_108, ~q2_front~0=v_~q2_front~0_141, ~N~0=v_~N~0_81, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_76|, ~q3~0.offset=v_~q3~0.offset_98, ~q3_back~0=v_~q3_back~0_141, ~q1_back~0=v_~q1_back~0_207, ~q1~0.base=v_~q1~0.base_123, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_369|, ~q3~0.base=v_~q3~0.base_98, ~q2~0.base=v_~q2~0.base_112, ~q2_back~0=v_~q2_back~0_163, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_55|} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_38|, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_28|, ~q1_front~0=v_~q1_front~0_145, ~n3~0=v_~n3~0_104, ~q2~0.offset=v_~q2~0.offset_112, ~n1~0=v_~n1~0_108, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_35|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_35|, ~q3_back~0=v_~q3_back~0_140, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_36|, ~q1_back~0=v_~q1_back~0_206, ~q1~0.base=v_~q1~0.base_123, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|, ~q3~0.base=v_~q3~0.base_98, ~q2~0.base=v_~q2~0.base_112, ~q2_back~0=v_~q2_back~0_162, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_52|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_33|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_85|, ~q1~0.offset=v_~q1~0.offset_122, ~n2~0=v_~n2~0_120, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_33|, ~q2_front~0=v_~q2_front~0_140, ~N~0=v_~N~0_81, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_35|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_75|, ~q3~0.offset=v_~q3~0.offset_98, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_38|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_50|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_28|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_369|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_30|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_54|} AuxVars[|v_thread3_#t~short18#1_144|, |v_thread3_#t~short18#1_143|, |v_thread2_#t~short13#1_150|, |v_thread1_#t~short2#1_113|, |v_thread1_#t~short2#1_114|, |v_thread2_#t~short13#1_149|] AssignedVars[thread2Thread1of1ForFork1_#t~short13#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_front~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post11#1, ~q1_back~0, thread2Thread1of1ForFork1_#t~mem10#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~q2_back~0, thread3Thread1of1ForFork2_~k~0#1, thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_~s~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread3Thread1of1ForFork2_~t~0#1] and [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] [2022-12-06 07:38:20,717 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:38:20,722 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5712 [2022-12-06 07:38:20,723 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 222 transitions, 3459 flow [2022-12-06 07:38:20,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:20,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:20,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:20,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 07:38:20,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:20,928 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1719444392, now seen corresponding path program 1 times [2022-12-06 07:38:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:20,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61692389] [2022-12-06 07:38:20,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:20,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:38:20,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:20,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61692389] [2022-12-06 07:38:20,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61692389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:20,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:20,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:38:20,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984162450] [2022-12-06 07:38:20,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:20,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:38:20,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:38:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:38:20,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:38:20,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 222 transitions, 3459 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:20,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:20,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:38:20,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:22,645 INFO L130 PetriNetUnfolder]: 5243/8590 cut-off events. [2022-12-06 07:38:22,645 INFO L131 PetriNetUnfolder]: For 291402/291402 co-relation queries the response was YES. [2022-12-06 07:38:22,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68861 conditions, 8590 events. 5243/8590 cut-off events. For 291402/291402 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 53751 event pairs, 1288 based on Foata normal form. 300/8324 useless extension candidates. Maximal degree in co-relation 68791. Up to 7561 conditions per place. [2022-12-06 07:38:22,731 INFO L137 encePairwiseOnDemand]: 40/52 looper letters, 224 selfloop transitions, 28 changer transitions 0/252 dead transitions. [2022-12-06 07:38:22,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 252 transitions, 4242 flow [2022-12-06 07:38:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:38:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:38:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-06 07:38:22,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-06 07:38:22,732 INFO L175 Difference]: Start difference. First operand has 179 places, 222 transitions, 3459 flow. Second operand 3 states and 66 transitions. [2022-12-06 07:38:22,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 252 transitions, 4242 flow [2022-12-06 07:38:23,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 252 transitions, 4152 flow, removed 33 selfloop flow, removed 5 redundant places. [2022-12-06 07:38:23,723 INFO L231 Difference]: Finished difference. Result has 177 places, 228 transitions, 3490 flow [2022-12-06 07:38:23,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3246, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3490, PETRI_PLACES=177, PETRI_TRANSITIONS=228} [2022-12-06 07:38:23,723 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 143 predicate places. [2022-12-06 07:38:23,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:23,723 INFO L89 Accepts]: Start accepts. Operand has 177 places, 228 transitions, 3490 flow [2022-12-06 07:38:23,725 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:23,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:23,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 228 transitions, 3490 flow [2022-12-06 07:38:23,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 228 transitions, 3490 flow [2022-12-06 07:38:24,145 INFO L130 PetriNetUnfolder]: 1068/2625 cut-off events. [2022-12-06 07:38:24,145 INFO L131 PetriNetUnfolder]: For 73402/73801 co-relation queries the response was YES. [2022-12-06 07:38:24,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20876 conditions, 2625 events. 1068/2625 cut-off events. For 73402/73801 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 20884 event pairs, 143 based on Foata normal form. 47/2288 useless extension candidates. Maximal degree in co-relation 19855. Up to 919 conditions per place. [2022-12-06 07:38:24,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 228 transitions, 3490 flow [2022-12-06 07:38:24,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 1136 [2022-12-06 07:38:24,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1148] L81-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_476| v_~q2~0.base_148))) (and (< v_~q3_back~0_200 v_~n3~0_132) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107| 0)) |v_thread3_#t~short18#1_218| (= (+ v_~q3_back~0_200 1) v_~q3_back~0_199) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|) |v_thread2_#t~short13#1_255| (= |v_thread3Thread1of1ForFork2_~t~0#1_85| (+ |v_thread3Thread1of1ForFork2_~t~0#1_86| |v_thread3Thread1of1ForFork2_~k~0#1_69|)) (<= 0 v_~q3_back~0_200) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_111| 0)) (< v_~q2_back~0_234 v_~n2~0_154) (= |v_thread2Thread1of1ForFork1_~j~0#1_111| (+ (select .cse0 (+ (* 4 v_~q2_back~0_234) v_~q2~0.offset_148)) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite |v_thread2_#t~short13#1_256| 1 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_55| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|) (= (+ v_~q2_back~0_234 1) v_~q2_back~0_233) (= |v_thread3Thread1of1ForFork2_~k~0#1_69| (+ (select (select |v_#memory_int_476| v_~q3~0.base_140) (+ (* 4 v_~q3_back~0_200) v_~q3~0.offset_140)) 1)) (not (= (ite (and (< v_~q2_front~0_204 v_~n2~0_154) (< v_~q2_front~0_204 v_~q2_back~0_233) (<= 0 v_~q2_front~0_204)) 1 0) 0)) (= (+ v_~q2_front~0_204 1) v_~q2_front~0_203) (= |v_thread2Thread1of1ForFork1_~s~0#1_107| (+ |v_thread2Thread1of1ForFork1_~s~0#1_108| |v_thread2Thread1of1ForFork1_~j~0#1_111|)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_55| 0)) (= (ite |v_thread3_#t~short18#1_217| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|) (= |v_thread3Thread1of1ForFork2_~k~0#1_69| (select .cse0 (+ v_~q2~0.offset_148 (* v_~q2_front~0_204 4)))) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_69| 0)))) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_111|, ~n2~0=v_~n2~0_154, ~n3~0=v_~n3~0_132, ~q2~0.offset=v_~q2~0.offset_148, ~q2_front~0=v_~q2_front~0_204, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_108|, ~q3~0.offset=v_~q3~0.offset_140, ~q3_back~0=v_~q3_back~0_200, #memory_int=|v_#memory_int_476|, ~q3~0.base=v_~q3~0.base_140, ~q2~0.base=v_~q2~0.base_148, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_86|, ~q2_back~0=v_~q2_back~0_234} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_55|, ~n3~0=v_~n3~0_132, ~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_107|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_51|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_51|, ~q3_back~0=v_~q3_back~0_199, ~q3~0.base=v_~q3~0.base_140, ~q2~0.base=v_~q2~0.base_148, ~q2_back~0=v_~q2_back~0_233, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_69|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_49|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_111|, ~n2~0=v_~n2~0_154, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_55|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_49|, ~q2_front~0=v_~q2_front~0_203, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_51|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_107|, ~q3~0.offset=v_~q3~0.offset_140, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_55|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_67|, #memory_int=|v_#memory_int_476|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_85|} AuxVars[|v_thread3_#t~short18#1_218|, |v_thread2_#t~short13#1_255|, |v_thread3_#t~short18#1_217|, |v_thread2_#t~short13#1_256|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_~s~0#1, thread3Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, ~q2_back~0, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] [2022-12-06 07:38:29,966 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:38:29,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6244 [2022-12-06 07:38:29,967 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 228 transitions, 3502 flow [2022-12-06 07:38:29,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:29,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:29,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:29,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:38:29,967 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1986906620, now seen corresponding path program 1 times [2022-12-06 07:38:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:29,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631638497] [2022-12-06 07:38:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:31,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:31,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631638497] [2022-12-06 07:38:31,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631638497] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:38:31,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873757396] [2022-12-06 07:38:31,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:31,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:31,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:38:31,239 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:38:31,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 07:38:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:31,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 07:38:31,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:38:31,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 7 [2022-12-06 07:38:31,680 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-12-06 07:38:31,680 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 61 treesize of output 33 [2022-12-06 07:38:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:31,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:38:31,967 INFO L321 Elim1Store]: treesize reduction 4, result has 96.0 percent of original size [2022-12-06 07:38:31,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 124 [2022-12-06 07:38:32,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:32,802 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 25 treesize of output 21 [2022-12-06 07:38:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:33,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873757396] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:38:33,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:38:33,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2022-12-06 07:38:33,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541132235] [2022-12-06 07:38:33,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:38:33,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:38:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:38:33,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-12-06 07:38:33,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:38:33,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 228 transitions, 3502 flow. Second operand has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:33,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:33,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:38:33,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:36,637 INFO L130 PetriNetUnfolder]: 5361/8821 cut-off events. [2022-12-06 07:38:36,637 INFO L131 PetriNetUnfolder]: For 271318/271318 co-relation queries the response was YES. [2022-12-06 07:38:36,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72097 conditions, 8821 events. 5361/8821 cut-off events. For 271318/271318 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 55780 event pairs, 1407 based on Foata normal form. 6/8213 useless extension candidates. Maximal degree in co-relation 67448. Up to 7785 conditions per place. [2022-12-06 07:38:36,750 INFO L137 encePairwiseOnDemand]: 26/52 looper letters, 258 selfloop transitions, 84 changer transitions 21/363 dead transitions. [2022-12-06 07:38:36,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 363 transitions, 5766 flow [2022-12-06 07:38:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 07:38:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 07:38:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 177 transitions. [2022-12-06 07:38:36,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1309171597633136 [2022-12-06 07:38:36,752 INFO L175 Difference]: Start difference. First operand has 178 places, 228 transitions, 3502 flow. Second operand 26 states and 177 transitions. [2022-12-06 07:38:36,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 363 transitions, 5766 flow [2022-12-06 07:38:37,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 363 transitions, 5708 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 07:38:37,888 INFO L231 Difference]: Finished difference. Result has 215 places, 281 transitions, 4759 flow [2022-12-06 07:38:37,888 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3458, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4759, PETRI_PLACES=215, PETRI_TRANSITIONS=281} [2022-12-06 07:38:37,888 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 181 predicate places. [2022-12-06 07:38:37,888 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:37,889 INFO L89 Accepts]: Start accepts. Operand has 215 places, 281 transitions, 4759 flow [2022-12-06 07:38:37,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:37,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:37,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 281 transitions, 4759 flow [2022-12-06 07:38:37,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 281 transitions, 4759 flow [2022-12-06 07:38:38,399 INFO L130 PetriNetUnfolder]: 1089/2701 cut-off events. [2022-12-06 07:38:38,400 INFO L131 PetriNetUnfolder]: For 86980/87294 co-relation queries the response was YES. [2022-12-06 07:38:38,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22966 conditions, 2701 events. 1089/2701 cut-off events. For 86980/87294 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 21641 event pairs, 122 based on Foata normal form. 23/2344 useless extension candidates. Maximal degree in co-relation 22356. Up to 959 conditions per place. [2022-12-06 07:38:38,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 281 transitions, 4759 flow [2022-12-06 07:38:38,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 1258 [2022-12-06 07:38:38,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] and [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] [2022-12-06 07:38:38,967 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 07:38:39,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 07:38:39,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] and [1092] L98-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| (ite |v_thread3_#t~short18#1_93| 1 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_4| 0) |v_thread3_#t~short18#1_94| (= (+ 1 (select (select |v_#memory_int_In_34| v_~q3~0.base_In_5) (+ (* v_~q3_back~0_In_5 4) v_~q3~0.offset_In_5))) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= v_~q2_front~0_Out_22 (+ v_~q2_front~0_In_3 1)) (not (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_4) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_4)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_Out_4| (+ |v_thread3Thread1of1ForFork2_~t~0#1_In_2| |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_Out_6| 0) (< v_~q3_back~0_In_5 v_~n3~0_In_6) (<= 0 v_~q3_back~0_In_5) (= (select (select |v_#memory_int_In_34| v_~q2~0.base_In_4) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_4)) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= (+ v_~q3_back~0_In_5 1) v_~q3_back~0_Out_20) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|)) InVars {~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, ~q2_front~0=v_~q2_front~0_In_3, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_back~0=v_~q3_back~0_In_5, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_In_2|, ~q2_back~0=v_~q2_back~0_In_4} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_Out_6|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_22, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_Out_4|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_Out_4|, ~q3~0.offset=v_~q3~0.offset_In_5, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_Out_4|, ~q3_back~0=v_~q3_back~0_Out_20, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_4, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_Out_6|} AuxVars[|v_thread3_#t~short18#1_93|, |v_thread3_#t~short18#1_94|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 07:38:39,502 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 07:38:39,706 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 07:38:39,815 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1159] L52-2-->L81: Formula: (let ((.cse0 (select |v_#memory_int_517| v_~q1~0.base_183))) (and (= v_~q1_back~0_311 (+ v_~q1_back~0_312 1)) (= (select .cse0 (+ v_~q1~0.offset_182 (* v_~q1_front~0_245 4))) |v_thread2Thread1of1ForFork1_~j~0#1_131|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| 0)) (= (ite |v_thread1_#t~short2#1_190| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|) (= v_~q1_front~0_244 (+ v_~q1_front~0_245 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_109| v_~N~0_125) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|) (< v_~q1_back~0_312 v_~n1~0_164) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite (and (<= 0 v_~q1_front~0_245) (< v_~q1_front~0_245 v_~n1~0_164) (< v_~q1_front~0_245 v_~q1_back~0_311)) 1 0)) (= (select .cse0 (+ (* v_~q1_back~0_312 4) v_~q1~0.offset_182)) 2) |v_thread1_#t~short2#1_189|)) InVars {~q1~0.offset=v_~q1~0.offset_182, ~q1_front~0=v_~q1_front~0_245, ~q1_back~0=v_~q1_back~0_312, ~n1~0=v_~n1~0_164, ~q1~0.base=v_~q1~0.base_183, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_109|, #memory_int=|v_#memory_int_517|, ~N~0=v_~N~0_125} OutVars{~q1~0.offset=v_~q1~0.offset_182, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_131|, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_50|, ~q1_front~0=v_~q1_front~0_244, ~n1~0=v_~n1~0_164, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, ~N~0=v_~N~0_125, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_68|, ~q1_back~0=v_~q1_back~0_311, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_50|, ~q1~0.base=v_~q1~0.base_183, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_109|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_68|, #memory_int=|v_#memory_int_517|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_52|} AuxVars[|v_thread1_#t~short2#1_189|, |v_thread1_#t~short2#1_190|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#t~short2#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork1_#t~mem10#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] [2022-12-06 07:38:40,063 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1159] L52-2-->L81: Formula: (let ((.cse0 (select |v_#memory_int_517| v_~q1~0.base_183))) (and (= v_~q1_back~0_311 (+ v_~q1_back~0_312 1)) (= (select .cse0 (+ v_~q1~0.offset_182 (* v_~q1_front~0_245 4))) |v_thread2Thread1of1ForFork1_~j~0#1_131|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| 0)) (= (ite |v_thread1_#t~short2#1_190| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|) (= v_~q1_front~0_244 (+ v_~q1_front~0_245 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_109| v_~N~0_125) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|) (< v_~q1_back~0_312 v_~n1~0_164) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite (and (<= 0 v_~q1_front~0_245) (< v_~q1_front~0_245 v_~n1~0_164) (< v_~q1_front~0_245 v_~q1_back~0_311)) 1 0)) (= (select .cse0 (+ (* v_~q1_back~0_312 4) v_~q1~0.offset_182)) 2) |v_thread1_#t~short2#1_189|)) InVars {~q1~0.offset=v_~q1~0.offset_182, ~q1_front~0=v_~q1_front~0_245, ~q1_back~0=v_~q1_back~0_312, ~n1~0=v_~n1~0_164, ~q1~0.base=v_~q1~0.base_183, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_109|, #memory_int=|v_#memory_int_517|, ~N~0=v_~N~0_125} OutVars{~q1~0.offset=v_~q1~0.offset_182, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_131|, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_50|, ~q1_front~0=v_~q1_front~0_244, ~n1~0=v_~n1~0_164, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, ~N~0=v_~N~0_125, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_68|, ~q1_back~0=v_~q1_back~0_311, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_50|, ~q1~0.base=v_~q1~0.base_183, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_109|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_68|, #memory_int=|v_#memory_int_517|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_52|} AuxVars[|v_thread1_#t~short2#1_189|, |v_thread1_#t~short2#1_190|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#t~short2#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork1_#t~mem10#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1165] L56-->L56: Formula: (and (= (select (select |v_#memory_int_539| v_~q1~0.base_193) (+ (* v_~q1_back~0_333 4) v_~q1~0.offset_192)) 2) (not (= (ite (and (< v_~q3_front~0_179 v_~n3~0_158) (< v_~q3_front~0_179 v_~q3_back~0_250) (<= 0 v_~q3_front~0_179)) 1 0) 0)) (= (+ v_~q1_back~0_333 1) v_~q1_back~0_332) (= |v_thread1Thread1of1ForFork0_~l~0#1_53| (select (select |v_#memory_int_539| v_~q3~0.base_169) (+ v_~q3~0.offset_169 (* v_~q3_front~0_179 4)))) (= (+ |v_thread1Thread1of1ForFork0_~l~0#1_53| v_~r~0_123) v_~r~0_122) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_127| 1) |v_thread1Thread1of1ForFork0_~i~0#1_126|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|) |v_thread1_#t~short2#1_209| (< |v_thread1Thread1of1ForFork0_~i~0#1_126| v_~N~0_135) (= v_~q3_front~0_178 (+ v_~q3_front~0_179 1)) (= (ite |v_thread1_#t~short2#1_210| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|) (< v_~q1_back~0_333 v_~n1~0_174) (<= 0 v_~q1_back~0_333) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118| 0))) InVars {~q1~0.offset=v_~q1~0.offset_192, ~n3~0=v_~n3~0_158, ~n1~0=v_~n1~0_174, ~N~0=v_~N~0_135, ~q3~0.offset=v_~q3~0.offset_169, ~q3_front~0=v_~q3_front~0_179, ~q3_back~0=v_~q3_back~0_250, ~q1_back~0=v_~q1_back~0_333, ~q1~0.base=v_~q1~0.base_193, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_127|, #memory_int=|v_#memory_int_539|, ~q3~0.base=v_~q3~0.base_169, ~r~0=v_~r~0_123} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_53|, ~q1~0.offset=v_~q1~0.offset_192, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_58|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_41|, ~n3~0=v_~n3~0_158, ~n1~0=v_~n1~0_174, ~N~0=v_~N~0_135, ~q3~0.offset=v_~q3~0.offset_169, ~q3_front~0=v_~q3_front~0_178, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, ~q3_back~0=v_~q3_back~0_250, ~q1_back~0=v_~q1_back~0_332, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_43|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_58|, ~q1~0.base=v_~q1~0.base_193, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_126|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|, #memory_int=|v_#memory_int_539|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_41|, ~q3~0.base=v_~q3~0.base_169, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_60|, ~r~0=v_~r~0_122} AuxVars[|v_thread1_#t~short2#1_210|, |v_thread1_#t~short2#1_209|] AssignedVars[thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_#t~short2#1, thread1Thread1of1ForFork0_#t~mem4#1, ~q3_front~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem1#1, ~r~0] [2022-12-06 07:38:40,064 WARN L322 ript$VariableManager]: TermVariable LBE105 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:40,064 WARN L322 ript$VariableManager]: TermVariable LBE484 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:40,064 WARN L322 ript$VariableManager]: TermVariable LBE19 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:40,064 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:40,064 WARN L322 ript$VariableManager]: TermVariable LBE514 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:40,065 WARN L322 ript$VariableManager]: TermVariable LBE524 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:40,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 07:38:40,271 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,SelfDestructingSolverStorable22 [2022-12-06 07:38:40,271 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread1_#t~short2#1_191 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:38:40,274 INFO L158 Benchmark]: Toolchain (without parser) took 213779.51ms. Allocated memory was 194.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 170.3MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 937.9MB. Max. memory is 8.0GB. [2022-12-06 07:38:40,274 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:38:40,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.45ms. Allocated memory is still 194.0MB. Free memory was 169.9MB in the beginning and 156.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 07:38:40,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.25ms. Allocated memory is still 194.0MB. Free memory was 156.2MB in the beginning and 153.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 07:38:40,275 INFO L158 Benchmark]: Boogie Preprocessor took 60.13ms. Allocated memory is still 194.0MB. Free memory was 153.6MB in the beginning and 151.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:38:40,275 INFO L158 Benchmark]: RCFGBuilder took 743.89ms. Allocated memory is still 194.0MB. Free memory was 151.5MB in the beginning and 110.6MB in the end (delta: 40.9MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-12-06 07:38:40,275 INFO L158 Benchmark]: TraceAbstraction took 212671.22ms. Allocated memory was 194.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 109.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 877.1MB. Max. memory is 8.0GB. [2022-12-06 07:38:40,276 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 194.0MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.45ms. Allocated memory is still 194.0MB. Free memory was 169.9MB in the beginning and 156.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.25ms. Allocated memory is still 194.0MB. Free memory was 156.2MB in the beginning and 153.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.13ms. Allocated memory is still 194.0MB. Free memory was 153.6MB in the beginning and 151.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 743.89ms. Allocated memory is still 194.0MB. Free memory was 151.5MB in the beginning and 110.6MB in the end (delta: 40.9MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 212671.22ms. Allocated memory was 194.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 109.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 877.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 220 PlacesBefore, 34 PlacesAfterwards, 232 TransitionsBefore, 31 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 35 ConcurrentYvCompositions, 14 ChoiceCompositions, 200 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 1198, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1108, independent: 1094, independent conditional: 0, independent unconditional: 1094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1108, independent: 1087, independent conditional: 0, independent unconditional: 1087, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1222, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1108, unknown conditional: 0, unknown unconditional: 1108] , Statistics on independence cache: Total cache size (in pairs): 1836, Positive cache size: 1822, Positive conditional cache size: 0, Positive unconditional cache size: 1822, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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, 31 PlacesBefore, 31 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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.4s, 35 PlacesBefore, 34 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 214 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): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 37 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 214 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): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 35 PlacesBefore, 34 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 210 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): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 35 PlacesBefore, 35 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 234 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): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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.7s, 41 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 234 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): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 38 PlacesBefore, 38 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 238 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): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 45 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 23, Positive conditional cache size: 6, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 50 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 210 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): 27, Positive cache size: 23, Positive conditional cache size: 6, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 54 PlacesBefore, 53 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 210 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): 27, Positive cache size: 23, Positive conditional cache size: 6, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 66 PlacesBefore, 62 PlacesAfterwards, 64 TransitionsBefore, 60 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 32, Positive conditional cache size: 15, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 64 PlacesBefore, 63 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 35, Positive conditional cache size: 18, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7s, 69 PlacesBefore, 70 PlacesAfterwards, 74 TransitionsBefore, 80 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 79 PlacesBefore, 79 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 344 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): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 81 PlacesBefore, 81 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 85 PlacesBefore, 85 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 352 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): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 89 PlacesBefore, 89 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 384 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): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 101 PlacesBefore, 101 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 488 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): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 110 PlacesBefore, 110 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 546 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): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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: 20.0s, 195 PlacesBefore, 188 PlacesAfterwards, 231 TransitionsBefore, 223 TransitionsAfterwards, 1110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 33, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 62, Positive conditional cache size: 45, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 181 PlacesBefore, 179 PlacesAfterwards, 224 TransitionsBefore, 222 TransitionsAfterwards, 1086 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 5, independent: 1, independent conditional: 1, 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): 70, Positive cache size: 66, Positive conditional cache size: 49, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 177 PlacesBefore, 178 PlacesAfterwards, 228 TransitionsBefore, 228 TransitionsAfterwards, 1136 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 74, Positive cache size: 70, Positive conditional cache size: 53, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread1_#t~short2#1_191 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread1_#t~short2#1_191 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:38:40,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...