/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:51:23,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:51:23,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:51:23,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:51:23,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:51:23,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:51:23,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:51:23,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:51:23,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:51:23,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:51:23,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:51:23,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:51:23,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:51:23,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:51:23,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:51:23,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:51:23,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:51:23,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:51:23,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:51:23,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:51:23,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:51:23,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:51:23,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:51:23,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:51:23,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:51:23,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:51:23,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:51:23,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:51:23,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:51:23,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:51:23,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:51:23,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:51:23,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:51:23,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:51:23,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:51:23,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:51:23,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:51:23,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:51:23,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:51:23,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:51:23,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:51:23,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 01:51:23,897 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:51:23,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:51:23,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:51:23,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:51:23,899 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:51:23,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:51:23,900 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:51:23,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:51:23,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:51:23,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:51:23,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:51:23,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:51:23,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:51:23,901 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:51:23,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:51:23,901 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:51:23,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:51:23,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:51:23,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:51:23,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:51:23,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:51:23,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:51:23,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:51:23,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:51:23,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:51:23,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:51:23,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:51:23,902 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:51:23,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 01:51:24,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:51:24,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:51:24,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:51:24,188 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:51:24,188 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:51:24,189 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2022-12-13 01:51:25,123 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:51:25,340 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:51:25,341 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2022-12-13 01:51:25,372 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d82badf27/ed8913f437a44f8e8fc11c27ef3008c2/FLAG4c97dbb01 [2022-12-13 01:51:25,383 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d82badf27/ed8913f437a44f8e8fc11c27ef3008c2 [2022-12-13 01:51:25,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:51:25,388 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:51:25,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:51:25,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:51:25,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:51:25,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e6ef55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25, skipping insertion in model container [2022-12-13 01:51:25,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:51:25,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:51:25,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,586 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-nondet.wvr.c[4085,4098] [2022-12-13 01:51:25,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:51:25,601 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:51:25,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:51:25,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:51:25,644 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-nondet.wvr.c[4085,4098] [2022-12-13 01:51:25,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:51:25,656 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:51:25,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25 WrapperNode [2022-12-13 01:51:25,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:51:25,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:51:25,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:51:25,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:51:25,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,691 INFO L138 Inliner]: procedures = 25, calls = 63, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 317 [2022-12-13 01:51:25,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:51:25,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:51:25,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:51:25,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:51:25,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,713 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:51:25,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:51:25,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:51:25,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:51:25,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (1/1) ... [2022-12-13 01:51:25,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:51:25,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:51:25,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 01:51:25,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 01:51:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:51:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:51:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:51:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:51:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:51:25,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:51:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:51:25,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:51:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 01:51:25,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 01:51:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:51:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 01:51:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 01:51:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 01:51:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:51:25,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:51:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:51:25,819 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:51:25,927 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:51:25,929 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:51:26,405 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:51:26,560 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:51:26,561 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 01:51:26,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:51:26 BoogieIcfgContainer [2022-12-13 01:51:26,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:51:26,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:51:26,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:51:26,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:51:26,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:51:25" (1/3) ... [2022-12-13 01:51:26,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759fa1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:51:26, skipping insertion in model container [2022-12-13 01:51:26,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:51:25" (2/3) ... [2022-12-13 01:51:26,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759fa1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:51:26, skipping insertion in model container [2022-12-13 01:51:26,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:51:26" (3/3) ... [2022-12-13 01:51:26,570 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c [2022-12-13 01:51:26,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:51:26,582 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:51:26,582 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:51:26,663 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 01:51:26,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 256 transitions, 536 flow [2022-12-13 01:51:26,808 INFO L130 PetriNetUnfolder]: 25/253 cut-off events. [2022-12-13 01:51:26,808 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:51:26,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 253 events. 25/253 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 206 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 215. Up to 4 conditions per place. [2022-12-13 01:51:26,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 256 transitions, 536 flow [2022-12-13 01:51:26,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 243 transitions, 504 flow [2022-12-13 01:51:26,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:26,849 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 243 transitions, 504 flow [2022-12-13 01:51:26,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 243 transitions, 504 flow [2022-12-13 01:51:26,898 INFO L130 PetriNetUnfolder]: 25/243 cut-off events. [2022-12-13 01:51:26,899 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:51:26,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 243 events. 25/243 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 215. Up to 4 conditions per place. [2022-12-13 01:51:26,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 243 transitions, 504 flow [2022-12-13 01:51:26,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 2820 [2022-12-13 01:51:36,164 INFO L241 LiptonReduction]: Total number of compositions: 210 [2022-12-13 01:51:36,175 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:51:36,186 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;@242ce19e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:51:36,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 01:51:36,201 INFO L130 PetriNetUnfolder]: 8/32 cut-off events. [2022-12-13 01:51:36,201 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:51:36,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:36,216 INFO L214 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-13 01:51:36,216 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-13 01:51:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:36,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1935456720, now seen corresponding path program 1 times [2022-12-13 01:51:36,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:36,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552134071] [2022-12-13 01:51:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:36,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:36,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:36,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552134071] [2022-12-13 01:51:36,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552134071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:36,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:36,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:51:36,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531951305] [2022-12-13 01:51:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:36,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:51:36,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:36,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:51:36,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:51:36,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-13 01:51:36,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 84 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-13 01:51:36,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:36,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-13 01:51:36,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:36,743 INFO L130 PetriNetUnfolder]: 472/693 cut-off events. [2022-12-13 01:51:36,744 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-13 01:51:36,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 693 events. 472/693 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2150 event pairs, 135 based on Foata normal form. 30/576 useless extension candidates. Maximal degree in co-relation 1219. Up to 449 conditions per place. [2022-12-13 01:51:36,753 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 40 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-13 01:51:36,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 198 flow [2022-12-13 01:51:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:51:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:51:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 01:51:36,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2022-12-13 01:51:36,765 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 84 flow. Second operand 3 states and 52 transitions. [2022-12-13 01:51:36,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 198 flow [2022-12-13 01:51:36,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 01:51:36,773 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 89 flow [2022-12-13 01:51:36,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2022-12-13 01:51:36,777 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-13 01:51:36,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:36,778 INFO L89 Accepts]: Start accepts. Operand has 32 places, 33 transitions, 89 flow [2022-12-13 01:51:36,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:36,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:36,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 89 flow [2022-12-13 01:51:36,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 89 flow [2022-12-13 01:51:36,785 INFO L130 PetriNetUnfolder]: 14/44 cut-off events. [2022-12-13 01:51:36,785 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:51:36,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 44 events. 14/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 45. Up to 17 conditions per place. [2022-12-13 01:51:36,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 89 flow [2022-12-13 01:51:36,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-13 01:51:36,828 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:51:36,829 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 01:51:36,829 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 89 flow [2022-12-13 01:51:36,829 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-13 01:51:36,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:36,829 INFO L214 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-13 01:51:36,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:51:36,830 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-13 01:51:36,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1141673692, now seen corresponding path program 1 times [2022-12-13 01:51:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:36,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670931694] [2022-12-13 01:51:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:36,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:37,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:37,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670931694] [2022-12-13 01:51:37,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670931694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:37,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:37,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:51:37,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872780613] [2022-12-13 01:51:37,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:37,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:51:37,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:37,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:51:37,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:51:37,015 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 01:51:37,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:37,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:37,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 01:51:37,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:37,139 INFO L130 PetriNetUnfolder]: 501/754 cut-off events. [2022-12-13 01:51:37,140 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-13 01:51:37,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 754 events. 501/754 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2341 event pairs, 344 based on Foata normal form. 26/630 useless extension candidates. Maximal degree in co-relation 631. Up to 691 conditions per place. [2022-12-13 01:51:37,143 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 31 selfloop transitions, 2 changer transitions 14/48 dead transitions. [2022-12-13 01:51:37,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 216 flow [2022-12-13 01:51:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:51:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:51:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 01:51:37,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2022-12-13 01:51:37,145 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 89 flow. Second operand 4 states and 52 transitions. [2022-12-13 01:51:37,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 216 flow [2022-12-13 01:51:37,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:51:37,147 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 104 flow [2022-12-13 01:51:37,147 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=4, PETRI_FLOW=104, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2022-12-13 01:51:37,148 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-13 01:51:37,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:37,148 INFO L89 Accepts]: Start accepts. Operand has 36 places, 34 transitions, 104 flow [2022-12-13 01:51:37,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:37,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:37,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 34 transitions, 104 flow [2022-12-13 01:51:37,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 104 flow [2022-12-13 01:51:37,157 INFO L130 PetriNetUnfolder]: 22/65 cut-off events. [2022-12-13 01:51:37,157 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:51:37,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 65 events. 22/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 165 event pairs, 4 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 100. Up to 17 conditions per place. [2022-12-13 01:51:37,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 34 transitions, 104 flow [2022-12-13 01:51:37,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 01:51:38,557 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:51:38,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1410 [2022-12-13 01:51:38,558 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 100 flow [2022-12-13 01:51:38,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:38,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:38,558 INFO L214 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-13 01:51:38,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:51:38,558 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-13 01:51:38,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:38,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1336645822, now seen corresponding path program 1 times [2022-12-13 01:51:38,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:38,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708422726] [2022-12-13 01:51:38,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:38,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:38,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708422726] [2022-12-13 01:51:38,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708422726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:38,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:38,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:51:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193588822] [2022-12-13 01:51:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:38,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:51:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:51:38,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:51:38,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 01:51:38,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:38,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:38,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 01:51:38,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:38,812 INFO L130 PetriNetUnfolder]: 759/1175 cut-off events. [2022-12-13 01:51:38,813 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2022-12-13 01:51:38,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1175 events. 759/1175 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4437 event pairs, 563 based on Foata normal form. 56/1041 useless extension candidates. Maximal degree in co-relation 2890. Up to 691 conditions per place. [2022-12-13 01:51:38,817 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 31 selfloop transitions, 2 changer transitions 35/69 dead transitions. [2022-12-13 01:51:38,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 69 transitions, 328 flow [2022-12-13 01:51:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:51:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:51:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-13 01:51:38,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-13 01:51:38,818 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 100 flow. Second operand 5 states and 75 transitions. [2022-12-13 01:51:38,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 69 transitions, 328 flow [2022-12-13 01:51:38,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 69 transitions, 320 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:51:38,820 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 114 flow [2022-12-13 01:51:38,820 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=5, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-13 01:51:38,820 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-13 01:51:38,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:38,820 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 114 flow [2022-12-13 01:51:38,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:38,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:38,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 114 flow [2022-12-13 01:51:38,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 114 flow [2022-12-13 01:51:38,827 INFO L130 PetriNetUnfolder]: 22/65 cut-off events. [2022-12-13 01:51:38,827 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 01:51:38,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 65 events. 22/65 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 164 event pairs, 4 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 103. Up to 17 conditions per place. [2022-12-13 01:51:38,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 34 transitions, 114 flow [2022-12-13 01:51:38,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 01:51:39,085 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:51:39,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 266 [2022-12-13 01:51:39,086 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 110 flow [2022-12-13 01:51:39,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:39,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:39,087 INFO L214 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-13 01:51:39,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:51:39,087 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-13 01:51:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:39,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1117791104, now seen corresponding path program 1 times [2022-12-13 01:51:39,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:39,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281989314] [2022-12-13 01:51:39,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:39,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:39,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:39,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281989314] [2022-12-13 01:51:39,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281989314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:39,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:39,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:51:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236162999] [2022-12-13 01:51:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:39,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:51:39,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:51:39,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:51:39,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 01:51:39,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:39,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:39,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 01:51:39,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:39,334 INFO L130 PetriNetUnfolder]: 835/1241 cut-off events. [2022-12-13 01:51:39,334 INFO L131 PetriNetUnfolder]: For 523/523 co-relation queries the response was YES. [2022-12-13 01:51:39,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3367 conditions, 1241 events. 835/1241 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4512 event pairs, 586 based on Foata normal form. 32/1034 useless extension candidates. Maximal degree in co-relation 3350. Up to 691 conditions per place. [2022-12-13 01:51:39,339 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 31 selfloop transitions, 2 changer transitions 22/56 dead transitions. [2022-12-13 01:51:39,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 295 flow [2022-12-13 01:51:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:51:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:51:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 01:51:39,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4596774193548387 [2022-12-13 01:51:39,340 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 110 flow. Second operand 4 states and 57 transitions. [2022-12-13 01:51:39,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 295 flow [2022-12-13 01:51:39,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 56 transitions, 267 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 01:51:39,342 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 108 flow [2022-12-13 01:51:39,342 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=4, PETRI_FLOW=108, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2022-12-13 01:51:39,343 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-13 01:51:39,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:39,343 INFO L89 Accepts]: Start accepts. Operand has 37 places, 34 transitions, 108 flow [2022-12-13 01:51:39,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:39,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:39,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 34 transitions, 108 flow [2022-12-13 01:51:39,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 108 flow [2022-12-13 01:51:39,350 INFO L130 PetriNetUnfolder]: 22/65 cut-off events. [2022-12-13 01:51:39,350 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:51:39,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 65 events. 22/65 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 166 event pairs, 4 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 104. Up to 17 conditions per place. [2022-12-13 01:51:39,351 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 34 transitions, 108 flow [2022-12-13 01:51:39,351 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 01:51:39,627 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:51:39,628 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 285 [2022-12-13 01:51:39,628 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 104 flow [2022-12-13 01:51:39,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:39,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:39,628 INFO L214 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-13 01:51:39,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:51:39,629 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-13 01:51:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash -272387452, now seen corresponding path program 1 times [2022-12-13 01:51:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:39,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913582691] [2022-12-13 01:51:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:39,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:39,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:39,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913582691] [2022-12-13 01:51:39,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913582691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:39,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:39,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:51:39,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524389257] [2022-12-13 01:51:39,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:39,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:51:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:39,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:51:39,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:51:39,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 01:51:39,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-13 01:51:39,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:39,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 01:51:39,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:39,933 INFO L130 PetriNetUnfolder]: 839/1273 cut-off events. [2022-12-13 01:51:39,933 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2022-12-13 01:51:39,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1273 events. 839/1273 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4833 event pairs, 317 based on Foata normal form. 1/1006 useless extension candidates. Maximal degree in co-relation 3303. Up to 645 conditions per place. [2022-12-13 01:51:39,937 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 46 selfloop transitions, 2 changer transitions 6/55 dead transitions. [2022-12-13 01:51:39,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 283 flow [2022-12-13 01:51:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:51:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:51:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-13 01:51:39,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2022-12-13 01:51:39,938 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 104 flow. Second operand 3 states and 54 transitions. [2022-12-13 01:51:39,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 283 flow [2022-12-13 01:51:39,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 55 transitions, 267 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 01:51:39,940 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 104 flow [2022-12-13 01:51:39,940 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=3, PETRI_FLOW=104, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2022-12-13 01:51:39,941 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-13 01:51:39,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:39,941 INFO L89 Accepts]: Start accepts. Operand has 35 places, 34 transitions, 104 flow [2022-12-13 01:51:39,942 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:39,942 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:39,942 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 34 transitions, 104 flow [2022-12-13 01:51:39,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 104 flow [2022-12-13 01:51:39,949 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2022-12-13 01:51:39,949 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:51:39,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 85 events. 24/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 283 event pairs, 8 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 100. Up to 23 conditions per place. [2022-12-13 01:51:39,950 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 34 transitions, 104 flow [2022-12-13 01:51:39,950 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 01:51:39,955 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:51:39,956 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 01:51:39,956 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 104 flow [2022-12-13 01:51:39,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-13 01:51:39,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:39,956 INFO L214 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-13 01:51:39,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:51:39,956 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-13 01:51:39,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:39,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1843002909, now seen corresponding path program 1 times [2022-12-13 01:51:39,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:39,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382073330] [2022-12-13 01:51:39,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:39,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:40,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:40,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382073330] [2022-12-13 01:51:40,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382073330] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:51:40,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226277167] [2022-12-13 01:51:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:40,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:51:40,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:51:40,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:51:40,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 01:51:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:40,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:51:40,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:51:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:40,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:51:40,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226277167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:40,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:51:40,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-12-13 01:51:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559411304] [2022-12-13 01:51:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:40,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:51:40,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:40,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:51:40,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:51:40,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:51:40,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-13 01:51:40,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:40,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:51:40,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:40,662 INFO L130 PetriNetUnfolder]: 687/1042 cut-off events. [2022-12-13 01:51:40,662 INFO L131 PetriNetUnfolder]: For 197/197 co-relation queries the response was YES. [2022-12-13 01:51:40,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 1042 events. 687/1042 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3679 event pairs, 219 based on Foata normal form. 24/869 useless extension candidates. Maximal degree in co-relation 1085. Up to 913 conditions per place. [2022-12-13 01:51:40,667 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 41 selfloop transitions, 2 changer transitions 1/44 dead transitions. [2022-12-13 01:51:40,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 218 flow [2022-12-13 01:51:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:51:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:51:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 01:51:40,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2022-12-13 01:51:40,668 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 104 flow. Second operand 3 states and 43 transitions. [2022-12-13 01:51:40,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 218 flow [2022-12-13 01:51:40,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:51:40,669 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 112 flow [2022-12-13 01:51:40,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2022-12-13 01:51:40,670 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-13 01:51:40,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:40,670 INFO L89 Accepts]: Start accepts. Operand has 37 places, 34 transitions, 112 flow [2022-12-13 01:51:40,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:40,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:40,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 34 transitions, 112 flow [2022-12-13 01:51:40,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 112 flow [2022-12-13 01:51:40,680 INFO L130 PetriNetUnfolder]: 38/87 cut-off events. [2022-12-13 01:51:40,680 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 01:51:40,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 87 events. 38/87 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 204 event pairs, 4 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 148. Up to 49 conditions per place. [2022-12-13 01:51:40,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 34 transitions, 112 flow [2022-12-13 01:51:40,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 01:51:40,695 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:51:40,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 01:51:40,696 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 112 flow [2022-12-13 01:51:40,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-13 01:51:40,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:40,696 INFO L214 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-13 01:51:40,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 01:51:40,900 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-13 01:51:40,901 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-13 01:51:40,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:40,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1446430485, now seen corresponding path program 2 times [2022-12-13 01:51:40,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:40,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115817231] [2022-12-13 01:51:40,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:40,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:41,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:41,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115817231] [2022-12-13 01:51:41,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115817231] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:51:41,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647913665] [2022-12-13 01:51:41,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:51:41,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:51:41,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:51:41,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:51:41,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 01:51:41,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:51:41,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:51:41,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 01:51:41,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:51:41,601 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 152 treesize of output 144 [2022-12-13 01:51:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:41,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:51:41,762 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 182 treesize of output 174 [2022-12-13 01:51:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:41,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647913665] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:51:41,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:51:41,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2022-12-13 01:51:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840537441] [2022-12-13 01:51:41,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:51:41,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:51:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:41,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:51:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-13 01:51:41,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:51:41,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 112 flow. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:41,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:41,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:51:41,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:42,731 INFO L130 PetriNetUnfolder]: 2286/3379 cut-off events. [2022-12-13 01:51:42,731 INFO L131 PetriNetUnfolder]: For 1268/1268 co-relation queries the response was YES. [2022-12-13 01:51:42,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9370 conditions, 3379 events. 2286/3379 cut-off events. For 1268/1268 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14940 event pairs, 202 based on Foata normal form. 61/2908 useless extension candidates. Maximal degree in co-relation 2551. Up to 1053 conditions per place. [2022-12-13 01:51:42,743 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 183 selfloop transitions, 23 changer transitions 53/259 dead transitions. [2022-12-13 01:51:42,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 259 transitions, 1334 flow [2022-12-13 01:51:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 01:51:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 01:51:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 244 transitions. [2022-12-13 01:51:42,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2022-12-13 01:51:42,745 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 112 flow. Second operand 20 states and 244 transitions. [2022-12-13 01:51:42,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 259 transitions, 1334 flow [2022-12-13 01:51:42,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 259 transitions, 1320 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:51:42,748 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 309 flow [2022-12-13 01:51:42,748 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=309, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2022-12-13 01:51:42,749 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2022-12-13 01:51:42,749 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:42,749 INFO L89 Accepts]: Start accepts. Operand has 67 places, 55 transitions, 309 flow [2022-12-13 01:51:42,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:42,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:42,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 55 transitions, 309 flow [2022-12-13 01:51:42,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 55 transitions, 309 flow [2022-12-13 01:51:42,771 INFO L130 PetriNetUnfolder]: 93/229 cut-off events. [2022-12-13 01:51:42,771 INFO L131 PetriNetUnfolder]: For 378/385 co-relation queries the response was YES. [2022-12-13 01:51:42,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 229 events. 93/229 cut-off events. For 378/385 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 903 event pairs, 10 based on Foata normal form. 2/169 useless extension candidates. Maximal degree in co-relation 582. Up to 111 conditions per place. [2022-12-13 01:51:42,773 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 55 transitions, 309 flow [2022-12-13 01:51:42,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 564 [2022-12-13 01:51:47,279 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:51:47,280 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4531 [2022-12-13 01:51:47,280 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 321 flow [2022-12-13 01:51:47,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:51:47,280 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:47,280 INFO L214 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, 1, 1, 1] [2022-12-13 01:51:47,301 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-13 01:51:47,481 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,SelfDestructingSolverStorable6 [2022-12-13 01:51:47,481 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-13 01:51:47,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:47,482 INFO L85 PathProgramCache]: Analyzing trace with hash -838217808, now seen corresponding path program 1 times [2022-12-13 01:51:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:47,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342226207] [2022-12-13 01:51:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:47,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:51:47,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:47,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342226207] [2022-12-13 01:51:47,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342226207] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:51:47,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672138093] [2022-12-13 01:51:47,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:47,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:51:47,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:51:47,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:51:47,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 01:51:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:47,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 01:51:47,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:51:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 01:51:47,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:51:47,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672138093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:47,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:51:47,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-13 01:51:47,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674697981] [2022-12-13 01:51:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:47,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:51:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:47,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:51:47,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:51:47,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 01:51:47,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 6.25) 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-13 01:51:47,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:47,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 01:51:47,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:48,135 INFO L130 PetriNetUnfolder]: 1105/1675 cut-off events. [2022-12-13 01:51:48,135 INFO L131 PetriNetUnfolder]: For 5158/5158 co-relation queries the response was YES. [2022-12-13 01:51:48,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5847 conditions, 1675 events. 1105/1675 cut-off events. For 5158/5158 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6326 event pairs, 629 based on Foata normal form. 120/1573 useless extension candidates. Maximal degree in co-relation 5822. Up to 973 conditions per place. [2022-12-13 01:51:48,142 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 36 selfloop transitions, 0 changer transitions 37/73 dead transitions. [2022-12-13 01:51:48,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 510 flow [2022-12-13 01:51:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:51:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:51:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-13 01:51:48,143 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-13 01:51:48,143 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 321 flow. Second operand 4 states and 64 transitions. [2022-12-13 01:51:48,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 510 flow [2022-12-13 01:51:48,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 442 flow, removed 28 selfloop flow, removed 7 redundant places. [2022-12-13 01:51:48,151 INFO L231 Difference]: Finished difference. Result has 58 places, 36 transitions, 145 flow [2022-12-13 01:51:48,151 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=58, PETRI_TRANSITIONS=36} [2022-12-13 01:51:48,153 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2022-12-13 01:51:48,154 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:48,154 INFO L89 Accepts]: Start accepts. Operand has 58 places, 36 transitions, 145 flow [2022-12-13 01:51:48,155 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:48,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:48,156 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 36 transitions, 145 flow [2022-12-13 01:51:48,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 145 flow [2022-12-13 01:51:48,165 INFO L130 PetriNetUnfolder]: 40/90 cut-off events. [2022-12-13 01:51:48,165 INFO L131 PetriNetUnfolder]: For 87/89 co-relation queries the response was YES. [2022-12-13 01:51:48,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 90 events. 40/90 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 198 event pairs, 4 based on Foata normal form. 2/66 useless extension candidates. Maximal degree in co-relation 208. Up to 49 conditions per place. [2022-12-13 01:51:48,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 36 transitions, 145 flow [2022-12-13 01:51:48,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 01:51:48,167 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:51:48,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 01:51:48,168 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 145 flow [2022-12-13 01:51:48,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) 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-13 01:51:48,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:48,168 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:51:48,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 01:51:48,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:51:48,374 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-13 01:51:48,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2003955004, now seen corresponding path program 1 times [2022-12-13 01:51:48,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:48,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111921953] [2022-12-13 01:51:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:51:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:48,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111921953] [2022-12-13 01:51:48,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111921953] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:51:48,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87591512] [2022-12-13 01:51:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:48,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:51:48,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:51:48,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:51:48,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 01:51:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:49,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 01:51:49,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:51:50,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:51:50,003 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 268 treesize of output 430 [2022-12-13 01:53:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:53:14,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:53:14,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:53:14,849 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 26 treesize of output 9 [2022-12-13 01:53:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:53:14,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87591512] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:53:14,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:53:14,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 25 [2022-12-13 01:53:14,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197147376] [2022-12-13 01:53:14,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:53:14,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 01:53:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:53:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 01:53:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2022-12-13 01:53:14,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:53:14,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 145 flow. Second operand has 25 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:53:14,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:53:14,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:53:14,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:53:25,915 INFO L130 PetriNetUnfolder]: 5964/8457 cut-off events. [2022-12-13 01:53:25,915 INFO L131 PetriNetUnfolder]: For 24200/24200 co-relation queries the response was YES. [2022-12-13 01:53:25,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29687 conditions, 8457 events. 5964/8457 cut-off events. For 24200/24200 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 40139 event pairs, 198 based on Foata normal form. 183/7036 useless extension candidates. Maximal degree in co-relation 23107. Up to 3201 conditions per place. [2022-12-13 01:53:25,961 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 498 selfloop transitions, 213 changer transitions 114/825 dead transitions. [2022-12-13 01:53:25,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 825 transitions, 5473 flow [2022-12-13 01:53:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-12-13 01:53:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2022-12-13 01:53:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 786 transitions. [2022-12-13 01:53:25,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32094732543895466 [2022-12-13 01:53:25,965 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 145 flow. Second operand 79 states and 786 transitions. [2022-12-13 01:53:25,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 825 transitions, 5473 flow [2022-12-13 01:53:26,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 825 transitions, 4817 flow, removed 328 selfloop flow, removed 8 redundant places. [2022-12-13 01:53:26,083 INFO L231 Difference]: Finished difference. Result has 147 places, 281 transitions, 2149 flow [2022-12-13 01:53:26,083 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=2149, PETRI_PLACES=147, PETRI_TRANSITIONS=281} [2022-12-13 01:53:26,083 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 112 predicate places. [2022-12-13 01:53:26,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:53:26,083 INFO L89 Accepts]: Start accepts. Operand has 147 places, 281 transitions, 2149 flow [2022-12-13 01:53:26,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:53:26,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:53:26,086 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 281 transitions, 2149 flow [2022-12-13 01:53:26,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 281 transitions, 2149 flow [2022-12-13 01:53:26,240 INFO L130 PetriNetUnfolder]: 846/1587 cut-off events. [2022-12-13 01:53:26,240 INFO L131 PetriNetUnfolder]: For 28256/28301 co-relation queries the response was YES. [2022-12-13 01:53:26,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9554 conditions, 1587 events. 846/1587 cut-off events. For 28256/28301 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9047 event pairs, 5 based on Foata normal form. 14/1277 useless extension candidates. Maximal degree in co-relation 9484. Up to 573 conditions per place. [2022-12-13 01:53:26,260 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 281 transitions, 2149 flow [2022-12-13 01:53:26,260 INFO L226 LiptonReduction]: Number of co-enabled transitions 1992 [2022-12-13 01:53:26,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [896] L82-2-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q1_front~0_41 v_~q1_back~0_58) (< v_~q1_front~0_41 v_~n1~0_17) (<= 0 v_~q1_front~0_41)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select (select |v_#memory_int_93| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_front~0_41))) |v_thread2Thread1of1ForFork2_~j~0#1_19|) (= (+ v_~q1_front~0_41 1) v_~q1_front~0_40) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_front~0=v_~q1_front~0_41, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_5|, ~q1~0.offset=v_~q1~0.offset_24, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~0#1] [2022-12-13 01:53:27,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [896] L82-2-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q1_front~0_41 v_~q1_back~0_58) (< v_~q1_front~0_41 v_~n1~0_17) (<= 0 v_~q1_front~0_41)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select (select |v_#memory_int_93| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_front~0_41))) |v_thread2Thread1of1ForFork2_~j~0#1_19|) (= (+ v_~q1_front~0_41 1) v_~q1_front~0_40) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_front~0=v_~q1_front~0_41, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_5|, ~q1~0.offset=v_~q1~0.offset_24, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~0#1] [2022-12-13 01:53:28,365 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1082] L149-4-->L150-3: Formula: (and (= |v_#pthreadsForks_53| |v_ULTIMATE.start_main_#t~pre33#1_23|) (= (store |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre33#1_23|)) |v_#memory_int_193|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_194|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_17|, #pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_193|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_9|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-13 01:53:28,606 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1109] L104-2-->L104-2: Formula: (and (<= 0 v_~q3_back~0_123) (= |v_thread3Thread1of1ForFork0_~k~0#1_43| (select (select |v_#memory_int_245| v_~q2~0.base_93) (+ v_~q2~0.offset_93 (* v_~q2_front~0_113 4)))) (not (= (ite (and (< v_~q2_front~0_113 v_~n2~0_104) (<= 0 v_~q2_front~0_113) (< v_~q2_front~0_113 v_~q2_back~0_134)) 1 0) 0)) |v_thread3_#t~short17#1_85| (= v_~q3_back~0_122 (+ v_~q3_back~0_123 1)) (= v_~q2_front~0_112 (+ v_~q2_front~0_113 1)) (= |v_thread3Thread1of1ForFork0_~t~0#1_47| (+ |v_thread3Thread1of1ForFork0_~t~0#1_48| |v_thread3Thread1of1ForFork0_~k~0#1_43|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33| (ite |v_thread3_#t~short17#1_86| 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|) (not (<= |v_thread3Thread1of1ForFork0_~k~0#1_43| 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| 0)) (< v_~q3_back~0_123 v_~n3~0_86) (= (+ (select (select |v_#memory_int_245| v_~q3~0.base_67) (+ (* 4 v_~q3_back~0_123) v_~q3~0.offset_67)) 1) |v_thread3Thread1of1ForFork0_~k~0#1_43|)) InVars {~q3_back~0=v_~q3_back~0_123, ~n2~0=v_~n2~0_104, ~n3~0=v_~n3~0_86, ~q2~0.offset=v_~q2~0.offset_93, #memory_int=|v_#memory_int_245|, ~q3~0.base=v_~q3~0.base_67, ~q2_front~0=v_~q2_front~0_113, ~q2~0.base=v_~q2~0.base_93, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_48|, ~q3~0.offset=v_~q3~0.offset_67, ~q2_back~0=v_~q2_back~0_134} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|, ~n2~0=v_~n2~0_104, ~n3~0=v_~n3~0_86, thread3Thread1of1ForFork0_#t~short17#1=|v_thread3Thread1of1ForFork0_#t~short17#1_25|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|, ~q2~0.offset=v_~q2~0.offset_93, ~q2_front~0=v_~q2_front~0_112, ~q3~0.offset=v_~q3~0.offset_67, thread3Thread1of1ForFork0_#t~post18#1=|v_thread3Thread1of1ForFork0_#t~post18#1_25|, thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_29|, ~q3_back~0=v_~q3_back~0_122, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_25|, #memory_int=|v_#memory_int_245|, ~q3~0.base=v_~q3~0.base_67, ~q2~0.base=v_~q2~0.base_93, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_47|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_43|, thread3Thread1of1ForFork0_#t~mem14#1=|v_thread3Thread1of1ForFork0_#t~mem14#1_25|, ~q2_back~0=v_~q2_back~0_134} AuxVars[|v_thread3_#t~short17#1_86|, |v_thread3_#t~short17#1_85|] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, ~q3_back~0, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~short17#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~q2_front~0, thread3Thread1of1ForFork0_~t~0#1, thread3Thread1of1ForFork0_~k~0#1, thread3Thread1of1ForFork0_#t~mem14#1, thread3Thread1of1ForFork0_#t~post18#1] [2022-12-13 01:53:28,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1124] L104-2-->thread3EXIT: Formula: (and (= (ite |v_thread3_#t~short17#1_93| 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ v_~q3_back~0_In_3 1) v_~q3_back~0_Out_6) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_~t~0#1_Out_2| (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| |v_thread3Thread1of1ForFork0_~t~0#1_In_1|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) |v_thread3_#t~short17#1_94| (<= 0 v_~q3_back~0_In_3) (not (= (ite (and (< v_~q2_front~0_In_1 v_~q2_back~0_In_3) (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_9| v_~q2~0.base_In_3) (+ v_~q2~0.offset_In_3 (* v_~q2_front~0_In_1 4)))) (< v_~q3_back~0_In_3 v_~n3~0_In_1) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (+ (select (select |v_#memory_int_In_9| v_~q3~0.base_In_3) (+ (* v_~q3_back~0_In_3 4) v_~q3~0.offset_In_3)) 1)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (<= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0)) InVars {~n2~0=v_~n2~0_In_3, ~n3~0=v_~n3~0_In_1, ~q2~0.offset=v_~q2~0.offset_In_3, ~q2_front~0=v_~q2_front~0_In_1, ~q3~0.offset=v_~q3~0.offset_In_3, ~q3_back~0=v_~q3_back~0_In_3, #memory_int=|v_#memory_int_In_9|, ~q3~0.base=v_~q3~0.base_In_3, ~q2~0.base=v_~q2~0.base_In_3, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_In_1|, ~q2_back~0=v_~q2_back~0_In_3} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~n3~0=v_~n3~0_In_1, thread3Thread1of1ForFork0_#t~short17#1=|v_thread3Thread1of1ForFork0_#t~short17#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_3, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, ~q3~0.offset=v_~q3~0.offset_In_3, thread3Thread1of1ForFork0_#t~post18#1=|v_thread3Thread1of1ForFork0_#t~post18#1_Out_2|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_Out_2|, ~q3_back~0=v_~q3_back~0_Out_6, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_Out_2|, #memory_int=|v_#memory_int_In_9|, ~q3~0.base=v_~q3~0.base_In_3, ~q2~0.base=v_~q2~0.base_In_3, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_Out_2|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, thread3Thread1of1ForFork0_#t~mem14#1=|v_thread3Thread1of1ForFork0_#t~mem14#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_3} AuxVars[|v_thread3_#t~short17#1_94|, |v_thread3_#t~short17#1_93|] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~short17#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~q2_front~0, thread3Thread1of1ForFork0_#t~post18#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem16#1, ~q3_back~0, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_~t~0#1, thread3Thread1of1ForFork0_~k~0#1, thread3Thread1of1ForFork0_#t~mem14#1] [2022-12-13 01:53:29,538 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L56-->L57: Formula: (= (select (select |v_#memory_int_1| v_~q1~0.base_1) (+ v_~q1~0.offset_1 (* 4 v_~q1_back~0_2))) |v_thread1Thread1of1ForFork1_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} OutVars{#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] and [1115] L148-3-->L149-3: Formula: (and (= (store |v_#memory_int_254| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_254| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre31#1_41|)) |v_#memory_int_253|) (= |v_#pthreadsForks_70| (+ |v_#pthreadsForks_71| 1)) (= |v_#pthreadsForks_71| |v_ULTIMATE.start_main_#t~pre31#1_41|)) InVars {#pthreadsForks=|v_#pthreadsForks_71|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_254|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_41|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_43|, #pthreadsForks=|v_#pthreadsForks_70|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_253|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, #memory_int] [2022-12-13 01:53:29,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L56-->L57: Formula: (= (select (select |v_#memory_int_1| v_~q1~0.base_1) (+ v_~q1~0.offset_1 (* 4 v_~q1_back~0_2))) |v_thread1Thread1of1ForFork1_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} OutVars{#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] and [1082] L149-4-->L150-3: Formula: (and (= |v_#pthreadsForks_53| |v_ULTIMATE.start_main_#t~pre33#1_23|) (= (store |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre33#1_23|)) |v_#memory_int_193|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_194|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_17|, #pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_193|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_9|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-13 01:53:29,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L56-->L57: Formula: (= (select (select |v_#memory_int_1| v_~q1~0.base_1) (+ v_~q1~0.offset_1 (* 4 v_~q1_back~0_2))) |v_thread1Thread1of1ForFork1_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} OutVars{#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] and [1109] L104-2-->L104-2: Formula: (and (<= 0 v_~q3_back~0_123) (= |v_thread3Thread1of1ForFork0_~k~0#1_43| (select (select |v_#memory_int_245| v_~q2~0.base_93) (+ v_~q2~0.offset_93 (* v_~q2_front~0_113 4)))) (not (= (ite (and (< v_~q2_front~0_113 v_~n2~0_104) (<= 0 v_~q2_front~0_113) (< v_~q2_front~0_113 v_~q2_back~0_134)) 1 0) 0)) |v_thread3_#t~short17#1_85| (= v_~q3_back~0_122 (+ v_~q3_back~0_123 1)) (= v_~q2_front~0_112 (+ v_~q2_front~0_113 1)) (= |v_thread3Thread1of1ForFork0_~t~0#1_47| (+ |v_thread3Thread1of1ForFork0_~t~0#1_48| |v_thread3Thread1of1ForFork0_~k~0#1_43|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33| (ite |v_thread3_#t~short17#1_86| 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|) (not (<= |v_thread3Thread1of1ForFork0_~k~0#1_43| 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| 0)) (< v_~q3_back~0_123 v_~n3~0_86) (= (+ (select (select |v_#memory_int_245| v_~q3~0.base_67) (+ (* 4 v_~q3_back~0_123) v_~q3~0.offset_67)) 1) |v_thread3Thread1of1ForFork0_~k~0#1_43|)) InVars {~q3_back~0=v_~q3_back~0_123, ~n2~0=v_~n2~0_104, ~n3~0=v_~n3~0_86, ~q2~0.offset=v_~q2~0.offset_93, #memory_int=|v_#memory_int_245|, ~q3~0.base=v_~q3~0.base_67, ~q2_front~0=v_~q2_front~0_113, ~q2~0.base=v_~q2~0.base_93, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_48|, ~q3~0.offset=v_~q3~0.offset_67, ~q2_back~0=v_~q2_back~0_134} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|, ~n2~0=v_~n2~0_104, ~n3~0=v_~n3~0_86, thread3Thread1of1ForFork0_#t~short17#1=|v_thread3Thread1of1ForFork0_#t~short17#1_25|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|, ~q2~0.offset=v_~q2~0.offset_93, ~q2_front~0=v_~q2_front~0_112, ~q3~0.offset=v_~q3~0.offset_67, thread3Thread1of1ForFork0_#t~post18#1=|v_thread3Thread1of1ForFork0_#t~post18#1_25|, thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_29|, ~q3_back~0=v_~q3_back~0_122, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_25|, #memory_int=|v_#memory_int_245|, ~q3~0.base=v_~q3~0.base_67, ~q2~0.base=v_~q2~0.base_93, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_47|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_43|, thread3Thread1of1ForFork0_#t~mem14#1=|v_thread3Thread1of1ForFork0_#t~mem14#1_25|, ~q2_back~0=v_~q2_back~0_134} AuxVars[|v_thread3_#t~short17#1_86|, |v_thread3_#t~short17#1_85|] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, ~q3_back~0, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~short17#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~q2_front~0, thread3Thread1of1ForFork0_~t~0#1, thread3Thread1of1ForFork0_~k~0#1, thread3Thread1of1ForFork0_#t~mem14#1, thread3Thread1of1ForFork0_#t~post18#1] [2022-12-13 01:53:29,675 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L56-->L57: Formula: (= (select (select |v_#memory_int_1| v_~q1~0.base_1) (+ v_~q1~0.offset_1 (* 4 v_~q1_back~0_2))) |v_thread1Thread1of1ForFork1_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} OutVars{#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] and [1124] L104-2-->thread3EXIT: Formula: (and (= (ite |v_thread3_#t~short17#1_93| 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ v_~q3_back~0_In_3 1) v_~q3_back~0_Out_6) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_~t~0#1_Out_2| (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| |v_thread3Thread1of1ForFork0_~t~0#1_In_1|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) |v_thread3_#t~short17#1_94| (<= 0 v_~q3_back~0_In_3) (not (= (ite (and (< v_~q2_front~0_In_1 v_~q2_back~0_In_3) (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_9| v_~q2~0.base_In_3) (+ v_~q2~0.offset_In_3 (* v_~q2_front~0_In_1 4)))) (< v_~q3_back~0_In_3 v_~n3~0_In_1) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (+ (select (select |v_#memory_int_In_9| v_~q3~0.base_In_3) (+ (* v_~q3_back~0_In_3 4) v_~q3~0.offset_In_3)) 1)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (<= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0)) InVars {~n2~0=v_~n2~0_In_3, ~n3~0=v_~n3~0_In_1, ~q2~0.offset=v_~q2~0.offset_In_3, ~q2_front~0=v_~q2_front~0_In_1, ~q3~0.offset=v_~q3~0.offset_In_3, ~q3_back~0=v_~q3_back~0_In_3, #memory_int=|v_#memory_int_In_9|, ~q3~0.base=v_~q3~0.base_In_3, ~q2~0.base=v_~q2~0.base_In_3, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_In_1|, ~q2_back~0=v_~q2_back~0_In_3} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~n3~0=v_~n3~0_In_1, thread3Thread1of1ForFork0_#t~short17#1=|v_thread3Thread1of1ForFork0_#t~short17#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_3, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, ~q3~0.offset=v_~q3~0.offset_In_3, thread3Thread1of1ForFork0_#t~post18#1=|v_thread3Thread1of1ForFork0_#t~post18#1_Out_2|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_Out_2|, ~q3_back~0=v_~q3_back~0_Out_6, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_Out_2|, #memory_int=|v_#memory_int_In_9|, ~q3~0.base=v_~q3~0.base_In_3, ~q2~0.base=v_~q2~0.base_In_3, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_Out_2|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, thread3Thread1of1ForFork0_#t~mem14#1=|v_thread3Thread1of1ForFork0_#t~mem14#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_3} AuxVars[|v_thread3_#t~short17#1_94|, |v_thread3_#t~short17#1_93|] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~short17#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~q2_front~0, thread3Thread1of1ForFork0_#t~post18#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem16#1, ~q3_back~0, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_~t~0#1, thread3Thread1of1ForFork0_~k~0#1, thread3Thread1of1ForFork0_#t~mem14#1] [2022-12-13 01:53:29,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L56-->L57: Formula: (= (select (select |v_#memory_int_1| v_~q1~0.base_1) (+ v_~q1~0.offset_1 (* 4 v_~q1_back~0_2))) |v_thread1Thread1of1ForFork1_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} OutVars{#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] and [1124] L104-2-->thread3EXIT: Formula: (and (= (ite |v_thread3_#t~short17#1_93| 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ v_~q3_back~0_In_3 1) v_~q3_back~0_Out_6) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_~t~0#1_Out_2| (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| |v_thread3Thread1of1ForFork0_~t~0#1_In_1|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) |v_thread3_#t~short17#1_94| (<= 0 v_~q3_back~0_In_3) (not (= (ite (and (< v_~q2_front~0_In_1 v_~q2_back~0_In_3) (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_9| v_~q2~0.base_In_3) (+ v_~q2~0.offset_In_3 (* v_~q2_front~0_In_1 4)))) (< v_~q3_back~0_In_3 v_~n3~0_In_1) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (+ (select (select |v_#memory_int_In_9| v_~q3~0.base_In_3) (+ (* v_~q3_back~0_In_3 4) v_~q3~0.offset_In_3)) 1)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (<= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0)) InVars {~n2~0=v_~n2~0_In_3, ~n3~0=v_~n3~0_In_1, ~q2~0.offset=v_~q2~0.offset_In_3, ~q2_front~0=v_~q2_front~0_In_1, ~q3~0.offset=v_~q3~0.offset_In_3, ~q3_back~0=v_~q3_back~0_In_3, #memory_int=|v_#memory_int_In_9|, ~q3~0.base=v_~q3~0.base_In_3, ~q2~0.base=v_~q2~0.base_In_3, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_In_1|, ~q2_back~0=v_~q2_back~0_In_3} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~n3~0=v_~n3~0_In_1, thread3Thread1of1ForFork0_#t~short17#1=|v_thread3Thread1of1ForFork0_#t~short17#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_3, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, ~q3~0.offset=v_~q3~0.offset_In_3, thread3Thread1of1ForFork0_#t~post18#1=|v_thread3Thread1of1ForFork0_#t~post18#1_Out_2|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_Out_2|, ~q3_back~0=v_~q3_back~0_Out_6, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_Out_2|, #memory_int=|v_#memory_int_In_9|, ~q3~0.base=v_~q3~0.base_In_3, ~q2~0.base=v_~q2~0.base_In_3, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_Out_2|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, thread3Thread1of1ForFork0_#t~mem14#1=|v_thread3Thread1of1ForFork0_#t~mem14#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_3} AuxVars[|v_thread3_#t~short17#1_94|, |v_thread3_#t~short17#1_93|] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~short17#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~q2_front~0, thread3Thread1of1ForFork0_#t~post18#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem16#1, ~q3_back~0, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_~t~0#1, thread3Thread1of1ForFork0_~k~0#1, thread3Thread1of1ForFork0_#t~mem14#1] [2022-12-13 01:53:30,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L56-->L57: Formula: (= (select (select |v_#memory_int_1| v_~q1~0.base_1) (+ v_~q1~0.offset_1 (* 4 v_~q1_back~0_2))) |v_thread1Thread1of1ForFork1_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} OutVars{#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] and [1109] L104-2-->L104-2: Formula: (and (<= 0 v_~q3_back~0_123) (= |v_thread3Thread1of1ForFork0_~k~0#1_43| (select (select |v_#memory_int_245| v_~q2~0.base_93) (+ v_~q2~0.offset_93 (* v_~q2_front~0_113 4)))) (not (= (ite (and (< v_~q2_front~0_113 v_~n2~0_104) (<= 0 v_~q2_front~0_113) (< v_~q2_front~0_113 v_~q2_back~0_134)) 1 0) 0)) |v_thread3_#t~short17#1_85| (= v_~q3_back~0_122 (+ v_~q3_back~0_123 1)) (= v_~q2_front~0_112 (+ v_~q2_front~0_113 1)) (= |v_thread3Thread1of1ForFork0_~t~0#1_47| (+ |v_thread3Thread1of1ForFork0_~t~0#1_48| |v_thread3Thread1of1ForFork0_~k~0#1_43|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33| (ite |v_thread3_#t~short17#1_86| 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|) (not (<= |v_thread3Thread1of1ForFork0_~k~0#1_43| 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| 0)) (< v_~q3_back~0_123 v_~n3~0_86) (= (+ (select (select |v_#memory_int_245| v_~q3~0.base_67) (+ (* 4 v_~q3_back~0_123) v_~q3~0.offset_67)) 1) |v_thread3Thread1of1ForFork0_~k~0#1_43|)) InVars {~q3_back~0=v_~q3_back~0_123, ~n2~0=v_~n2~0_104, ~n3~0=v_~n3~0_86, ~q2~0.offset=v_~q2~0.offset_93, #memory_int=|v_#memory_int_245|, ~q3~0.base=v_~q3~0.base_67, ~q2_front~0=v_~q2_front~0_113, ~q2~0.base=v_~q2~0.base_93, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_48|, ~q3~0.offset=v_~q3~0.offset_67, ~q2_back~0=v_~q2_back~0_134} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|, ~n2~0=v_~n2~0_104, ~n3~0=v_~n3~0_86, thread3Thread1of1ForFork0_#t~short17#1=|v_thread3Thread1of1ForFork0_#t~short17#1_25|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|, ~q2~0.offset=v_~q2~0.offset_93, ~q2_front~0=v_~q2_front~0_112, ~q3~0.offset=v_~q3~0.offset_67, thread3Thread1of1ForFork0_#t~post18#1=|v_thread3Thread1of1ForFork0_#t~post18#1_25|, thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_29|, ~q3_back~0=v_~q3_back~0_122, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_25|, #memory_int=|v_#memory_int_245|, ~q3~0.base=v_~q3~0.base_67, ~q2~0.base=v_~q2~0.base_93, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_47|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_43|, thread3Thread1of1ForFork0_#t~mem14#1=|v_thread3Thread1of1ForFork0_#t~mem14#1_25|, ~q2_back~0=v_~q2_back~0_134} AuxVars[|v_thread3_#t~short17#1_86|, |v_thread3_#t~short17#1_85|] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, ~q3_back~0, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~short17#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~q2_front~0, thread3Thread1of1ForFork0_~t~0#1, thread3Thread1of1ForFork0_~k~0#1, thread3Thread1of1ForFork0_#t~mem14#1, thread3Thread1of1ForFork0_#t~post18#1] [2022-12-13 01:53:30,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L56-->L57: Formula: (= (select (select |v_#memory_int_1| v_~q1~0.base_1) (+ v_~q1~0.offset_1 (* 4 v_~q1_back~0_2))) |v_thread1Thread1of1ForFork1_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} OutVars{#memory_int=|v_#memory_int_1|, ~q1~0.offset=v_~q1~0.offset_1, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~q1_back~0=v_~q1_back~0_2, ~q1~0.base=v_~q1~0.base_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] and [1082] L149-4-->L150-3: Formula: (and (= |v_#pthreadsForks_53| |v_ULTIMATE.start_main_#t~pre33#1_23|) (= (store |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre33#1_23|)) |v_#memory_int_193|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_194|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_17|, #pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_193|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_9|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-13 01:53:30,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [896] L82-2-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q1_front~0_41 v_~q1_back~0_58) (< v_~q1_front~0_41 v_~n1~0_17) (<= 0 v_~q1_front~0_41)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select (select |v_#memory_int_93| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_front~0_41))) |v_thread2Thread1of1ForFork2_~j~0#1_19|) (= (+ v_~q1_front~0_41 1) v_~q1_front~0_40) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_front~0=v_~q1_front~0_41, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_5|, ~q1~0.offset=v_~q1~0.offset_24, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~0#1] [2022-12-13 01:53:31,606 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1155] L57-->L150-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre33#1_67| |v_#pthreadsForks_133|) (= (+ |v_#pthreadsForks_133| 1) |v_#pthreadsForks_132|) (= (store |v_#memory_int_386| |v_ULTIMATE.start_main_~#t3~0#1.base_61| (store (select |v_#memory_int_386| |v_ULTIMATE.start_main_~#t3~0#1.base_61|) |v_ULTIMATE.start_main_~#t3~0#1.offset_61| |v_ULTIMATE.start_main_#t~pre33#1_67|)) |v_#memory_int_385|) (let ((.cse13 (= |v_thread1Thread1of1ForFork1_#t~mem1#1_124| 2))) (let ((.cse0 (= v_~q1_back~0_268 v_~q1_back~0_267)) (.cse7 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_101| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_~i~0#1_144| |v_thread1Thread1of1ForFork1_~i~0#1_143|)) (.cse8 (= |v_thread1Thread1of1ForFork1_#t~post2#1_84| |v_thread1Thread1of1ForFork1_#t~post2#1_83|)) (.cse9 (= |v_thread1Thread1of1ForFork1_#t~post3#1_84| |v_thread1Thread1of1ForFork1_#t~post3#1_83|)) (.cse11 (not .cse13)) (.cse1 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_160|)) (.cse2 (= |v_thread1Thread1of1ForFork1_#t~post5#1_86| |v_thread1Thread1of1ForFork1_#t~post5#1_85|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_86| |v_thread1Thread1of1ForFork1_#t~mem4#1_85|)) (.cse4 (= v_~r~0_153 v_~r~0_154)) (.cse5 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_168| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_167|)) (.cse10 (= v_~q3_front~0_212 v_~q3_front~0_211)) (.cse12 (= |v_thread1Thread1of1ForFork1_~l~0#1_96| |v_thread1Thread1of1ForFork1_~l~0#1_95|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_167|) (= (+ v_~q3_front~0_212 1) v_~q3_front~0_211) .cse0 (not .cse7) (= |v_thread1Thread1of1ForFork1_~l~0#1_95| (select (select |v_#memory_int_386| v_~q3~0.base_133) (+ (* v_~q3_front~0_212 4) v_~q3~0.offset_133))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_167| 0)) .cse6 .cse8 .cse9 (= (+ |v_thread1Thread1of1ForFork1_~l~0#1_95| v_~r~0_154) v_~r~0_153) .cse11 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| (ite (and (<= 0 v_~q3_front~0_212) (< v_~q3_front~0_212 v_~n3~0_154)) 1 0))) (and .cse1 .cse2 .cse3 (= |v_thread1Thread1of1ForFork1_~i~0#1_143| (+ |v_thread1Thread1of1ForFork1_~i~0#1_144| 1)) .cse4 (= (+ v_~q1_back~0_268 1) v_~q1_back~0_267) .cse13 .cse5 .cse10 .cse12))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_84|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_86|, ~n3~0=v_~n3~0_154, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_61|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_86|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_61|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_96|, ~q3~0.offset=v_~q3~0.offset_133, ~q3_front~0=v_~q3_front~0_212, #pthreadsForks=|v_#pthreadsForks_133|, ~q1_back~0=v_~q1_back~0_268, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_84|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_160|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_144|, #memory_int=|v_#memory_int_386|, ~q3~0.base=v_~q3~0.base_133, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_124|, ~r~0=v_~r~0_154, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_101|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_168|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_83|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_85|, ~n3~0=v_~n3~0_154, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_61|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_85|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_61|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_95|, ~q3~0.offset=v_~q3~0.offset_133, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_79|, ~q3_front~0=v_~q3_front~0_211, #pthreadsForks=|v_#pthreadsForks_132|, ~q1_back~0=v_~q1_back~0_267, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_83|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_143|, #memory_int=|v_#memory_int_385|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_51|, ~q3~0.base=v_~q3~0.base_133, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_67|, ~r~0=v_~r~0_153, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_101|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_167|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_~l~0#1, ULTIMATE.start_main_#t~pre31#1, ~q3_front~0, #pthreadsForks, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1, thread1Thread1of1ForFork1_#t~mem1#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [977] L62-1-->L56: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) (= (ite (and (<= 0 v_~q1_back~0_68) (< v_~q1_back~0_68 v_~n1~0_23)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread1Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (< v_~q3_front~0_63 v_~q3_back~0_62) 1 0) 0) 0 1)) (< |v_thread1Thread1of1ForFork1_~i~0#1_23| v_~N~0_16) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0))) InVars {~q3_front~0=v_~q3_front~0_63, ~q3_back~0=v_~q3_back~0_62, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_23|, ~N~0=v_~N~0_16} OutVars{~q3_front~0=v_~q3_front~0_63, ~q3_back~0=v_~q3_back~0_62, ~q1_back~0=v_~q1_back~0_68, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~n1~0=v_~n1~0_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_23|, ~N~0=v_~N~0_16, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_23|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:53:32,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [896] L82-2-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q1_front~0_41 v_~q1_back~0_58) (< v_~q1_front~0_41 v_~n1~0_17) (<= 0 v_~q1_front~0_41)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select (select |v_#memory_int_93| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_front~0_41))) |v_thread2Thread1of1ForFork2_~j~0#1_19|) (= (+ v_~q1_front~0_41 1) v_~q1_front~0_40) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_front~0=v_~q1_front~0_41, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_5|, ~q1~0.offset=v_~q1~0.offset_24, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~0#1] [2022-12-13 01:53:32,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1115] L148-3-->L149-3: Formula: (and (= (store |v_#memory_int_254| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_254| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre31#1_41|)) |v_#memory_int_253|) (= |v_#pthreadsForks_70| (+ |v_#pthreadsForks_71| 1)) (= |v_#pthreadsForks_71| |v_ULTIMATE.start_main_#t~pre31#1_41|)) InVars {#pthreadsForks=|v_#pthreadsForks_71|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_254|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_41|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_43|, #pthreadsForks=|v_#pthreadsForks_70|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_253|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, #memory_int] [2022-12-13 01:53:32,988 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1124] L104-2-->thread3EXIT: Formula: (and (= (ite |v_thread3_#t~short17#1_93| 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ v_~q3_back~0_In_3 1) v_~q3_back~0_Out_6) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_~t~0#1_Out_2| (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| |v_thread3Thread1of1ForFork0_~t~0#1_In_1|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) |v_thread3_#t~short17#1_94| (<= 0 v_~q3_back~0_In_3) (not (= (ite (and (< v_~q2_front~0_In_1 v_~q2_back~0_In_3) (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_9| v_~q2~0.base_In_3) (+ v_~q2~0.offset_In_3 (* v_~q2_front~0_In_1 4)))) (< v_~q3_back~0_In_3 v_~n3~0_In_1) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (+ (select (select |v_#memory_int_In_9| v_~q3~0.base_In_3) (+ (* v_~q3_back~0_In_3 4) v_~q3~0.offset_In_3)) 1)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (<= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0)) InVars {~n2~0=v_~n2~0_In_3, ~n3~0=v_~n3~0_In_1, ~q2~0.offset=v_~q2~0.offset_In_3, ~q2_front~0=v_~q2_front~0_In_1, ~q3~0.offset=v_~q3~0.offset_In_3, ~q3_back~0=v_~q3_back~0_In_3, #memory_int=|v_#memory_int_In_9|, ~q3~0.base=v_~q3~0.base_In_3, ~q2~0.base=v_~q2~0.base_In_3, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_In_1|, ~q2_back~0=v_~q2_back~0_In_3} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~n3~0=v_~n3~0_In_1, thread3Thread1of1ForFork0_#t~short17#1=|v_thread3Thread1of1ForFork0_#t~short17#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_3, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, ~q3~0.offset=v_~q3~0.offset_In_3, thread3Thread1of1ForFork0_#t~post18#1=|v_thread3Thread1of1ForFork0_#t~post18#1_Out_2|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_Out_2|, ~q3_back~0=v_~q3_back~0_Out_6, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_Out_2|, #memory_int=|v_#memory_int_In_9|, ~q3~0.base=v_~q3~0.base_In_3, ~q2~0.base=v_~q2~0.base_In_3, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_Out_2|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, thread3Thread1of1ForFork0_#t~mem14#1=|v_thread3Thread1of1ForFork0_#t~mem14#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_3} AuxVars[|v_thread3_#t~short17#1_94|, |v_thread3_#t~short17#1_93|] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~short17#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~q2_front~0, thread3Thread1of1ForFork0_#t~post18#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem16#1, ~q3_back~0, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_~t~0#1, thread3Thread1of1ForFork0_~k~0#1, thread3Thread1of1ForFork0_#t~mem14#1] [2022-12-13 01:53:33,368 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [896] L82-2-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q1_front~0_41 v_~q1_back~0_58) (< v_~q1_front~0_41 v_~n1~0_17) (<= 0 v_~q1_front~0_41)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select (select |v_#memory_int_93| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_front~0_41))) |v_thread2Thread1of1ForFork2_~j~0#1_19|) (= (+ v_~q1_front~0_41 1) v_~q1_front~0_40) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_front~0=v_~q1_front~0_41, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_5|, ~q1~0.offset=v_~q1~0.offset_24, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~0#1] [2022-12-13 01:53:33,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1109] L104-2-->L104-2: Formula: (and (<= 0 v_~q3_back~0_123) (= |v_thread3Thread1of1ForFork0_~k~0#1_43| (select (select |v_#memory_int_245| v_~q2~0.base_93) (+ v_~q2~0.offset_93 (* v_~q2_front~0_113 4)))) (not (= (ite (and (< v_~q2_front~0_113 v_~n2~0_104) (<= 0 v_~q2_front~0_113) (< v_~q2_front~0_113 v_~q2_back~0_134)) 1 0) 0)) |v_thread3_#t~short17#1_85| (= v_~q3_back~0_122 (+ v_~q3_back~0_123 1)) (= v_~q2_front~0_112 (+ v_~q2_front~0_113 1)) (= |v_thread3Thread1of1ForFork0_~t~0#1_47| (+ |v_thread3Thread1of1ForFork0_~t~0#1_48| |v_thread3Thread1of1ForFork0_~k~0#1_43|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33| (ite |v_thread3_#t~short17#1_86| 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|) (not (<= |v_thread3Thread1of1ForFork0_~k~0#1_43| 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| 0)) (< v_~q3_back~0_123 v_~n3~0_86) (= (+ (select (select |v_#memory_int_245| v_~q3~0.base_67) (+ (* 4 v_~q3_back~0_123) v_~q3~0.offset_67)) 1) |v_thread3Thread1of1ForFork0_~k~0#1_43|)) InVars {~q3_back~0=v_~q3_back~0_123, ~n2~0=v_~n2~0_104, ~n3~0=v_~n3~0_86, ~q2~0.offset=v_~q2~0.offset_93, #memory_int=|v_#memory_int_245|, ~q3~0.base=v_~q3~0.base_67, ~q2_front~0=v_~q2_front~0_113, ~q2~0.base=v_~q2~0.base_93, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_48|, ~q3~0.offset=v_~q3~0.offset_67, ~q2_back~0=v_~q2_back~0_134} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|, ~n2~0=v_~n2~0_104, ~n3~0=v_~n3~0_86, thread3Thread1of1ForFork0_#t~short17#1=|v_thread3Thread1of1ForFork0_#t~short17#1_25|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|, ~q2~0.offset=v_~q2~0.offset_93, ~q2_front~0=v_~q2_front~0_112, ~q3~0.offset=v_~q3~0.offset_67, thread3Thread1of1ForFork0_#t~post18#1=|v_thread3Thread1of1ForFork0_#t~post18#1_25|, thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_29|, ~q3_back~0=v_~q3_back~0_122, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_25|, #memory_int=|v_#memory_int_245|, ~q3~0.base=v_~q3~0.base_67, ~q2~0.base=v_~q2~0.base_93, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_47|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_43|, thread3Thread1of1ForFork0_#t~mem14#1=|v_thread3Thread1of1ForFork0_#t~mem14#1_25|, ~q2_back~0=v_~q2_back~0_134} AuxVars[|v_thread3_#t~short17#1_86|, |v_thread3_#t~short17#1_85|] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, ~q3_back~0, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~short17#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~q2_front~0, thread3Thread1of1ForFork0_~t~0#1, thread3Thread1of1ForFork0_~k~0#1, thread3Thread1of1ForFork0_#t~mem14#1, thread3Thread1of1ForFork0_#t~post18#1] [2022-12-13 01:53:34,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1082] L149-4-->L150-3: Formula: (and (= |v_#pthreadsForks_53| |v_ULTIMATE.start_main_#t~pre33#1_23|) (= (store |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre33#1_23|)) |v_#memory_int_193|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_194|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_17|, #pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_193|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_9|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-13 01:53:34,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1082] L149-4-->L150-3: Formula: (and (= |v_#pthreadsForks_53| |v_ULTIMATE.start_main_#t~pre33#1_23|) (= (store |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre33#1_23|)) |v_#memory_int_193|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_194|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_17|, #pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_193|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_9|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-13 01:53:34,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1109] L104-2-->L104-2: Formula: (and (<= 0 v_~q3_back~0_123) (= |v_thread3Thread1of1ForFork0_~k~0#1_43| (select (select |v_#memory_int_245| v_~q2~0.base_93) (+ v_~q2~0.offset_93 (* v_~q2_front~0_113 4)))) (not (= (ite (and (< v_~q2_front~0_113 v_~n2~0_104) (<= 0 v_~q2_front~0_113) (< v_~q2_front~0_113 v_~q2_back~0_134)) 1 0) 0)) |v_thread3_#t~short17#1_85| (= v_~q3_back~0_122 (+ v_~q3_back~0_123 1)) (= v_~q2_front~0_112 (+ v_~q2_front~0_113 1)) (= |v_thread3Thread1of1ForFork0_~t~0#1_47| (+ |v_thread3Thread1of1ForFork0_~t~0#1_48| |v_thread3Thread1of1ForFork0_~k~0#1_43|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33| (ite |v_thread3_#t~short17#1_86| 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|) (not (<= |v_thread3Thread1of1ForFork0_~k~0#1_43| 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| 0)) (< v_~q3_back~0_123 v_~n3~0_86) (= (+ (select (select |v_#memory_int_245| v_~q3~0.base_67) (+ (* 4 v_~q3_back~0_123) v_~q3~0.offset_67)) 1) |v_thread3Thread1of1ForFork0_~k~0#1_43|)) InVars {~q3_back~0=v_~q3_back~0_123, ~n2~0=v_~n2~0_104, ~n3~0=v_~n3~0_86, ~q2~0.offset=v_~q2~0.offset_93, #memory_int=|v_#memory_int_245|, ~q3~0.base=v_~q3~0.base_67, ~q2_front~0=v_~q2_front~0_113, ~q2~0.base=v_~q2~0.base_93, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_48|, ~q3~0.offset=v_~q3~0.offset_67, ~q2_back~0=v_~q2_back~0_134} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|, ~n2~0=v_~n2~0_104, ~n3~0=v_~n3~0_86, thread3Thread1of1ForFork0_#t~short17#1=|v_thread3Thread1of1ForFork0_#t~short17#1_25|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|, ~q2~0.offset=v_~q2~0.offset_93, ~q2_front~0=v_~q2_front~0_112, ~q3~0.offset=v_~q3~0.offset_67, thread3Thread1of1ForFork0_#t~post18#1=|v_thread3Thread1of1ForFork0_#t~post18#1_25|, thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_29|, ~q3_back~0=v_~q3_back~0_122, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_25|, #memory_int=|v_#memory_int_245|, ~q3~0.base=v_~q3~0.base_67, ~q2~0.base=v_~q2~0.base_93, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_47|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_43|, thread3Thread1of1ForFork0_#t~mem14#1=|v_thread3Thread1of1ForFork0_#t~mem14#1_25|, ~q2_back~0=v_~q2_back~0_134} AuxVars[|v_thread3_#t~short17#1_86|, |v_thread3_#t~short17#1_85|] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, ~q3_back~0, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~short17#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~q2_front~0, thread3Thread1of1ForFork0_~t~0#1, thread3Thread1of1ForFork0_~k~0#1, thread3Thread1of1ForFork0_#t~mem14#1, thread3Thread1of1ForFork0_#t~post18#1] [2022-12-13 01:53:34,728 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1124] L104-2-->thread3EXIT: Formula: (and (= (ite |v_thread3_#t~short17#1_93| 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ v_~q3_back~0_In_3 1) v_~q3_back~0_Out_6) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_~t~0#1_Out_2| (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| |v_thread3Thread1of1ForFork0_~t~0#1_In_1|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) |v_thread3_#t~short17#1_94| (<= 0 v_~q3_back~0_In_3) (not (= (ite (and (< v_~q2_front~0_In_1 v_~q2_back~0_In_3) (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_9| v_~q2~0.base_In_3) (+ v_~q2~0.offset_In_3 (* v_~q2_front~0_In_1 4)))) (< v_~q3_back~0_In_3 v_~n3~0_In_1) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (+ (select (select |v_#memory_int_In_9| v_~q3~0.base_In_3) (+ (* v_~q3_back~0_In_3 4) v_~q3~0.offset_In_3)) 1)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (<= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0)) InVars {~n2~0=v_~n2~0_In_3, ~n3~0=v_~n3~0_In_1, ~q2~0.offset=v_~q2~0.offset_In_3, ~q2_front~0=v_~q2_front~0_In_1, ~q3~0.offset=v_~q3~0.offset_In_3, ~q3_back~0=v_~q3_back~0_In_3, #memory_int=|v_#memory_int_In_9|, ~q3~0.base=v_~q3~0.base_In_3, ~q2~0.base=v_~q2~0.base_In_3, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_In_1|, ~q2_back~0=v_~q2_back~0_In_3} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~n3~0=v_~n3~0_In_1, thread3Thread1of1ForFork0_#t~short17#1=|v_thread3Thread1of1ForFork0_#t~short17#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_3, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, ~q3~0.offset=v_~q3~0.offset_In_3, thread3Thread1of1ForFork0_#t~post18#1=|v_thread3Thread1of1ForFork0_#t~post18#1_Out_2|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_Out_2|, ~q3_back~0=v_~q3_back~0_Out_6, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_Out_2|, #memory_int=|v_#memory_int_In_9|, ~q3~0.base=v_~q3~0.base_In_3, ~q2~0.base=v_~q2~0.base_In_3, thread3Thread1of1ForFork0_~t~0#1=|v_thread3Thread1of1ForFork0_~t~0#1_Out_2|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, thread3Thread1of1ForFork0_#t~mem14#1=|v_thread3Thread1of1ForFork0_#t~mem14#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_3} AuxVars[|v_thread3_#t~short17#1_94|, |v_thread3_#t~short17#1_93|] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~short17#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~q2_front~0, thread3Thread1of1ForFork0_#t~post18#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem16#1, ~q3_back~0, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_~t~0#1, thread3Thread1of1ForFork0_~k~0#1, thread3Thread1of1ForFork0_#t~mem14#1] [2022-12-13 01:53:35,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [896] L82-2-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q1_front~0_41 v_~q1_back~0_58) (< v_~q1_front~0_41 v_~n1~0_17) (<= 0 v_~q1_front~0_41)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select (select |v_#memory_int_93| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_front~0_41))) |v_thread2Thread1of1ForFork2_~j~0#1_19|) (= (+ v_~q1_front~0_41 1) v_~q1_front~0_40) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_front~0=v_~q1_front~0_41, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_5|, ~q1~0.offset=v_~q1~0.offset_24, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~0#1] [2022-12-13 01:53:36,053 WARN L322 ript$VariableManager]: TermVariable LBE523 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:53:36,054 WARN L322 ript$VariableManager]: TermVariable LBE49 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:53:41,836 WARN L322 ript$VariableManager]: TermVariable LBE523 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:53:41,836 WARN L322 ript$VariableManager]: TermVariable LBE49 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:53:42,720 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse12 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|)) (.cse7 (= v_~r~0_Out_6 v_~r~0_In_3)) (.cse8 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|)) (.cse2 (= v_~q1_back~0_Out_10 v_~q1_back~0_In_5)) (.cse9 (= v_~q3_front~0_Out_6 v_~q3_front~0_In_1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_1| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|)) (.cse3 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_1| |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|)) (.cse4 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_3| |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|)) (.cse5 (not .cse12)) (.cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|))) (or (and .cse0 (not .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork1_~l~0#1_Out_2| (select (select |v_#memory_int_In_13| v_~q3~0.base_In_5) (+ (* v_~q3_front~0_In_1 4) v_~q3~0.offset_In_5))) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (and (< v_~q3_front~0_In_1 v_~n3~0_In_3) (<= 0 v_~q3_front~0_In_1)) 1 0)) (= v_~q3_front~0_Out_6 (+ v_~q3_front~0_In_1 1)) .cse3 .cse4 .cse5 (= (+ v_~r~0_In_3 |v_thread1Thread1of1ForFork1_~l~0#1_Out_2|) v_~r~0_Out_6)) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) .cse8 .cse9 .cse10 (= v_~q1_back~0_Out_10 (+ v_~q1_back~0_In_5 1)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_1|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_1|, ~q3~0.offset=v_~q3~0.offset_In_5, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_1|, ~q3_front~0=v_~q3_front~0_In_1, ~q1_back~0=v_~q1_back~0_In_5, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_3, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~n3~0=v_~n3~0_In_3, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_2|, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_front~0=v_~q3_front~0_Out_6, ~q1_back~0=v_~q1_back~0_Out_10, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, ~q3~0.base=v_~q3~0.base_In_5, ~r~0=v_~r~0_Out_6, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [896] L82-2-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q1_front~0_41 v_~q1_back~0_58) (< v_~q1_front~0_41 v_~n1~0_17) (<= 0 v_~q1_front~0_41)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select (select |v_#memory_int_93| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_front~0_41))) |v_thread2Thread1of1ForFork2_~j~0#1_19|) (= (+ v_~q1_front~0_41 1) v_~q1_front~0_40) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_front~0=v_~q1_front~0_41, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_5|, ~q1~0.offset=v_~q1~0.offset_24, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~0#1] [2022-12-13 01:53:44,004 INFO L241 LiptonReduction]: Total number of compositions: 18 [2022-12-13 01:53:44,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17922 [2022-12-13 01:53:44,005 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 275 transitions, 2278 flow [2022-12-13 01:53:44,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:53:44,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:53:44,005 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:53:44,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 01:53:44,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:53:44,212 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-13 01:53:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:53:44,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1794757910, now seen corresponding path program 1 times [2022-12-13 01:53:44,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:53:44,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285396609] [2022-12-13 01:53:44,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:53:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:53:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:53:44,861 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-13 01:53:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:53:44,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285396609] [2022-12-13 01:53:44,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285396609] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:53:44,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705568435] [2022-12-13 01:53:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:53:44,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:53:44,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:53:44,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:53:44,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 01:53:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:53:45,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 01:53:45,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:53:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:53:45,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:53:45,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705568435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:53:45,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:53:45,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-12-13 01:53:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836492602] [2022-12-13 01:53:45,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:53:45,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:53:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:53:45,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:53:45,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:53:45,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-13 01:53:45,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 275 transitions, 2278 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:53:45,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:53:45,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-13 01:53:45,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:53:46,403 INFO L130 PetriNetUnfolder]: 4713/6641 cut-off events. [2022-12-13 01:53:46,403 INFO L131 PetriNetUnfolder]: For 131584/131584 co-relation queries the response was YES. [2022-12-13 01:53:46,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46149 conditions, 6641 events. 4713/6641 cut-off events. For 131584/131584 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 29724 event pairs, 789 based on Foata normal form. 36/5344 useless extension candidates. Maximal degree in co-relation 46074. Up to 2537 conditions per place. [2022-12-13 01:53:46,436 INFO L137 encePairwiseOnDemand]: 50/75 looper letters, 141 selfloop transitions, 8 changer transitions 206/355 dead transitions. [2022-12-13 01:53:46,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 355 transitions, 3686 flow [2022-12-13 01:53:46,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:53:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:53:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-13 01:53:46,438 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.344 [2022-12-13 01:53:46,438 INFO L175 Difference]: Start difference. First operand has 138 places, 275 transitions, 2278 flow. Second operand 5 states and 129 transitions. [2022-12-13 01:53:46,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 355 transitions, 3686 flow [2022-12-13 01:53:47,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 355 transitions, 3008 flow, removed 310 selfloop flow, removed 13 redundant places. [2022-12-13 01:53:47,380 INFO L231 Difference]: Finished difference. Result has 132 places, 119 transitions, 782 flow [2022-12-13 01:53:47,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=782, PETRI_PLACES=132, PETRI_TRANSITIONS=119} [2022-12-13 01:53:47,381 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 97 predicate places. [2022-12-13 01:53:47,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:53:47,381 INFO L89 Accepts]: Start accepts. Operand has 132 places, 119 transitions, 782 flow [2022-12-13 01:53:47,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:53:47,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:53:47,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 119 transitions, 782 flow [2022-12-13 01:53:47,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 119 transitions, 782 flow [2022-12-13 01:53:47,435 INFO L130 PetriNetUnfolder]: 264/608 cut-off events. [2022-12-13 01:53:47,436 INFO L131 PetriNetUnfolder]: For 6269/6271 co-relation queries the response was YES. [2022-12-13 01:53:47,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2841 conditions, 608 events. 264/608 cut-off events. For 6269/6271 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2948 event pairs, 6 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 1916. Up to 189 conditions per place. [2022-12-13 01:53:47,440 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 119 transitions, 782 flow [2022-12-13 01:53:47,440 INFO L226 LiptonReduction]: Number of co-enabled transitions 778 [2022-12-13 01:53:47,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1174] L57-->L149-3: Formula: (and (let ((.cse1 (= |v_thread1Thread1of1ForFork1_#t~mem1#1_189| 2))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_229| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_230|)) (.cse2 (= v_~q3_front~0_266 v_~q3_front~0_265)) (.cse3 (= v_~r~0_202 v_~r~0_201)) (.cse4 (= |v_thread1Thread1of1ForFork1_#t~post5#1_130| |v_thread1Thread1of1ForFork1_#t~post5#1_129|)) (.cse5 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_129| |v_thread1Thread1of1ForFork1_#t~mem4#1_130|)) (.cse6 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221|)) (.cse7 (= |v_thread1Thread1of1ForFork1_~l~0#1_144| |v_thread1Thread1of1ForFork1_~l~0#1_143|)) (.cse8 (not .cse1)) (.cse10 (= |v_thread1Thread1of1ForFork1_#t~post3#1_128| |v_thread1Thread1of1ForFork1_#t~post3#1_127|)) (.cse11 (= |v_thread1Thread1of1ForFork1_~i~0#1_198| |v_thread1Thread1of1ForFork1_~i~0#1_197|)) (.cse12 (= |v_thread1Thread1of1ForFork1_#t~post2#1_128| |v_thread1Thread1of1ForFork1_#t~post2#1_127|)) (.cse13 (= v_~q1_back~0_339 v_~q1_back~0_340)) (.cse9 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_137| 256) 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_198| 1) |v_thread1Thread1of1ForFork1_~i~0#1_197|) .cse4 .cse5 (= (+ v_~q1_back~0_340 1) v_~q1_back~0_339) .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse2 .cse12 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= |v_thread1Thread1of1ForFork1_~l~0#1_143| (select (select |v_#memory_int_442| v_~q3~0.base_171) (+ v_~q3~0.offset_171 (* v_~q3_front~0_266 4)))) (= (+ v_~q3_front~0_266 1) v_~q3_front~0_265) .cse8 .cse10 .cse11 .cse12 .cse13 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_229|) (= v_~r~0_201 (+ |v_thread1Thread1of1ForFork1_~l~0#1_143| v_~r~0_202)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_229| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221| (ite (and (<= 0 v_~q3_front~0_266) (< v_~q3_front~0_266 v_~n3~0_192)) 1 0)) (not .cse9))))) (= |v_ULTIMATE.start_main_#t~pre31#1_89| |v_#pthreadsForks_153|) (= (+ |v_#pthreadsForks_153| 1) |v_#pthreadsForks_152|) (= (store |v_#memory_int_442| |v_ULTIMATE.start_main_~#t2~0#1.base_63| (store (select |v_#memory_int_442| |v_ULTIMATE.start_main_~#t2~0#1.base_63|) |v_ULTIMATE.start_main_~#t2~0#1.offset_63| |v_ULTIMATE.start_main_#t~pre31#1_89|)) |v_#memory_int_441|)) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_128|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_130|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_63|, ~n3~0=v_~n3~0_192, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_130|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_144|, ~q3~0.offset=v_~q3~0.offset_171, ~q3_front~0=v_~q3_front~0_266, #pthreadsForks=|v_#pthreadsForks_153|, ~q1_back~0=v_~q1_back~0_340, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_128|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_198|, #memory_int=|v_#memory_int_442|, ~q3~0.base=v_~q3~0.base_171, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_189|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_63|, ~r~0=v_~r~0_202, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_137|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_230|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_127|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_73|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_129|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_63|, ~n3~0=v_~n3~0_192, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_129|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_143|, ~q3~0.offset=v_~q3~0.offset_171, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_89|, ~q3_front~0=v_~q3_front~0_265, #pthreadsForks=|v_#pthreadsForks_152|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_51|, ~q1_back~0=v_~q1_back~0_339, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_127|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_221|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_197|, #memory_int=|v_#memory_int_441|, ~q3~0.base=v_~q3~0.base_171, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_63|, ~r~0=v_~r~0_201, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_137|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_229|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ULTIMATE.start_main_#t~pre29#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_~l~0#1, ULTIMATE.start_main_#t~pre31#1, ~q3_front~0, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, #memory_int, thread1Thread1of1ForFork1_#t~mem1#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [977] L62-1-->L56: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) (= (ite (and (<= 0 v_~q1_back~0_68) (< v_~q1_back~0_68 v_~n1~0_23)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread1Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (< v_~q3_front~0_63 v_~q3_back~0_62) 1 0) 0) 0 1)) (< |v_thread1Thread1of1ForFork1_~i~0#1_23| v_~N~0_16) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0))) InVars {~q3_front~0=v_~q3_front~0_63, ~q3_back~0=v_~q3_back~0_62, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_23|, ~N~0=v_~N~0_16} OutVars{~q3_front~0=v_~q3_front~0_63, ~q3_back~0=v_~q3_back~0_62, ~q1_back~0=v_~q1_back~0_68, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~n1~0=v_~n1~0_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_23|, ~N~0=v_~N~0_16, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_23|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:53:48,572 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:53:48,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1192 [2022-12-13 01:53:48,573 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 116 transitions, 768 flow [2022-12-13 01:53:48,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:53:48,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:53:48,573 INFO L214 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, 1] [2022-12-13 01:53:48,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 01:53:48,774 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,SelfDestructingSolverStorable9 [2022-12-13 01:53:48,774 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-13 01:53:48,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:53:48,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1875778621, now seen corresponding path program 1 times [2022-12-13 01:53:48,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:53:48,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874482068] [2022-12-13 01:53:48,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:53:48,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:53:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:53:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:53:49,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:53:49,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874482068] [2022-12-13 01:53:49,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874482068] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:53:49,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578973277] [2022-12-13 01:53:49,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:53:49,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:53:49,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:53:49,045 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:53:49,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 01:53:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:53:49,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 01:53:49,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:53:49,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:53:49,326 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 333 treesize of output 345 [2022-12-13 01:53:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:53:49,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:53:49,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578973277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:53:49,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:53:49,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-12-13 01:53:49,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157678734] [2022-12-13 01:53:49,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:53:49,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:53:49,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:53:49,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:53:49,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:53:49,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:53:49,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 116 transitions, 768 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:53:49,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:53:49,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:53:49,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:53:49,853 INFO L130 PetriNetUnfolder]: 1550/2304 cut-off events. [2022-12-13 01:53:49,853 INFO L131 PetriNetUnfolder]: For 27527/27527 co-relation queries the response was YES. [2022-12-13 01:53:49,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12805 conditions, 2304 events. 1550/2304 cut-off events. For 27527/27527 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 9101 event pairs, 519 based on Foata normal form. 24/1967 useless extension candidates. Maximal degree in co-relation 9447. Up to 1487 conditions per place. [2022-12-13 01:53:49,880 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 78 selfloop transitions, 0 changer transitions 64/142 dead transitions. [2022-12-13 01:53:49,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 142 transitions, 1218 flow [2022-12-13 01:53:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:53:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:53:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 01:53:49,881 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2022-12-13 01:53:49,881 INFO L175 Difference]: Start difference. First operand has 91 places, 116 transitions, 768 flow. Second operand 5 states and 79 transitions. [2022-12-13 01:53:49,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 142 transitions, 1218 flow [2022-12-13 01:53:49,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 142 transitions, 1061 flow, removed 63 selfloop flow, removed 15 redundant places. [2022-12-13 01:53:49,916 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 398 flow [2022-12-13 01:53:49,916 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=398, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2022-12-13 01:53:49,917 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 45 predicate places. [2022-12-13 01:53:49,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:53:49,917 INFO L89 Accepts]: Start accepts. Operand has 80 places, 78 transitions, 398 flow [2022-12-13 01:53:49,917 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:53:49,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:53:49,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 78 transitions, 398 flow [2022-12-13 01:53:49,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 78 transitions, 398 flow [2022-12-13 01:53:49,946 INFO L130 PetriNetUnfolder]: 190/373 cut-off events. [2022-12-13 01:53:49,946 INFO L131 PetriNetUnfolder]: For 591/593 co-relation queries the response was YES. [2022-12-13 01:53:49,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 373 events. 190/373 cut-off events. For 591/593 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1423 event pairs, 4 based on Foata normal form. 2/313 useless extension candidates. Maximal degree in co-relation 850. Up to 117 conditions per place. [2022-12-13 01:53:49,948 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 78 transitions, 398 flow [2022-12-13 01:53:49,948 INFO L226 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-13 01:53:49,949 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:53:49,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 01:53:49,949 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 78 transitions, 398 flow [2022-12-13 01:53:49,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:53:49,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:53:49,949 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:53:49,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 01:53:50,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:53:50,155 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-13 01:53:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:53:50,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1514214118, now seen corresponding path program 1 times [2022-12-13 01:53:50,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:53:50,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258012684] [2022-12-13 01:53:50,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:53:50,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:53:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:53:50,581 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-13 01:53:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:53:50,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258012684] [2022-12-13 01:53:50,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258012684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:53:50,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118530355] [2022-12-13 01:53:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:53:50,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:53:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:53:50,583 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:53:50,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 01:53:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:53:50,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 01:53:50,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:53:50,938 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-13 01:53:50,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:53:51,182 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 182 treesize of output 174 [2022-12-13 01:53:51,260 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-13 01:53:51,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118530355] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:53:51,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:53:51,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2022-12-13 01:53:51,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801965981] [2022-12-13 01:53:51,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:53:51,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 01:53:51,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:53:51,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 01:53:51,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-12-13 01:53:51,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 01:53:51,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 78 transitions, 398 flow. Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:53:51,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:53:51,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 01:53:51,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:53:52,050 INFO L130 PetriNetUnfolder]: 3417/4821 cut-off events. [2022-12-13 01:53:52,051 INFO L131 PetriNetUnfolder]: For 15491/15491 co-relation queries the response was YES. [2022-12-13 01:53:52,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21643 conditions, 4821 events. 3417/4821 cut-off events. For 15491/15491 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 20296 event pairs, 237 based on Foata normal form. 134/3995 useless extension candidates. Maximal degree in co-relation 13709. Up to 1917 conditions per place. [2022-12-13 01:53:52,067 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 228 selfloop transitions, 76 changer transitions 25/329 dead transitions. [2022-12-13 01:53:52,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 329 transitions, 2489 flow [2022-12-13 01:53:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 01:53:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 01:53:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 181 transitions. [2022-12-13 01:53:52,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095022624434389 [2022-12-13 01:53:52,068 INFO L175 Difference]: Start difference. First operand has 57 places, 78 transitions, 398 flow. Second operand 13 states and 181 transitions. [2022-12-13 01:53:52,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 329 transitions, 2489 flow [2022-12-13 01:53:52,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 329 transitions, 2329 flow, removed 80 selfloop flow, removed 5 redundant places. [2022-12-13 01:53:52,171 INFO L231 Difference]: Finished difference. Result has 71 places, 151 transitions, 1200 flow [2022-12-13 01:53:52,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1200, PETRI_PLACES=71, PETRI_TRANSITIONS=151} [2022-12-13 01:53:52,172 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 36 predicate places. [2022-12-13 01:53:52,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:53:52,172 INFO L89 Accepts]: Start accepts. Operand has 71 places, 151 transitions, 1200 flow [2022-12-13 01:53:52,173 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:53:52,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:53:52,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 151 transitions, 1200 flow [2022-12-13 01:53:52,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 151 transitions, 1200 flow [2022-12-13 01:53:52,307 INFO L130 PetriNetUnfolder]: 664/1142 cut-off events. [2022-12-13 01:53:52,307 INFO L131 PetriNetUnfolder]: For 2085/2106 co-relation queries the response was YES. [2022-12-13 01:53:52,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4355 conditions, 1142 events. 664/1142 cut-off events. For 2085/2106 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 5817 event pairs, 43 based on Foata normal form. 16/854 useless extension candidates. Maximal degree in co-relation 4283. Up to 543 conditions per place. [2022-12-13 01:53:52,318 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 151 transitions, 1200 flow [2022-12-13 01:53:52,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 1106 [2022-12-13 01:53:52,318 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:53:52,319 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 01:53:52,319 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 151 transitions, 1200 flow [2022-12-13 01:53:52,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:53:52,319 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:53:52,319 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:53:52,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 01:53:52,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:53:52,525 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-13 01:53:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:53:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1874425354, now seen corresponding path program 1 times [2022-12-13 01:53:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:53:52,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047610691] [2022-12-13 01:53:52,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:53:52,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:53:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:53:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:53:52,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:53:52,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047610691] [2022-12-13 01:53:52,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047610691] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:53:52,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714727996] [2022-12-13 01:53:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:53:52,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:53:52,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:53:52,956 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:53:52,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 01:53:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:53:53,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 01:53:53,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:53:53,157 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 152 treesize of output 144 [2022-12-13 01:53:53,340 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 152 treesize of output 144 [2022-12-13 01:53:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:53:53,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:53:53,433 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 182 treesize of output 174 [2022-12-13 01:53:53,676 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 182 treesize of output 174 [2022-12-13 01:53:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:53:53,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714727996] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:53:53,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:53:53,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2022-12-13 01:53:53,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697006997] [2022-12-13 01:53:53,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:53:53,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 01:53:53,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:53:53,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 01:53:53,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-12-13 01:53:53,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 01:53:53,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 151 transitions, 1200 flow. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:53:53,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:53:53,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 01:53:53,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:53:55,180 INFO L130 PetriNetUnfolder]: 4761/6746 cut-off events. [2022-12-13 01:53:55,180 INFO L131 PetriNetUnfolder]: For 15573/15573 co-relation queries the response was YES. [2022-12-13 01:53:55,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28782 conditions, 6746 events. 4761/6746 cut-off events. For 15573/15573 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 29915 event pairs, 179 based on Foata normal form. 158/5507 useless extension candidates. Maximal degree in co-relation 27616. Up to 2791 conditions per place. [2022-12-13 01:53:55,208 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 204 selfloop transitions, 154 changer transitions 36/394 dead transitions. [2022-12-13 01:53:55,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 394 transitions, 3354 flow [2022-12-13 01:53:55,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 01:53:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 01:53:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 252 transitions. [2022-12-13 01:53:55,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3088235294117647 [2022-12-13 01:53:55,210 INFO L175 Difference]: Start difference. First operand has 70 places, 151 transitions, 1200 flow. Second operand 24 states and 252 transitions. [2022-12-13 01:53:55,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 394 transitions, 3354 flow [2022-12-13 01:53:55,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 394 transitions, 3321 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-13 01:53:55,254 INFO L231 Difference]: Finished difference. Result has 104 places, 211 transitions, 2327 flow [2022-12-13 01:53:55,254 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2327, PETRI_PLACES=104, PETRI_TRANSITIONS=211} [2022-12-13 01:53:55,255 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2022-12-13 01:53:55,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:53:55,255 INFO L89 Accepts]: Start accepts. Operand has 104 places, 211 transitions, 2327 flow [2022-12-13 01:53:55,256 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:53:55,256 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:53:55,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 211 transitions, 2327 flow [2022-12-13 01:53:55,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 211 transitions, 2327 flow [2022-12-13 01:53:55,469 INFO L130 PetriNetUnfolder]: 837/1486 cut-off events. [2022-12-13 01:53:55,469 INFO L131 PetriNetUnfolder]: For 4884/4918 co-relation queries the response was YES. [2022-12-13 01:53:55,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6919 conditions, 1486 events. 837/1486 cut-off events. For 4884/4918 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8298 event pairs, 55 based on Foata normal form. 20/1072 useless extension candidates. Maximal degree in co-relation 6885. Up to 775 conditions per place. [2022-12-13 01:53:55,486 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 211 transitions, 2327 flow [2022-12-13 01:53:55,486 INFO L226 LiptonReduction]: Number of co-enabled transitions 1506 [2022-12-13 01:53:55,533 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:53:55,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-13 01:53:55,534 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 210 transitions, 2323 flow [2022-12-13 01:53:55,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:53:55,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:53:55,534 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:53:55,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 01:53:55,740 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,SelfDestructingSolverStorable12 [2022-12-13 01:53:55,741 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-13 01:53:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:53:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash -911815126, now seen corresponding path program 1 times [2022-12-13 01:53:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:53:55,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592123173] [2022-12-13 01:53:55,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:53:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:53:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:53:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:53:56,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:53:56,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592123173] [2022-12-13 01:53:56,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592123173] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:53:56,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700147505] [2022-12-13 01:53:56,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:53:56,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:53:56,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:53:56,928 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:53:56,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 01:53:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:53:57,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 01:53:57,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:53:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:53:58,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:53:59,568 INFO L321 Elim1Store]: treesize reduction 10, result has 93.8 percent of original size [2022-12-13 01:53:59,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 172 treesize of output 256 [2022-12-13 01:54:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:54:02,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700147505] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:54:02,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:54:02,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 32 [2022-12-13 01:54:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460647902] [2022-12-13 01:54:02,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:54:02,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 01:54:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:54:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 01:54:02,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-12-13 01:54:02,544 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 01:54:02,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 210 transitions, 2323 flow. Second operand has 32 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:54:02,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:54:02,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 01:54:02,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:54:10,920 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 109 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:54:22,005 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 105 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:54:34,366 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 121 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:55:03,017 WARN L233 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 130 DAG size of output: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:55:31,286 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 122 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:55:47,351 WARN L233 SmtUtils]: Spent 11.48s on a formula simplification. DAG size of input: 124 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:56:06,324 WARN L233 SmtUtils]: Spent 14.38s on a formula simplification. DAG size of input: 134 DAG size of output: 108 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:56:27,093 WARN L233 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 123 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:56:45,511 WARN L233 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 118 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:57:17,551 WARN L233 SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 139 DAG size of output: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:57:30,566 WARN L233 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 146 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:57:42,935 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 114 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:57:57,371 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 108 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:58:25,476 WARN L233 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 157 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:58:52,679 WARN L233 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 130 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:59:24,175 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 115 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:59:50,405 WARN L233 SmtUtils]: Spent 12.54s on a formula simplification. DAG size of input: 158 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:59:52,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:00:15,978 WARN L233 SmtUtils]: Spent 11.28s on a formula simplification. DAG size of input: 153 DAG size of output: 127 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:00:40,078 WARN L233 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 114 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:00:54,815 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 124 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:01:25,221 WARN L233 SmtUtils]: Spent 11.85s on a formula simplification. DAG size of input: 138 DAG size of output: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:01:46,768 WARN L233 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 165 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:02:22,060 WARN L233 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 119 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:02:25,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:02:27,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:02:30,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:02:32,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:02:51,483 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 118 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:03:12,384 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 125 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:03:27,256 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 137 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:04:32,557 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 148 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:04:57,515 WARN L233 SmtUtils]: Spent 10.49s on a formula simplification. DAG size of input: 144 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:05:02,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:05:04,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:05:06,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:05:08,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:05:10,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:05:12,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:05:14,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:05:16,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:05:18,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:05:20,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:05:38,133 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 138 DAG size of output: 108 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-12-13 02:05:44,393 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:05:44,393 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:05:45,403 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-13 02:05:45,593 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-13 02:05:45,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-12-13 02:05:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2022-12-13 02:05:45,617 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 02:05:45,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 02:05:45,617 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-13 02:05:45,618 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 02:05:45,619 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 02:05:45,619 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 02:05:45,619 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:45,621 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:05:45,622 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:05:45,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:05:45 BasicIcfg [2022-12-13 02:05:45,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:05:45,624 INFO L158 Benchmark]: Toolchain (without parser) took 860235.67ms. Allocated memory was 198.2MB in the beginning and 810.5MB in the end (delta: 612.4MB). Free memory was 173.6MB in the beginning and 474.2MB in the end (delta: -300.7MB). Peak memory consumption was 312.3MB. Max. memory is 8.0GB. [2022-12-13 02:05:45,624 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 174.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:05:45,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.15ms. Allocated memory is still 198.2MB. Free memory was 173.6MB in the beginning and 159.2MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 02:05:45,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.37ms. Allocated memory is still 198.2MB. Free memory was 159.0MB in the beginning and 156.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 02:05:45,624 INFO L158 Benchmark]: Boogie Preprocessor took 34.46ms. Allocated memory is still 198.2MB. Free memory was 156.4MB in the beginning and 154.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:05:45,624 INFO L158 Benchmark]: RCFGBuilder took 836.48ms. Allocated memory is still 198.2MB. Free memory was 154.3MB in the beginning and 160.4MB in the end (delta: -6.0MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. [2022-12-13 02:05:45,625 INFO L158 Benchmark]: TraceAbstraction took 859058.91ms. Allocated memory was 198.2MB in the beginning and 810.5MB in the end (delta: 612.4MB). Free memory was 159.3MB in the beginning and 474.2MB in the end (delta: -314.9MB). Peak memory consumption was 297.9MB. Max. memory is 8.0GB. [2022-12-13 02:05:45,629 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.10ms. Allocated memory is still 198.2MB. Free memory is still 174.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.15ms. Allocated memory is still 198.2MB. Free memory was 173.6MB in the beginning and 159.2MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.37ms. Allocated memory is still 198.2MB. Free memory was 159.0MB in the beginning and 156.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.46ms. Allocated memory is still 198.2MB. Free memory was 156.4MB in the beginning and 154.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 836.48ms. Allocated memory is still 198.2MB. Free memory was 154.3MB in the beginning and 160.4MB in the end (delta: -6.0MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. * TraceAbstraction took 859058.91ms. Allocated memory was 198.2MB in the beginning and 810.5MB in the end (delta: 612.4MB). Free memory was 159.3MB in the beginning and 474.2MB in the end (delta: -314.9MB). Peak memory consumption was 297.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 228 PlacesBefore, 35 PlacesAfterwards, 243 TransitionsBefore, 33 TransitionsAfterwards, 2820 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 42 ConcurrentYvCompositions, 15 ChoiceCompositions, 210 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 1968, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1666, independent: 1651, independent conditional: 0, independent unconditional: 1651, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1666, independent: 1643, independent conditional: 0, independent unconditional: 1643, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1998, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1666, unknown conditional: 0, unknown unconditional: 1666] , Statistics on independence cache: Total cache size (in pairs): 2751, Positive cache size: 2736, Positive conditional cache size: 0, Positive unconditional cache size: 2736, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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, 32 PlacesBefore, 32 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 22, unknown conditional: 2, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 35 PlacesBefore, 34 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 36 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 35 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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, 34 TransitionsBefore, 34 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 37 PlacesBefore, 37 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 64 PlacesBefore, 63 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 63, independent conditional: 63, 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: 87, independent: 63, independent conditional: 46, independent unconditional: 17, dependent: 24, dependent conditional: 7, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 63, independent conditional: 39, independent unconditional: 24, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 63, independent conditional: 39, independent unconditional: 24, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 19, independent conditional: 10, independent unconditional: 9, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 44, independent conditional: 29, independent unconditional: 15, dependent: 23, dependent conditional: 6, dependent unconditional: 17, unknown: 23, unknown conditional: 14, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 44, Positive conditional cache size: 12, Positive unconditional cache size: 32, Negative cache size: 11, Negative conditional cache size: 5, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 44, Positive conditional cache size: 12, Positive unconditional cache size: 32, Negative cache size: 11, Negative conditional cache size: 5, Negative unconditional cache size: 6, 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: 17.7s, 144 PlacesBefore, 138 PlacesAfterwards, 281 TransitionsBefore, 275 TransitionsAfterwards, 1992 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 18 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 307, independent: 292, independent conditional: 292, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 307, independent: 292, independent conditional: 292, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 311, independent: 292, independent conditional: 292, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 311, independent: 292, independent conditional: 292, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 66, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 66, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 311, independent: 239, independent conditional: 239, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 66, unknown conditional: 66, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 105, Positive conditional cache size: 67, Positive unconditional cache size: 38, Negative cache size: 24, Negative conditional cache size: 18, Negative unconditional cache size: 6, 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.1s, 94 PlacesBefore, 91 PlacesAfterwards, 119 TransitionsBefore, 116 TransitionsAfterwards, 778 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 115, Positive conditional cache size: 73, Positive unconditional cache size: 42, Negative cache size: 24, Negative conditional cache size: 18, Negative unconditional cache size: 6, 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, 57 PlacesBefore, 57 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 486 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): 139, Positive cache size: 115, Positive conditional cache size: 73, Positive unconditional cache size: 42, Negative cache size: 24, Negative conditional cache size: 18, Negative unconditional cache size: 6, 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, 70 PlacesBefore, 70 PlacesAfterwards, 151 TransitionsBefore, 151 TransitionsAfterwards, 1106 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): 139, Positive cache size: 115, Positive conditional cache size: 73, Positive unconditional cache size: 42, Negative cache size: 24, Negative conditional cache size: 18, Negative unconditional cache size: 6, 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, 102 PlacesBefore, 101 PlacesAfterwards, 211 TransitionsBefore, 210 TransitionsAfterwards, 1506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 124, Positive conditional cache size: 73, Positive unconditional cache size: 51, Negative cache size: 24, Negative conditional cache size: 18, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 149]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 277 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 858.9s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 721.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 3527 SdHoareTripleChecker+Valid, 41.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3527 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 40.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 845 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10214 IncrementalHoareTripleChecker+Invalid, 11074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 845 mSolverCounterUnsat, 3 mSDtfsCounter, 10214 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 338 SyntacticMatches, 9 SemanticMatches, 454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30076 ImplicationChecksByTransitivity, 666.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2327occurred in iteration=13, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 97.8s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 724 ConstructedInterpolants, 5 QuantifiedInterpolants, 8565 SizeOfPredicates, 241 NumberOfNonLiveVariables, 3544 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 15/83 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown