/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:42:28,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:42:28,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:42:28,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:42:28,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:42:28,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:42:28,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:42:28,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:42:28,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:42:28,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:42:28,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:42:28,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:42:28,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:42:28,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:42:28,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:42:28,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:42:28,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:42:28,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:42:28,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:42:28,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:42:28,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:42:28,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:42:28,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:42:28,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:42:28,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:42:28,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:42:28,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:42:28,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:42:28,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:42:28,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:42:28,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:42:28,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:42:28,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:42:28,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:42:28,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:42:28,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:42:28,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:42:28,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:42:28,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:42:28,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:42:28,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:42:28,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:42:28,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:42:28,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:42:28,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:42:28,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:42:28,980 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:42:28,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:42:28,981 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:42:28,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:42:28,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:42:28,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:42:28,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:42:28,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:42:28,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:42:28,982 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:42:28,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:42:28,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:42:28,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:42:28,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:42:28,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:42:28,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:42:28,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:42:28,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:42:28,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:42:28,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:42:28,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:42:28,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:42:28,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:42:28,997 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:42:28,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:42:29,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:42:29,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:42:29,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:42:29,325 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:42:29,326 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:42:29,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-12-06 05:42:30,417 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:42:30,591 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:42:30,591 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-12-06 05:42:30,597 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7404fd6/3d44d370f344458881ea563b834d3d03/FLAGa9c259754 [2022-12-06 05:42:30,609 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7404fd6/3d44d370f344458881ea563b834d3d03 [2022-12-06 05:42:30,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:42:30,612 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:42:30,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:42:30,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:42:30,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:42:30,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f8b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30, skipping insertion in model container [2022-12-06 05:42:30,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:42:30,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:42:30,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:30,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:30,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:30,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:30,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:30,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:30,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:30,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:30,756 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-12-06 05:42:30,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:42:30,768 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:42:30,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:30,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:30,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:30,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:30,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:30,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:30,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:30,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:30,783 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-12-06 05:42:30,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:42:30,795 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:42:30,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30 WrapperNode [2022-12-06 05:42:30,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:42:30,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:42:30,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:42:30,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:42:30,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,825 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 200 [2022-12-06 05:42:30,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:42:30,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:42:30,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:42:30,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:42:30,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,845 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:42:30,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:42:30,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:42:30,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:42:30,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (1/1) ... [2022-12-06 05:42:30,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:42:30,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:30,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:42:30,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:42:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:42:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:42:30,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:42:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:42:30,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:42:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:42:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:42:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:42:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:42:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:42:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:42:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:42:30,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:42:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:42:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:42:30,944 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:42:31,054 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:42:31,056 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:42:31,394 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:42:31,492 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:42:31,492 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:42:31,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:31 BoogieIcfgContainer [2022-12-06 05:42:31,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:42:31,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:42:31,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:42:31,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:42:31,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:42:30" (1/3) ... [2022-12-06 05:42:31,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a351b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:42:31, skipping insertion in model container [2022-12-06 05:42:31,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:30" (2/3) ... [2022-12-06 05:42:31,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a351b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:42:31, skipping insertion in model container [2022-12-06 05:42:31,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:31" (3/3) ... [2022-12-06 05:42:31,502 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-12-06 05:42:31,524 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:42:31,525 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:42:31,525 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:42:31,622 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:42:31,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 163 transitions, 342 flow [2022-12-06 05:42:31,759 INFO L130 PetriNetUnfolder]: 13/161 cut-off events. [2022-12-06 05:42:31,762 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:42:31,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 161 events. 13/161 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-06 05:42:31,768 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 163 transitions, 342 flow [2022-12-06 05:42:31,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 153 transitions, 318 flow [2022-12-06 05:42:31,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:31,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-06 05:42:31,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 153 transitions, 318 flow [2022-12-06 05:42:31,861 INFO L130 PetriNetUnfolder]: 13/153 cut-off events. [2022-12-06 05:42:31,861 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:42:31,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 153 events. 13/153 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-06 05:42:31,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-06 05:42:31,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 05:42:38,082 INFO L203 LiptonReduction]: Total number of compositions: 134 [2022-12-06 05:42:38,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:42:38,098 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;@6fdd3a70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:42:38,098 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:42:38,101 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-06 05:42:38,101 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:42:38,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:38,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:38,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:38,106 INFO L85 PathProgramCache]: Analyzing trace with hash -737479510, now seen corresponding path program 1 times [2022-12-06 05:42:38,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:38,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979531507] [2022-12-06 05:42:38,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:38,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:38,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:38,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979531507] [2022-12-06 05:42:38,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979531507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:38,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:38,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:42:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48441448] [2022-12-06 05:42:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:38,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:42:38,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:38,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:42:38,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:42:38,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:42:38,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:38,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:38,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:42:38,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:38,509 INFO L130 PetriNetUnfolder]: 81/147 cut-off events. [2022-12-06 05:42:38,510 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 05:42:38,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 81/147 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 424 event pairs, 24 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 240. Up to 88 conditions per place. [2022-12-06 05:42:38,513 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2022-12-06 05:42:38,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2022-12-06 05:42:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:42:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:42:38,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 05:42:38,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 05:42:38,522 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 32 transitions. [2022-12-06 05:42:38,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2022-12-06 05:42:38,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:42:38,527 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2022-12-06 05:42:38,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2022-12-06 05:42:38,532 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2022-12-06 05:42:38,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:38,533 INFO L89 Accepts]: Start accepts. Operand has 21 places, 21 transitions, 61 flow [2022-12-06 05:42:38,535 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:38,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:38,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-06 05:42:38,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 21 transitions, 61 flow [2022-12-06 05:42:38,549 INFO L130 PetriNetUnfolder]: 7/31 cut-off events. [2022-12-06 05:42:38,549 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:42:38,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 31 events. 7/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 22. Up to 8 conditions per place. [2022-12-06 05:42:38,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-06 05:42:38,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 05:42:38,559 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:38,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 05:42:38,561 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2022-12-06 05:42:38,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:38,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:38,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:38,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:42:38,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:38,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:38,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1426168016, now seen corresponding path program 1 times [2022-12-06 05:42:38,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:38,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566236795] [2022-12-06 05:42:38,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:38,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:38,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566236795] [2022-12-06 05:42:38,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566236795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:38,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:38,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:42:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601521009] [2022-12-06 05:42:38,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:38,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:38,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:38,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:38,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:42:38,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:38,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:38,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:42:38,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:38,771 INFO L130 PetriNetUnfolder]: 77/143 cut-off events. [2022-12-06 05:42:38,771 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 05:42:38,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 143 events. 77/143 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 428 event pairs, 11 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 114. Up to 88 conditions per place. [2022-12-06 05:42:38,772 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 27 selfloop transitions, 7 changer transitions 5/39 dead transitions. [2022-12-06 05:42:38,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 39 transitions, 185 flow [2022-12-06 05:42:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:42:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:42:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 05:42:38,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 05:42:38,775 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 4 states and 40 transitions. [2022-12-06 05:42:38,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 39 transitions, 185 flow [2022-12-06 05:42:38,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 39 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:42:38,777 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 99 flow [2022-12-06 05:42:38,777 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2022-12-06 05:42:38,777 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2022-12-06 05:42:38,777 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:38,777 INFO L89 Accepts]: Start accepts. Operand has 25 places, 25 transitions, 99 flow [2022-12-06 05:42:38,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:38,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:38,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 25 transitions, 99 flow [2022-12-06 05:42:38,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 99 flow [2022-12-06 05:42:38,789 INFO L130 PetriNetUnfolder]: 14/46 cut-off events. [2022-12-06 05:42:38,789 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-12-06 05:42:38,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 46 events. 14/46 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 111 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 64. Up to 15 conditions per place. [2022-12-06 05:42:38,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 99 flow [2022-12-06 05:42:38,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 05:42:38,798 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:38,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:42:38,800 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 99 flow [2022-12-06 05:42:38,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:38,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:38,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:38,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:42:38,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:38,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:38,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1982189810, now seen corresponding path program 2 times [2022-12-06 05:42:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:38,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137714817] [2022-12-06 05:42:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:38,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:38,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137714817] [2022-12-06 05:42:38,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137714817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:38,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:38,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:42:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571409336] [2022-12-06 05:42:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:38,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:38,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:38,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:38,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:42:38,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:38,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:38,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:42:38,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:39,004 INFO L130 PetriNetUnfolder]: 88/162 cut-off events. [2022-12-06 05:42:39,004 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-06 05:42:39,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 162 events. 88/162 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 13 based on Foata normal form. 10/170 useless extension candidates. Maximal degree in co-relation 169. Up to 86 conditions per place. [2022-12-06 05:42:39,006 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 32 selfloop transitions, 7 changer transitions 6/45 dead transitions. [2022-12-06 05:42:39,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 45 transitions, 244 flow [2022-12-06 05:42:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:42:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:42:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 05:42:39,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 05:42:39,008 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 99 flow. Second operand 5 states and 45 transitions. [2022-12-06 05:42:39,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 45 transitions, 244 flow [2022-12-06 05:42:39,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 45 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:42:39,010 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 122 flow [2022-12-06 05:42:39,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2022-12-06 05:42:39,011 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2022-12-06 05:42:39,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:39,011 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 122 flow [2022-12-06 05:42:39,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:39,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:39,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 122 flow [2022-12-06 05:42:39,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 122 flow [2022-12-06 05:42:39,018 INFO L130 PetriNetUnfolder]: 17/53 cut-off events. [2022-12-06 05:42:39,018 INFO L131 PetriNetUnfolder]: For 23/26 co-relation queries the response was YES. [2022-12-06 05:42:39,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 53 events. 17/53 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 2 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 105. Up to 15 conditions per place. [2022-12-06 05:42:39,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 122 flow [2022-12-06 05:42:39,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:42:39,021 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:39,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:42:39,022 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 122 flow [2022-12-06 05:42:39,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:39,022 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:39,022 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:39,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:42:39,023 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:39,023 INFO L85 PathProgramCache]: Analyzing trace with hash 552214239, now seen corresponding path program 1 times [2022-12-06 05:42:39,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:39,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513956819] [2022-12-06 05:42:39,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:39,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:39,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:39,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:39,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513956819] [2022-12-06 05:42:39,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513956819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:39,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:39,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:42:39,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619190128] [2022-12-06 05:42:39,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:39,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:39,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:39,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:39,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:39,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:42:39,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:39,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:39,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:42:39,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:39,178 INFO L130 PetriNetUnfolder]: 84/167 cut-off events. [2022-12-06 05:42:39,178 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-06 05:42:39,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 167 events. 84/167 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 46 based on Foata normal form. 10/174 useless extension candidates. Maximal degree in co-relation 267. Up to 150 conditions per place. [2022-12-06 05:42:39,179 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 25 selfloop transitions, 2 changer transitions 11/38 dead transitions. [2022-12-06 05:42:39,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 242 flow [2022-12-06 05:42:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:42:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:42:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 05:42:39,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2022-12-06 05:42:39,180 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 122 flow. Second operand 4 states and 33 transitions. [2022-12-06 05:42:39,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 242 flow [2022-12-06 05:42:39,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 229 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:42:39,182 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 130 flow [2022-12-06 05:42:39,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-12-06 05:42:39,183 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2022-12-06 05:42:39,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:39,183 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 130 flow [2022-12-06 05:42:39,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:39,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:39,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 130 flow [2022-12-06 05:42:39,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 130 flow [2022-12-06 05:42:39,189 INFO L130 PetriNetUnfolder]: 20/59 cut-off events. [2022-12-06 05:42:39,189 INFO L131 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-12-06 05:42:39,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 59 events. 20/59 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 154 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 132. Up to 17 conditions per place. [2022-12-06 05:42:39,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 130 flow [2022-12-06 05:42:39,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 05:42:39,447 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:42:39,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-06 05:42:39,448 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 126 flow [2022-12-06 05:42:39,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:39,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:39,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:39,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:42:39,449 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:39,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1761523476, now seen corresponding path program 1 times [2022-12-06 05:42:39,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:39,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152270967] [2022-12-06 05:42:39,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:39,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:39,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:39,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152270967] [2022-12-06 05:42:39,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152270967] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:39,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332866619] [2022-12-06 05:42:39,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:39,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:39,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:39,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:39,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:42:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:39,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:42:39,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:39,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:39,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332866619] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:39,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:39,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 05:42:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732156214] [2022-12-06 05:42:39,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:39,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:42:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:39,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:42:39,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:42:39,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:42:39,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 126 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:39,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:39,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:42:39,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:39,881 INFO L130 PetriNetUnfolder]: 109/207 cut-off events. [2022-12-06 05:42:39,881 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-06 05:42:39,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 207 events. 109/207 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 682 event pairs, 2 based on Foata normal form. 8/214 useless extension candidates. Maximal degree in co-relation 662. Up to 77 conditions per place. [2022-12-06 05:42:39,882 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 47 selfloop transitions, 15 changer transitions 4/66 dead transitions. [2022-12-06 05:42:39,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 66 transitions, 406 flow [2022-12-06 05:42:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:42:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:42:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-12-06 05:42:39,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38011695906432746 [2022-12-06 05:42:39,885 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 126 flow. Second operand 9 states and 65 transitions. [2022-12-06 05:42:39,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 66 transitions, 406 flow [2022-12-06 05:42:39,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 66 transitions, 396 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:42:39,889 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 218 flow [2022-12-06 05:42:39,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-06 05:42:39,890 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2022-12-06 05:42:39,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:39,891 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 218 flow [2022-12-06 05:42:39,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:39,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:39,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 218 flow [2022-12-06 05:42:39,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 218 flow [2022-12-06 05:42:39,898 INFO L130 PetriNetUnfolder]: 19/64 cut-off events. [2022-12-06 05:42:39,899 INFO L131 PetriNetUnfolder]: For 78/82 co-relation queries the response was YES. [2022-12-06 05:42:39,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 64 events. 19/64 cut-off events. For 78/82 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 172 event pairs, 2 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 179. Up to 20 conditions per place. [2022-12-06 05:42:39,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 218 flow [2022-12-06 05:42:39,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 05:42:39,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:42:40,091 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:42:40,161 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:42:40,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 05:42:40,162 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 224 flow [2022-12-06 05:42:40,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:40,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:40,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:40,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:42:40,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:40,363 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:40,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:40,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2005601282, now seen corresponding path program 2 times [2022-12-06 05:42:40,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:40,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584602454] [2022-12-06 05:42:40,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:40,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:40,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584602454] [2022-12-06 05:42:40,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584602454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:40,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:40,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:42:40,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467103418] [2022-12-06 05:42:40,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:40,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:40,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:40,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:40,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:40,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:42:40,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:40,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:40,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:42:40,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:40,514 INFO L130 PetriNetUnfolder]: 99/176 cut-off events. [2022-12-06 05:42:40,514 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2022-12-06 05:42:40,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 176 events. 99/176 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 21 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 465. Up to 150 conditions per place. [2022-12-06 05:42:40,515 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 30 selfloop transitions, 4 changer transitions 3/37 dead transitions. [2022-12-06 05:42:40,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 304 flow [2022-12-06 05:42:40,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:42:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:42:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 05:42:40,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 05:42:40,516 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 224 flow. Second operand 4 states and 32 transitions. [2022-12-06 05:42:40,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 304 flow [2022-12-06 05:42:40,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 276 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 05:42:40,518 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 183 flow [2022-12-06 05:42:40,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-12-06 05:42:40,519 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 20 predicate places. [2022-12-06 05:42:40,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:40,519 INFO L89 Accepts]: Start accepts. Operand has 42 places, 30 transitions, 183 flow [2022-12-06 05:42:40,520 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:40,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:40,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 183 flow [2022-12-06 05:42:40,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 183 flow [2022-12-06 05:42:40,525 INFO L130 PetriNetUnfolder]: 19/52 cut-off events. [2022-12-06 05:42:40,525 INFO L131 PetriNetUnfolder]: For 72/76 co-relation queries the response was YES. [2022-12-06 05:42:40,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 52 events. 19/52 cut-off events. For 72/76 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 116 event pairs, 2 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 148. Up to 16 conditions per place. [2022-12-06 05:42:40,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 183 flow [2022-12-06 05:42:40,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 05:42:40,529 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:40,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 05:42:40,530 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 183 flow [2022-12-06 05:42:40,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:40,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:40,530 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:40,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:42:40,530 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:40,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2130273651, now seen corresponding path program 1 times [2022-12-06 05:42:40,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:40,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290684455] [2022-12-06 05:42:40,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:40,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:40,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290684455] [2022-12-06 05:42:40,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290684455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:40,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:40,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:42:40,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664299752] [2022-12-06 05:42:40,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:40,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:40,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:40,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:42:40,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:40,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:40,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:42:40,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:40,674 INFO L130 PetriNetUnfolder]: 101/185 cut-off events. [2022-12-06 05:42:40,674 INFO L131 PetriNetUnfolder]: For 484/484 co-relation queries the response was YES. [2022-12-06 05:42:40,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 185 events. 101/185 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 488 event pairs, 50 based on Foata normal form. 10/191 useless extension candidates. Maximal degree in co-relation 530. Up to 171 conditions per place. [2022-12-06 05:42:40,676 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 29 selfloop transitions, 2 changer transitions 8/39 dead transitions. [2022-12-06 05:42:40,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 287 flow [2022-12-06 05:42:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:42:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:42:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 05:42:40,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2022-12-06 05:42:40,677 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 183 flow. Second operand 4 states and 35 transitions. [2022-12-06 05:42:40,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 287 flow [2022-12-06 05:42:40,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 260 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-06 05:42:40,680 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 179 flow [2022-12-06 05:42:40,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-06 05:42:40,680 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 15 predicate places. [2022-12-06 05:42:40,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:40,681 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 179 flow [2022-12-06 05:42:40,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:40,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:40,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 179 flow [2022-12-06 05:42:40,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 179 flow [2022-12-06 05:42:40,689 INFO L130 PetriNetUnfolder]: 20/54 cut-off events. [2022-12-06 05:42:40,689 INFO L131 PetriNetUnfolder]: For 42/46 co-relation queries the response was YES. [2022-12-06 05:42:40,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 54 events. 20/54 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 116 event pairs, 2 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 157. Up to 17 conditions per place. [2022-12-06 05:42:40,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 179 flow [2022-12-06 05:42:40,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 05:42:41,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:42:41,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1022 [2022-12-06 05:42:41,703 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 175 flow [2022-12-06 05:42:41,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:41,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:41,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:41,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:42:41,704 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash -898511417, now seen corresponding path program 1 times [2022-12-06 05:42:41,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:41,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538482751] [2022-12-06 05:42:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:41,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:42,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:42,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538482751] [2022-12-06 05:42:42,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538482751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:42,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624434608] [2022-12-06 05:42:42,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:42,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:42,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:42,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:42,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:42:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:42,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 05:42:42,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:42,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-06 05:42:42,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:42:42,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:42:42,958 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:42:42,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-06 05:42:43,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:42:43,040 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 05:42:43,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-06 05:42:43,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:42:43,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:42:43,323 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 05:42:43,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 20 [2022-12-06 05:42:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:43,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:44,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624434608] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:44,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:44,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-06 05:42:44,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799940572] [2022-12-06 05:42:44,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:44,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 05:42:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:44,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 05:42:44,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=648, Unknown=10, NotChecked=0, Total=756 [2022-12-06 05:42:44,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:42:44,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 175 flow. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:44,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:44,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:42:44,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:47,713 INFO L130 PetriNetUnfolder]: 325/576 cut-off events. [2022-12-06 05:42:47,714 INFO L131 PetriNetUnfolder]: For 868/868 co-relation queries the response was YES. [2022-12-06 05:42:47,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 576 events. 325/576 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2470 event pairs, 14 based on Foata normal form. 11/580 useless extension candidates. Maximal degree in co-relation 2178. Up to 200 conditions per place. [2022-12-06 05:42:47,718 INFO L137 encePairwiseOnDemand]: 6/22 looper letters, 91 selfloop transitions, 82 changer transitions 16/189 dead transitions. [2022-12-06 05:42:47,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 189 transitions, 1322 flow [2022-12-06 05:42:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 05:42:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 05:42:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 179 transitions. [2022-12-06 05:42:47,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2624633431085044 [2022-12-06 05:42:47,722 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 175 flow. Second operand 31 states and 179 transitions. [2022-12-06 05:42:47,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 189 transitions, 1322 flow [2022-12-06 05:42:47,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 189 transitions, 1294 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 05:42:47,728 INFO L231 Difference]: Finished difference. Result has 78 places, 108 transitions, 987 flow [2022-12-06 05:42:47,729 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=987, PETRI_PLACES=78, PETRI_TRANSITIONS=108} [2022-12-06 05:42:47,730 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 56 predicate places. [2022-12-06 05:42:47,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:47,730 INFO L89 Accepts]: Start accepts. Operand has 78 places, 108 transitions, 987 flow [2022-12-06 05:42:47,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:47,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:47,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 108 transitions, 987 flow [2022-12-06 05:42:47,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 108 transitions, 987 flow [2022-12-06 05:42:47,771 INFO L130 PetriNetUnfolder]: 94/237 cut-off events. [2022-12-06 05:42:47,771 INFO L131 PetriNetUnfolder]: For 824/828 co-relation queries the response was YES. [2022-12-06 05:42:47,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 237 events. 94/237 cut-off events. For 824/828 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1052 event pairs, 5 based on Foata normal form. 2/238 useless extension candidates. Maximal degree in co-relation 1006. Up to 76 conditions per place. [2022-12-06 05:42:47,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 108 transitions, 987 flow [2022-12-06 05:42:47,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-06 05:42:47,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:42:50,710 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:42:50,916 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L52-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_92) (< v_~q1_front~0_125 v_~q1_back~0_133)) 1 0) 0)) (< v_~i~0_135 v_~N~0_86) (not (= (ite (and (<= 0 v_~q2_back~0_139) (< v_~q2_back~0_139 v_~n2~0_100)) 1 0) 0)) (= v_~q2_back~0_138 (+ v_~q2_back~0_139 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (= (ite (= (select (select |v_#memory_int_235| v_~q2~0.base_87) (+ v_~q2~0.offset_87 (* 4 v_~q2_back~0_139))) v_~i~0_135) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| 0)) (= (+ (select (select |v_#memory_int_235| v_~q1~0.base_101) (+ v_~q1~0.offset_101 (* v_~q1_front~0_125 4))) 1) v_~i~0_135)) InVars {~q1~0.offset=v_~q1~0.offset_101, ~n2~0=v_~n2~0_100, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_133, ~q2~0.offset=v_~q2~0.offset_87, ~n1~0=v_~n1~0_92, ~q1~0.base=v_~q1~0.base_101, #memory_int=|v_#memory_int_235|, ~q2~0.base=v_~q2~0.base_87, ~N~0=v_~N~0_86, ~q2_back~0=v_~q2_back~0_139} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, ~q1~0.offset=v_~q1~0.offset_101, ~n2~0=v_~n2~0_100, ~q1_front~0=v_~q1_front~0_124, ~i~0=v_~i~0_135, ~q2~0.offset=v_~q2~0.offset_87, ~n1~0=v_~n1~0_92, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_37|, ~N~0=v_~N~0_86, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, ~q1_back~0=v_~q1_back~0_133, ~q1~0.base=v_~q1~0.base_101, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_43|, ~q2~0.base=v_~q2~0.base_87, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_37|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_29|, ~q2_back~0=v_~q2_back~0_138} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:42:51,033 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:51,033 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:51,033 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:51,033 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:51,033 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:51,033 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:51,136 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:42:53,052 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:53,052 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:53,151 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:42:53,228 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:42:59,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:42:59,939 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:43:00,017 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:43:00,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [717] L65-1-->L47-1: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_17| 0) (= (ite (and (< v_~q1_front~0_147 v_~q1_back~0_145) (<= 0 v_~q1_front~0_147) (< v_~q1_front~0_147 v_~n1~0_104)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (not (< v_~j~0_137 v_~N~0_100)) (= (+ (select (select |v_#memory_int_257| v_~q1~0.base_115) (+ (* v_~q1_front~0_147 4) v_~q1~0.offset_115)) 1) v_~i~0_153) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_17|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| 0)) (= v_~q1_front~0_146 (+ v_~q1_front~0_147 1))) InVars {~j~0=v_~j~0_137, ~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_147, ~q1_back~0=v_~q1_back~0_145, ~n1~0=v_~n1~0_104, ~q1~0.base=v_~q1~0.base_115, #memory_int=|v_#memory_int_257|, ~N~0=v_~N~0_100} OutVars{~j~0=v_~j~0_137, ~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_146, ~i~0=v_~i~0_153, ~n1~0=v_~n1~0_104, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_47|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_17|, ~N~0=v_~N~0_100, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_17|, ~q1_back~0=v_~q1_back~0_145, ~q1~0.base=v_~q1~0.base_115, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_53|, #memory_int=|v_#memory_int_257|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:00,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:43:00,247 INFO L203 LiptonReduction]: Total number of compositions: 14 [2022-12-06 05:43:00,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12518 [2022-12-06 05:43:00,248 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 102 transitions, 1081 flow [2022-12-06 05:43:00,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:00,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:00,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:00,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:00,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-06 05:43:00,449 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:00,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:00,449 INFO L85 PathProgramCache]: Analyzing trace with hash 354599695, now seen corresponding path program 1 times [2022-12-06 05:43:00,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:00,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6391876] [2022-12-06 05:43:00,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:00,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:01,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:01,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6391876] [2022-12-06 05:43:01,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6391876] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:01,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856063435] [2022-12-06 05:43:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:01,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:01,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:01,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:01,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:43:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:01,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 05:43:01,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:01,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1686 treesize of output 1654 [2022-12-06 05:43:01,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 05:43:01,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:43:01,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:43:01,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:43:01,682 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 05:43:01,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2022-12-06 05:43:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:01,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:02,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856063435] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:02,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:02,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-06 05:43:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145684042] [2022-12-06 05:43:02,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:02,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 05:43:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:02,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 05:43:02,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=427, Unknown=3, NotChecked=0, Total=506 [2022-12-06 05:43:02,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:43:02,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 102 transitions, 1081 flow. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:02,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:02,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:43:02,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:05,106 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~q2_front~0 4)) (.cse17 (* c_~q2_back~0 4))) (let ((.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q2_back~0 c_~n2~0))) (.cse2 (not (< c_~q1_back~0 c_~n1~0))) (.cse3 (not (<= 0 c_~q2_back~0))) (.cse11 (+ c_~i~0 1)) (.cse19 (+ .cse17 c_~q2~0.offset)) (.cse22 (+ c_~q2~0.offset .cse16)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (or .cse0 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 .cse3 (let ((.cse7 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230))) (let ((.cse4 (select .cse9 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse4 .cse5))) (forall ((~q2~0.base Int)) (let ((.cse6 (select .cse9 ~q2~0.base))) (or (not (= c_~i~0 (select .cse6 .cse7))) (< (select .cse6 .cse8) c_~i~0)))) (< (select .cse4 .cse10) .cse11))))) (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230))) (let ((.cse12 (select .cse15 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse12 .cse5))) (forall ((~q2~0.base Int)) (let ((.cse14 (select .cse15 ~q2~0.base))) (let ((.cse13 (select .cse14 .cse8))) (or (< .cse13 (+ (select .cse12 .cse10) 1)) (not (= c_~i~0 (select .cse14 .cse7))) (< .cse13 c_~i~0)))))))))))) (<= c_~j~0 1) (or .cse0 .cse1 .cse2 .cse3 (and (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230))) (let ((.cse21 (select .cse23 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse18 (select .cse23 ~q2~0.base))) (let ((.cse20 (select .cse18 .cse22))) (or (not (= (select .cse18 .cse19) c_~i~0)) (< .cse20 c_~i~0) (< .cse20 (+ (select .cse21 .cse10) 1)))))) (not (= c_~j~0 (select .cse21 .cse5))))))) (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230))) (let ((.cse26 (select .cse25 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse24 (select .cse25 ~q2~0.base))) (or (not (= (select .cse24 .cse19) c_~i~0)) (< (select .cse24 .cse22) c_~i~0)))) (< (select .cse26 .cse10) .cse11) (not (= c_~j~0 (select .cse26 .cse5))))))))) (= c_~i~0 1) (let ((.cse27 (select |c_#memory_int| c_~q1~0.base))) (or (not (= (select .cse27 .cse5) c_~j~0)) .cse0 .cse1 .cse2 .cse3 (let ((.cse28 (select .cse27 .cse10))) (and (or (< .cse28 .cse11) (forall ((~q2~0.base Int)) (let ((.cse29 (select |c_#memory_int| ~q2~0.base))) (or (< (select .cse29 .cse22) c_~i~0) (not (= (select .cse29 .cse19) c_~i~0)))))) (forall ((~q2~0.base Int)) (let ((.cse31 (select |c_#memory_int| ~q2~0.base))) (let ((.cse30 (select .cse31 .cse22))) (or (< .cse30 c_~i~0) (< .cse30 (+ .cse28 1)) (not (= (select .cse31 .cse19) c_~i~0)))))))))) (<= 1 c_~j~0)))) is different from false [2022-12-06 05:43:06,173 INFO L130 PetriNetUnfolder]: 579/981 cut-off events. [2022-12-06 05:43:06,173 INFO L131 PetriNetUnfolder]: For 4650/4650 co-relation queries the response was YES. [2022-12-06 05:43:06,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5587 conditions, 981 events. 579/981 cut-off events. For 4650/4650 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4610 event pairs, 9 based on Foata normal form. 8/985 useless extension candidates. Maximal degree in co-relation 5410. Up to 509 conditions per place. [2022-12-06 05:43:06,185 INFO L137 encePairwiseOnDemand]: 8/41 looper letters, 119 selfloop transitions, 168 changer transitions 17/304 dead transitions. [2022-12-06 05:43:06,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 304 transitions, 3537 flow [2022-12-06 05:43:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 05:43:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 05:43:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 207 transitions. [2022-12-06 05:43:06,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16829268292682928 [2022-12-06 05:43:06,187 INFO L175 Difference]: Start difference. First operand has 70 places, 102 transitions, 1081 flow. Second operand 30 states and 207 transitions. [2022-12-06 05:43:06,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 304 transitions, 3537 flow [2022-12-06 05:43:06,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 304 transitions, 2997 flow, removed 258 selfloop flow, removed 4 redundant places. [2022-12-06 05:43:06,222 INFO L231 Difference]: Finished difference. Result has 108 places, 230 transitions, 2782 flow [2022-12-06 05:43:06,222 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2782, PETRI_PLACES=108, PETRI_TRANSITIONS=230} [2022-12-06 05:43:06,223 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 86 predicate places. [2022-12-06 05:43:06,223 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:06,223 INFO L89 Accepts]: Start accepts. Operand has 108 places, 230 transitions, 2782 flow [2022-12-06 05:43:06,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:06,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:06,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 230 transitions, 2782 flow [2022-12-06 05:43:06,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 230 transitions, 2782 flow [2022-12-06 05:43:06,274 INFO L130 PetriNetUnfolder]: 225/495 cut-off events. [2022-12-06 05:43:06,274 INFO L131 PetriNetUnfolder]: For 2535/2546 co-relation queries the response was YES. [2022-12-06 05:43:06,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 495 events. 225/495 cut-off events. For 2535/2546 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2596 event pairs, 14 based on Foata normal form. 8/489 useless extension candidates. Maximal degree in co-relation 2538. Up to 177 conditions per place. [2022-12-06 05:43:06,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 230 transitions, 2782 flow [2022-12-06 05:43:06,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 506 [2022-12-06 05:43:06,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:06,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:06,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [708] L52-->L65-1: Formula: (and (= (+ (select (select |v_#memory_int_233| v_~q1~0.base_99) (+ v_~q1~0.offset_99 (* v_~q1_front~0_121 4))) 1) v_~i~0_133) (= (+ v_~q2_front~0_118 1) v_~q2_front~0_117) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= (ite (and (<= 0 v_~q2_front~0_118) (< v_~q2_front~0_118 v_~n2~0_98) (< v_~q2_front~0_118 v_~q2_back~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~j~0_127 (+ (select (select |v_#memory_int_233| v_~q2~0.base_85) (+ v_~q2~0.offset_85 (* v_~q2_front~0_118 4))) 1)) (= (ite (and (<= 0 v_~q1_front~0_121) (< v_~q1_front~0_121 v_~q1_back~0_131) (< v_~q1_front~0_121 v_~n1~0_90)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~q1_front~0_120 (+ v_~q1_front~0_121 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| 0))) InVars {~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_121, ~q1_back~0=v_~q1_back~0_131, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, ~q2_front~0=v_~q2_front~0_118, ~q2~0.base=v_~q2~0.base_85, ~q2_back~0=v_~q2_back~0_136} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_38|, ~j~0=v_~j~0_127, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_32|, ~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_120, ~i~0=v_~i~0_133, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, ~q2_front~0=v_~q2_front~0_117, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_32|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~q1_back~0=v_~q1_back~0_131, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~q2~0.base=v_~q2~0.base_85, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_35|, ~q2_back~0=v_~q2_back~0_136} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:43:06,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [708] L52-->L65-1: Formula: (and (= (+ (select (select |v_#memory_int_233| v_~q1~0.base_99) (+ v_~q1~0.offset_99 (* v_~q1_front~0_121 4))) 1) v_~i~0_133) (= (+ v_~q2_front~0_118 1) v_~q2_front~0_117) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= (ite (and (<= 0 v_~q2_front~0_118) (< v_~q2_front~0_118 v_~n2~0_98) (< v_~q2_front~0_118 v_~q2_back~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~j~0_127 (+ (select (select |v_#memory_int_233| v_~q2~0.base_85) (+ v_~q2~0.offset_85 (* v_~q2_front~0_118 4))) 1)) (= (ite (and (<= 0 v_~q1_front~0_121) (< v_~q1_front~0_121 v_~q1_back~0_131) (< v_~q1_front~0_121 v_~n1~0_90)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~q1_front~0_120 (+ v_~q1_front~0_121 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| 0))) InVars {~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_121, ~q1_back~0=v_~q1_back~0_131, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, ~q2_front~0=v_~q2_front~0_118, ~q2~0.base=v_~q2~0.base_85, ~q2_back~0=v_~q2_back~0_136} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_38|, ~j~0=v_~j~0_127, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_32|, ~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_120, ~i~0=v_~i~0_133, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, ~q2_front~0=v_~q2_front~0_117, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_32|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~q1_back~0=v_~q1_back~0_131, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~q2~0.base=v_~q2~0.base_85, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_35|, ~q2_back~0=v_~q2_back~0_136} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] [2022-12-06 05:43:07,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [708] L52-->L65-1: Formula: (and (= (+ (select (select |v_#memory_int_233| v_~q1~0.base_99) (+ v_~q1~0.offset_99 (* v_~q1_front~0_121 4))) 1) v_~i~0_133) (= (+ v_~q2_front~0_118 1) v_~q2_front~0_117) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= (ite (and (<= 0 v_~q2_front~0_118) (< v_~q2_front~0_118 v_~n2~0_98) (< v_~q2_front~0_118 v_~q2_back~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~j~0_127 (+ (select (select |v_#memory_int_233| v_~q2~0.base_85) (+ v_~q2~0.offset_85 (* v_~q2_front~0_118 4))) 1)) (= (ite (and (<= 0 v_~q1_front~0_121) (< v_~q1_front~0_121 v_~q1_back~0_131) (< v_~q1_front~0_121 v_~n1~0_90)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~q1_front~0_120 (+ v_~q1_front~0_121 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| 0))) InVars {~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_121, ~q1_back~0=v_~q1_back~0_131, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, ~q2_front~0=v_~q2_front~0_118, ~q2~0.base=v_~q2~0.base_85, ~q2_back~0=v_~q2_back~0_136} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_38|, ~j~0=v_~j~0_127, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_32|, ~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_120, ~i~0=v_~i~0_133, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, ~q2_front~0=v_~q2_front~0_117, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_32|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~q1_back~0=v_~q1_back~0_131, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~q2~0.base=v_~q2~0.base_85, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_35|, ~q2_back~0=v_~q2_back~0_136} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:43:07,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-06 05:43:07,312 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-06 05:43:07,742 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:07,742 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:07,937 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:08,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:08,082 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:08,150 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:08,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:08,469 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,469 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,469 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,469 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,469 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,470 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,470 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,470 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:43:08,752 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,752 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,752 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,752 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,752 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,753 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,753 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:08,753 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:09,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [743] L47-1-->L97-3: Formula: (and (= (ite (= (select (select |v_#memory_int_335| v_~q2~0.base_144) (+ v_~q2~0.offset_144 (* 4 v_~q2_back~0_220))) v_~i~0_206) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_126|) (= (store |v_#memory_int_335| |v_ULTIMATE.start_main_~#t2~0#1.base_61| (store (select |v_#memory_int_335| |v_ULTIMATE.start_main_~#t2~0#1.base_61|) |v_ULTIMATE.start_main_~#t2~0#1.offset_61| |v_ULTIMATE.start_main_#t~pre20#1_69|)) |v_#memory_int_334|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_126| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_126|) (not (= (ite (and (<= 0 v_~q2_back~0_220) (< v_~q2_back~0_220 v_~n2~0_154)) 1 0) 0)) (= (+ v_~q2_back~0_220 1) v_~q2_back~0_219) (< v_~i~0_206 v_~N~0_146) (= (+ |v_#pthreadsForks_64| 1) |v_#pthreadsForks_63|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_126| 0)) (= |v_#pthreadsForks_64| |v_ULTIMATE.start_main_#t~pre20#1_69|)) InVars {#pthreadsForks=|v_#pthreadsForks_64|, ~n2~0=v_~n2~0_154, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ~i~0=v_~i~0_206, ~q2~0.offset=v_~q2~0.offset_144, #memory_int=|v_#memory_int_335|, ~q2~0.base=v_~q2~0.base_144, ~N~0=v_~N~0_146, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_61|, ~q2_back~0=v_~q2_back~0_220} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_67|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_57|, ~n2~0=v_~n2~0_154, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ~i~0=v_~i~0_206, ~q2~0.offset=v_~q2~0.offset_144, ~N~0=v_~N~0_146, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_126|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_69|, #pthreadsForks=|v_#pthreadsForks_63|, #memory_int=|v_#memory_int_334|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_126|, ~q2~0.base=v_~q2~0.base_144, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_50|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_61|, ~q2_back~0=v_~q2_back~0_219} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:09,307 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:09,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:11,241 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:43:11,383 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [745] L70-->L70: Formula: (and (= v_~q2_front~0_180 (+ v_~q2_front~0_181 1)) (= (ite (= v_~j~0_184 (select (select |v_#memory_int_340| v_~q1~0.base_163) (+ (* v_~q1_back~0_201 4) v_~q1~0.offset_163))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_201) (< v_~q1_back~0_201 v_~n1~0_150)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_90|) (not (= (ite (and (<= 0 v_~q2_front~0_181) (< v_~q2_front~0_181 v_~q2_back~0_227) (< v_~q2_front~0_181 v_~n2~0_158)) 1 0) 0)) (= (+ v_~q1_back~0_201 1) v_~q1_back~0_200) (< v_~j~0_184 v_~N~0_150) (= v_~j~0_184 (+ (select (select |v_#memory_int_340| v_~q2~0.base_148) (+ (* v_~q2_front~0_181 4) v_~q2~0.offset_148)) 1))) InVars {~q1~0.offset=v_~q1~0.offset_163, ~n2~0=v_~n2~0_158, ~q1_back~0=v_~q1_back~0_201, ~n1~0=v_~n1~0_150, ~q2~0.offset=v_~q2~0.offset_148, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_340|, ~q2_front~0=v_~q2_front~0_181, ~q2~0.base=v_~q2~0.base_148, ~N~0=v_~N~0_150, ~q2_back~0=v_~q2_back~0_227} OutVars{~j~0=v_~j~0_184, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_64|, ~q1~0.offset=v_~q1~0.offset_163, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_58|, ~n2~0=v_~n2~0_158, ~n1~0=v_~n1~0_150, ~q2~0.offset=v_~q2~0.offset_148, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_90|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_38|, ~q2_front~0=v_~q2_front~0_180, ~N~0=v_~N~0_150, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_38|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, ~q1_back~0=v_~q1_back~0_200, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_340|, ~q2~0.base=v_~q2~0.base_148, ~q2_back~0=v_~q2_back~0_227} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:43:11,383 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,383 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,383 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,384 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,384 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,384 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,384 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,384 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [746] L70-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_342| v_~q1~0.base_165))) (and (= (+ v_~q1_back~0_205 1) v_~q1_back~0_204) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132| 0)) (not (= (ite (and (< v_~q2_front~0_185 v_~n2~0_160) (< v_~q2_front~0_185 v_~q2_back~0_229) (<= 0 v_~q2_front~0_185)) 1 0) 0)) (= (+ v_~q1_front~0_224 1) v_~q1_front~0_223) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| 0)) (= (ite (= v_~j~0_186 (select .cse0 (+ (* v_~q1_back~0_205 4) v_~q1~0.offset_165))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= v_~j~0_186 (+ (select (select |v_#memory_int_342| v_~q2~0.base_150) (+ v_~q2~0.offset_150 (* v_~q2_front~0_185 4))) 1)) (not (= (ite (and (<= 0 v_~q1_back~0_205) (< v_~q1_back~0_205 v_~n1~0_152)) 1 0) 0)) (= (ite (and (<= 0 v_~q1_front~0_224) (< v_~q1_front~0_224 v_~n1~0_152) (< v_~q1_front~0_224 v_~q1_back~0_204)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132|) (= (+ (select .cse0 (+ (* v_~q1_front~0_224 4) v_~q1~0.offset_165)) 1) v_~i~0_212) (= (+ v_~q2_front~0_185 1) v_~q2_front~0_184) (< v_~j~0_186 v_~N~0_152) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132|))) InVars {~q1~0.offset=v_~q1~0.offset_165, ~q1_front~0=v_~q1_front~0_224, ~n2~0=v_~n2~0_160, ~q1_back~0=v_~q1_back~0_205, ~n1~0=v_~n1~0_152, ~q2~0.offset=v_~q2~0.offset_150, ~q1~0.base=v_~q1~0.base_165, #memory_int=|v_#memory_int_342|, ~q2_front~0=v_~q2_front~0_185, ~q2~0.base=v_~q2~0.base_150, ~N~0=v_~N~0_152, ~q2_back~0=v_~q2_back~0_229} OutVars{~j~0=v_~j~0_186, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_66|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_60|, ~q1_front~0=v_~q1_front~0_223, ~n1~0=v_~n1~0_152, ~q2~0.offset=v_~q2~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_60|, ~q1_back~0=v_~q1_back~0_204, ~q1~0.base=v_~q1~0.base_165, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_89|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132|, ~q2~0.base=v_~q2~0.base_150, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_83|, ~q2_back~0=v_~q2_back~0_229, ~q1~0.offset=v_~q1~0.offset_165, ~n2~0=v_~n2~0_160, ~i~0=v_~i~0_212, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_83|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_40|, ~q2_front~0=v_~q2_front~0_184, ~N~0=v_~N~0_152, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_40|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132|, #memory_int=|v_#memory_int_342|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:11,584 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,584 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,584 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,584 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,584 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,584 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,584 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,584 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [748] L70-->L65-1: Formula: (let ((.cse1 (select |v_#memory_int_344| v_~q2~0.base_152))) (let ((.cse0 (+ (select .cse1 (+ v_~q2~0.offset_152 (* v_~q2_front~0_190 4))) 1))) (and (not (= (ite (= .cse0 (select (select |v_#memory_int_344| v_~q1~0.base_167) (+ (* v_~q1_back~0_209 4) v_~q1~0.offset_167))) 1 0) 0)) (= (+ v_~q1_back~0_209 1) v_~q1_back~0_208) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_98|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< v_~q2_front~0_190 v_~n2~0_162) (< v_~q2_front~0_190 v_~q2_back~0_231) (<= 0 v_~q2_front~0_190)) 1 0) 0)) (< .cse0 v_~N~0_154) (= (ite (and (<= 1 v_~q2_front~0_188) (< v_~q2_front~0_188 (+ v_~q2_back~0_231 1)) (< v_~q2_front~0_188 (+ v_~n2~0_162 1))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_98|) (not (= (ite (and (<= 0 v_~q1_back~0_209) (< v_~q1_back~0_209 v_~n1~0_154)) 1 0) 0)) (= v_~j~0_188 (+ (select .cse1 (+ (* v_~q2_front~0_188 4) v_~q2~0.offset_152 (- 4))) 1)) (= (+ 2 v_~q2_front~0_190) v_~q2_front~0_188)))) InVars {~q1~0.offset=v_~q1~0.offset_167, ~n2~0=v_~n2~0_162, ~q1_back~0=v_~q1_back~0_209, ~q2~0.offset=v_~q2~0.offset_152, ~n1~0=v_~n1~0_154, ~q1~0.base=v_~q1~0.base_167, #memory_int=|v_#memory_int_344|, ~q2_front~0=v_~q2_front~0_190, ~q2~0.base=v_~q2~0.base_152, ~N~0=v_~N~0_154, ~q2_back~0=v_~q2_back~0_231} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_68|, ~j~0=v_~j~0_188, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_62|, ~q1~0.offset=v_~q1~0.offset_167, ~n2~0=v_~n2~0_162, ~q2~0.offset=v_~q2~0.offset_152, ~n1~0=v_~n1~0_154, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_98|, ~q2_front~0=v_~q2_front~0_188, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_42|, ~N~0=v_~N~0_154, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_42|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_62|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_98|, ~q1_back~0=v_~q1_back~0_208, ~q1~0.base=v_~q1~0.base_167, #memory_int=|v_#memory_int_344|, ~q2~0.base=v_~q2~0.base_152, ~q2_back~0=v_~q2_back~0_231} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:43:11,896 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,896 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,897 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,897 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,897 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,897 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,897 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:11,897 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,086 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [749] L70-->L47-1: Formula: (and (= (+ v_~q2_front~0_195 1) v_~q2_front~0_194) (= (ite (and (<= 0 v_~q2_front~0_195) (< v_~q2_front~0_195 v_~n2~0_164) (< v_~q2_front~0_195 v_~q2_back~0_233)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134| (ite (and (< v_~q1_front~0_228 v_~q1_back~0_212) (<= 0 v_~q1_front~0_228) (< v_~q1_front~0_228 v_~n1~0_156)) 1 0)) (not (< v_~j~0_192 v_~N~0_156)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_33| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_33|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_102|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_102| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (= (+ v_~q1_front~0_228 1) v_~q1_front~0_227) (= v_~j~0_192 (+ (select (select |v_#memory_int_346| v_~q2~0.base_154) (+ v_~q2~0.offset_154 (* v_~q2_front~0_195 4))) 1)) (= (+ (select (select |v_#memory_int_346| v_~q1~0.base_169) (+ v_~q1~0.offset_169 (* v_~q1_front~0_228 4))) 1) v_~i~0_214)) InVars {~q1~0.offset=v_~q1~0.offset_169, ~q1_front~0=v_~q1_front~0_228, ~n2~0=v_~n2~0_164, ~q1_back~0=v_~q1_back~0_212, ~n1~0=v_~n1~0_156, ~q2~0.offset=v_~q2~0.offset_154, ~q1~0.base=v_~q1~0.base_169, #memory_int=|v_#memory_int_346|, ~q2_front~0=v_~q2_front~0_195, ~q2~0.base=v_~q2~0.base_154, ~N~0=v_~N~0_156, ~q2_back~0=v_~q2_back~0_233} OutVars{~j~0=v_~j~0_192, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_72|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_66|, ~q1_front~0=v_~q1_front~0_227, ~n1~0=v_~n1~0_156, ~q2~0.offset=v_~q2~0.offset_154, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_66|, ~q1_back~0=v_~q1_back~0_212, ~q1~0.base=v_~q1~0.base_169, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_91|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, ~q2~0.base=v_~q2~0.base_154, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_85|, ~q2_back~0=v_~q2_back~0_233, ~q1~0.offset=v_~q1~0.offset_169, ~n2~0=v_~n2~0_164, ~i~0=v_~i~0_214, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_85|, ~q2_front~0=v_~q2_front~0_194, ~N~0=v_~N~0_156, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_33|, #memory_int=|v_#memory_int_346|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:12,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [750] L70-->L47-1: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136|) (= v_~q2_front~0_198 (+ v_~q2_front~0_199 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| (ite (and (< v_~q2_front~0_199 v_~q2_back~0_235) (< v_~q2_front~0_199 v_~n2~0_166) (<= 0 v_~q2_front~0_199)) 1 0)) (= (+ (select (select |v_#memory_int_348| v_~q1~0.base_171) (+ (* v_~q1_front~0_232 4) v_~q1~0.offset_171)) 1) v_~i~0_216) (= (ite (and (< v_~q1_front~0_232 v_~n1~0_158) (<= 0 v_~q1_front~0_232) (< v_~q1_front~0_232 v_~q1_back~0_214)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|) (= v_~q1_front~0_231 (+ v_~q1_front~0_232 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136| 0)) (= v_~j~0_194 (+ (select (select |v_#memory_int_348| v_~q2~0.base_156) (+ (* v_~q2_front~0_199 4) v_~q2~0.offset_156)) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|)) InVars {~q1~0.offset=v_~q1~0.offset_171, ~q1_front~0=v_~q1_front~0_232, ~n2~0=v_~n2~0_166, ~q1_back~0=v_~q1_back~0_214, ~n1~0=v_~n1~0_158, ~q2~0.offset=v_~q2~0.offset_156, ~q1~0.base=v_~q1~0.base_171, #memory_int=|v_#memory_int_348|, ~q2_front~0=v_~q2_front~0_199, ~q2~0.base=v_~q2~0.base_156, ~q2_back~0=v_~q2_back~0_235} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_74|, ~j~0=v_~j~0_194, ~q1~0.offset=v_~q1~0.offset_171, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_68|, ~q1_front~0=v_~q1_front~0_231, ~n2~0=v_~n2~0_166, ~i~0=v_~i~0_216, ~n1~0=v_~n1~0_158, ~q2~0.offset=v_~q2~0.offset_156, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_87|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104|, ~q2_front~0=v_~q2_front~0_198, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_68|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|, ~q1_back~0=v_~q1_back~0_214, ~q1~0.base=v_~q1~0.base_171, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_93|, #memory_int=|v_#memory_int_348|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136|, ~q2~0.base=v_~q2~0.base_156, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_87|, ~q2_back~0=v_~q2_back~0_235} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:12,963 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,964 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,964 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,964 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,964 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,964 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,964 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,964 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,257 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,257 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,257 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,258 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,258 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,258 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,258 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,258 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,693 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,693 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,694 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,694 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,694 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,694 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,694 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,694 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,992 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,993 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,993 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,993 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,993 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,993 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,993 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,993 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,409 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,409 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,409 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,409 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,409 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,409 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,409 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,409 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,570 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [720] L52-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_267| v_~q2~0.base_105))) (and (= (+ v_~q1_front~0_157 1) v_~q1_front~0_156) (not (= (ite (and (<= 0 v_~q2_back~0_169) (< v_~q2_back~0_169 v_~n2~0_118)) 1 0) 0)) (= v_~i~0_159 (+ (select (select |v_#memory_int_267| v_~q1~0.base_121) (+ (* v_~q1_front~0_157 4) v_~q1~0.offset_121)) 1)) (< v_~i~0_159 v_~N~0_106) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (not (= (ite (and (<= 0 v_~q1_front~0_157) (< v_~q1_front~0_157 v_~n1~0_110) (< v_~q1_front~0_157 v_~q1_back~0_151)) 1 0) 0)) (= (ite (and (<= 0 v_~q2_front~0_136) (< v_~q2_front~0_136 v_~q2_back~0_168) (< v_~q2_front~0_136 v_~n2~0_118)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|) (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_169) v_~q2~0.offset_105)) v_~i~0_159) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| 0)) (= (+ v_~q2_front~0_136 1) v_~q2_front~0_135) (= (+ v_~q2_back~0_169 1) v_~q2_back~0_168) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|) (= v_~j~0_141 (+ (select .cse0 (+ (* v_~q2_front~0_136 4) v_~q2~0.offset_105)) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_121, ~n2~0=v_~n2~0_118, ~q1_front~0=v_~q1_front~0_157, ~q1_back~0=v_~q1_back~0_151, ~q2~0.offset=v_~q2~0.offset_105, ~n1~0=v_~n1~0_110, ~q1~0.base=v_~q1~0.base_121, #memory_int=|v_#memory_int_267|, ~q2_front~0=v_~q2_front~0_136, ~q2~0.base=v_~q2~0.base_105, ~N~0=v_~N~0_106, ~q2_back~0=v_~q2_back~0_169} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_41|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_44|, ~j~0=v_~j~0_141, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_38|, ~q1_front~0=v_~q1_front~0_156, ~q2~0.offset=v_~q2~0.offset_105, ~n1~0=v_~n1~0_110, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_38|, ~q1_back~0=v_~q1_back~0_151, ~q1~0.base=v_~q1~0.base_121, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_57|, ~q2~0.base=v_~q2~0.base_105, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_51|, ~q2_back~0=v_~q2_back~0_168, ~q1~0.offset=v_~q1~0.offset_121, ~n2~0=v_~n2~0_118, ~i~0=v_~i~0_159, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_51|, ~q2_front~0=v_~q2_front~0_135, ~N~0=v_~N~0_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, #memory_int=|v_#memory_int_267|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:14,570 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,570 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,570 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,570 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,571 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,571 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,571 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,571 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:14,738 INFO L203 LiptonReduction]: Total number of compositions: 14 [2022-12-06 05:43:14,739 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8516 [2022-12-06 05:43:14,739 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 224 transitions, 2994 flow [2022-12-06 05:43:14,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:14,739 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:14,739 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:14,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:14,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:14,945 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:14,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1240262921, now seen corresponding path program 1 times [2022-12-06 05:43:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:14,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130767705] [2022-12-06 05:43:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:15,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:15,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130767705] [2022-12-06 05:43:15,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130767705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:15,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:43:15,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:43:15,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480971723] [2022-12-06 05:43:15,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:15,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:43:15,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:15,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:43:15,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:43:15,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 05:43:15,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 224 transitions, 2994 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:15,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:15,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 05:43:15,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:15,368 INFO L130 PetriNetUnfolder]: 605/1095 cut-off events. [2022-12-06 05:43:15,368 INFO L131 PetriNetUnfolder]: For 10122/10122 co-relation queries the response was YES. [2022-12-06 05:43:15,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 1095 events. 605/1095 cut-off events. For 10122/10122 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5808 event pairs, 189 based on Foata normal form. 94/1185 useless extension candidates. Maximal degree in co-relation 6906. Up to 648 conditions per place. [2022-12-06 05:43:15,380 INFO L137 encePairwiseOnDemand]: 33/68 looper letters, 216 selfloop transitions, 16 changer transitions 11/243 dead transitions. [2022-12-06 05:43:15,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 243 transitions, 3612 flow [2022-12-06 05:43:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:43:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:43:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-06 05:43:15,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3492647058823529 [2022-12-06 05:43:15,382 INFO L175 Difference]: Start difference. First operand has 97 places, 224 transitions, 2994 flow. Second operand 4 states and 95 transitions. [2022-12-06 05:43:15,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 243 transitions, 3612 flow [2022-12-06 05:43:15,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 243 transitions, 3365 flow, removed 106 selfloop flow, removed 5 redundant places. [2022-12-06 05:43:15,428 INFO L231 Difference]: Finished difference. Result has 95 places, 191 transitions, 2339 flow [2022-12-06 05:43:15,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2386, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2339, PETRI_PLACES=95, PETRI_TRANSITIONS=191} [2022-12-06 05:43:15,429 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 73 predicate places. [2022-12-06 05:43:15,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:15,430 INFO L89 Accepts]: Start accepts. Operand has 95 places, 191 transitions, 2339 flow [2022-12-06 05:43:15,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:15,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:15,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 191 transitions, 2339 flow [2022-12-06 05:43:15,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 191 transitions, 2339 flow [2022-12-06 05:43:15,476 INFO L130 PetriNetUnfolder]: 197/497 cut-off events. [2022-12-06 05:43:15,476 INFO L131 PetriNetUnfolder]: For 2592/2612 co-relation queries the response was YES. [2022-12-06 05:43:15,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 497 events. 197/497 cut-off events. For 2592/2612 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2952 event pairs, 19 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 2640. Up to 171 conditions per place. [2022-12-06 05:43:15,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 191 transitions, 2339 flow [2022-12-06 05:43:15,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 05:43:15,481 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:15,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 05:43:15,482 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 191 transitions, 2339 flow [2022-12-06 05:43:15,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:15,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:15,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:15,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:43:15,482 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:15,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:15,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1374695909, now seen corresponding path program 1 times [2022-12-06 05:43:15,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:15,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117368244] [2022-12-06 05:43:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:15,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:15,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:15,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117368244] [2022-12-06 05:43:15,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117368244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:15,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:43:15,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:43:15,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038530554] [2022-12-06 05:43:15,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:15,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:43:15,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:15,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:43:15,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:43:15,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:43:15,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 191 transitions, 2339 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:15,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:15,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:43:15,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:15,799 INFO L130 PetriNetUnfolder]: 828/1494 cut-off events. [2022-12-06 05:43:15,800 INFO L131 PetriNetUnfolder]: For 9994/9994 co-relation queries the response was YES. [2022-12-06 05:43:15,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9357 conditions, 1494 events. 828/1494 cut-off events. For 9994/9994 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8419 event pairs, 286 based on Foata normal form. 10/1500 useless extension candidates. Maximal degree in co-relation 9324. Up to 749 conditions per place. [2022-12-06 05:43:15,815 INFO L137 encePairwiseOnDemand]: 49/55 looper letters, 261 selfloop transitions, 2 changer transitions 1/264 dead transitions. [2022-12-06 05:43:15,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 264 transitions, 3668 flow [2022-12-06 05:43:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:43:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:43:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-06 05:43:15,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2022-12-06 05:43:15,816 INFO L175 Difference]: Start difference. First operand has 91 places, 191 transitions, 2339 flow. Second operand 3 states and 81 transitions. [2022-12-06 05:43:15,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 264 transitions, 3668 flow [2022-12-06 05:43:15,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 264 transitions, 3626 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 05:43:15,857 INFO L231 Difference]: Finished difference. Result has 89 places, 186 transitions, 2235 flow [2022-12-06 05:43:15,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2227, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2235, PETRI_PLACES=89, PETRI_TRANSITIONS=186} [2022-12-06 05:43:15,857 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 67 predicate places. [2022-12-06 05:43:15,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:15,858 INFO L89 Accepts]: Start accepts. Operand has 89 places, 186 transitions, 2235 flow [2022-12-06 05:43:15,858 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:15,858 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:15,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 186 transitions, 2235 flow [2022-12-06 05:43:15,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 186 transitions, 2235 flow [2022-12-06 05:43:15,920 INFO L130 PetriNetUnfolder]: 267/696 cut-off events. [2022-12-06 05:43:15,920 INFO L131 PetriNetUnfolder]: For 3389/3406 co-relation queries the response was YES. [2022-12-06 05:43:15,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3707 conditions, 696 events. 267/696 cut-off events. For 3389/3406 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 4727 event pairs, 28 based on Foata normal form. 2/674 useless extension candidates. Maximal degree in co-relation 3269. Up to 247 conditions per place. [2022-12-06 05:43:15,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 186 transitions, 2235 flow [2022-12-06 05:43:15,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 418 [2022-12-06 05:43:15,927 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:15,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 05:43:15,930 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 186 transitions, 2235 flow [2022-12-06 05:43:15,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:15,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:15,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:15,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:43:15,930 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:15,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1232746138, now seen corresponding path program 1 times [2022-12-06 05:43:15,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:15,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259011203] [2022-12-06 05:43:15,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:15,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:16,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:16,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259011203] [2022-12-06 05:43:16,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259011203] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:16,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676239773] [2022-12-06 05:43:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:16,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:16,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:16,061 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:16,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:43:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:16,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:43:16,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:43:16,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:43:16,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676239773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:16,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:43:16,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-06 05:43:16,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582727339] [2022-12-06 05:43:16,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:16,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:43:16,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:16,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:43:16,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:43:16,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:43:16,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 186 transitions, 2235 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:16,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:16,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:43:16,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:16,418 INFO L130 PetriNetUnfolder]: 801/1488 cut-off events. [2022-12-06 05:43:16,419 INFO L131 PetriNetUnfolder]: For 9773/9773 co-relation queries the response was YES. [2022-12-06 05:43:16,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9231 conditions, 1488 events. 801/1488 cut-off events. For 9773/9773 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 8608 event pairs, 290 based on Foata normal form. 43/1528 useless extension candidates. Maximal degree in co-relation 8216. Up to 1331 conditions per place. [2022-12-06 05:43:16,430 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 158 selfloop transitions, 22 changer transitions 15/195 dead transitions. [2022-12-06 05:43:16,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 195 transitions, 2713 flow [2022-12-06 05:43:16,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:43:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:43:16,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 05:43:16,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2022-12-06 05:43:16,432 INFO L175 Difference]: Start difference. First operand has 88 places, 186 transitions, 2235 flow. Second operand 3 states and 67 transitions. [2022-12-06 05:43:16,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 195 transitions, 2713 flow [2022-12-06 05:43:16,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 195 transitions, 2693 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 05:43:16,466 INFO L231 Difference]: Finished difference. Result has 90 places, 170 transitions, 2081 flow [2022-12-06 05:43:16,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2115, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2081, PETRI_PLACES=90, PETRI_TRANSITIONS=170} [2022-12-06 05:43:16,467 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 68 predicate places. [2022-12-06 05:43:16,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:16,467 INFO L89 Accepts]: Start accepts. Operand has 90 places, 170 transitions, 2081 flow [2022-12-06 05:43:16,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:16,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:16,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 170 transitions, 2081 flow [2022-12-06 05:43:16,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 170 transitions, 2081 flow [2022-12-06 05:43:16,522 INFO L130 PetriNetUnfolder]: 248/661 cut-off events. [2022-12-06 05:43:16,523 INFO L131 PetriNetUnfolder]: For 3203/3213 co-relation queries the response was YES. [2022-12-06 05:43:16,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3501 conditions, 661 events. 248/661 cut-off events. For 3203/3213 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4445 event pairs, 29 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 3169. Up to 232 conditions per place. [2022-12-06 05:43:16,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 170 transitions, 2081 flow [2022-12-06 05:43:16,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 05:43:16,529 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:16,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 05:43:16,530 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 170 transitions, 2081 flow [2022-12-06 05:43:16,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:16,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:16,530 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:16,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:16,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:16,734 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2124023537, now seen corresponding path program 1 times [2022-12-06 05:43:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:16,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184690064] [2022-12-06 05:43:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:43:16,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:16,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184690064] [2022-12-06 05:43:16,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184690064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:16,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:43:16,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:43:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439113336] [2022-12-06 05:43:16,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:16,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:43:16,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:43:16,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:43:16,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:43:16,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 170 transitions, 2081 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:16,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:16,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:43:16,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:16,983 INFO L130 PetriNetUnfolder]: 604/1118 cut-off events. [2022-12-06 05:43:16,983 INFO L131 PetriNetUnfolder]: For 7324/7324 co-relation queries the response was YES. [2022-12-06 05:43:16,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7068 conditions, 1118 events. 604/1118 cut-off events. For 7324/7324 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6072 event pairs, 57 based on Foata normal form. 26/1141 useless extension candidates. Maximal degree in co-relation 6380. Up to 1027 conditions per place. [2022-12-06 05:43:16,992 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 136 selfloop transitions, 17 changer transitions 0/153 dead transitions. [2022-12-06 05:43:16,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 153 transitions, 2170 flow [2022-12-06 05:43:16,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:43:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:43:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 05:43:16,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3900709219858156 [2022-12-06 05:43:16,992 INFO L175 Difference]: Start difference. First operand has 88 places, 170 transitions, 2081 flow. Second operand 3 states and 55 transitions. [2022-12-06 05:43:16,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 153 transitions, 2170 flow [2022-12-06 05:43:17,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 153 transitions, 2023 flow, removed 34 selfloop flow, removed 8 redundant places. [2022-12-06 05:43:17,020 INFO L231 Difference]: Finished difference. Result has 81 places, 148 transitions, 1743 flow [2022-12-06 05:43:17,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1743, PETRI_PLACES=81, PETRI_TRANSITIONS=148} [2022-12-06 05:43:17,021 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 59 predicate places. [2022-12-06 05:43:17,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:17,021 INFO L89 Accepts]: Start accepts. Operand has 81 places, 148 transitions, 1743 flow [2022-12-06 05:43:17,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:17,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:17,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 148 transitions, 1743 flow [2022-12-06 05:43:17,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 148 transitions, 1743 flow [2022-12-06 05:43:17,069 INFO L130 PetriNetUnfolder]: 190/522 cut-off events. [2022-12-06 05:43:17,070 INFO L131 PetriNetUnfolder]: For 1734/1740 co-relation queries the response was YES. [2022-12-06 05:43:17,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2555 conditions, 522 events. 190/522 cut-off events. For 1734/1740 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3347 event pairs, 28 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 2022. Up to 181 conditions per place. [2022-12-06 05:43:17,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 148 transitions, 1743 flow [2022-12-06 05:43:17,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-06 05:43:17,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:43:17,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:43:17,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:43:17,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:43:17,198 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 148 transitions, 1749 flow [2022-12-06 05:43:17,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:17,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:17,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:17,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:43:17,198 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:17,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:17,199 INFO L85 PathProgramCache]: Analyzing trace with hash 412015095, now seen corresponding path program 1 times [2022-12-06 05:43:17,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:17,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151796511] [2022-12-06 05:43:17,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:18,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151796511] [2022-12-06 05:43:18,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151796511] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:18,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333047743] [2022-12-06 05:43:18,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:18,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:18,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:18,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:18,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:43:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:18,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 05:43:18,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:18,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:18,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:18,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:18,658 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:43:18,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2022-12-06 05:43:18,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 05:43:18,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-12-06 05:43:18,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:43:18,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 20 [2022-12-06 05:43:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:18,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:19,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333047743] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:19,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:19,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 05:43:19,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650187684] [2022-12-06 05:43:19,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:19,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:43:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:19,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:43:19,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2022-12-06 05:43:19,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:43:19,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 148 transitions, 1749 flow. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:19,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:19,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:43:19,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:30,206 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 137 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:43:39,153 INFO L130 PetriNetUnfolder]: 640/1185 cut-off events. [2022-12-06 05:43:39,154 INFO L131 PetriNetUnfolder]: For 5676/5676 co-relation queries the response was YES. [2022-12-06 05:43:39,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6975 conditions, 1185 events. 640/1185 cut-off events. For 5676/5676 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6511 event pairs, 22 based on Foata normal form. 1/1183 useless extension candidates. Maximal degree in co-relation 5554. Up to 612 conditions per place. [2022-12-06 05:43:39,170 INFO L137 encePairwiseOnDemand]: 10/47 looper letters, 70 selfloop transitions, 138 changer transitions 17/225 dead transitions. [2022-12-06 05:43:39,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 225 transitions, 2774 flow [2022-12-06 05:43:39,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 05:43:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 05:43:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 136 transitions. [2022-12-06 05:43:39,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12056737588652482 [2022-12-06 05:43:39,172 INFO L175 Difference]: Start difference. First operand has 81 places, 148 transitions, 1749 flow. Second operand 24 states and 136 transitions. [2022-12-06 05:43:39,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 225 transitions, 2774 flow [2022-12-06 05:43:39,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 225 transitions, 2749 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:43:39,195 INFO L231 Difference]: Finished difference. Result has 110 places, 175 transitions, 2468 flow [2022-12-06 05:43:39,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2468, PETRI_PLACES=110, PETRI_TRANSITIONS=175} [2022-12-06 05:43:39,196 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 88 predicate places. [2022-12-06 05:43:39,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:39,196 INFO L89 Accepts]: Start accepts. Operand has 110 places, 175 transitions, 2468 flow [2022-12-06 05:43:39,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:39,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:39,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 175 transitions, 2468 flow [2022-12-06 05:43:39,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 175 transitions, 2468 flow [2022-12-06 05:43:39,246 INFO L130 PetriNetUnfolder]: 201/543 cut-off events. [2022-12-06 05:43:39,246 INFO L131 PetriNetUnfolder]: For 2667/2675 co-relation queries the response was YES. [2022-12-06 05:43:39,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3120 conditions, 543 events. 201/543 cut-off events. For 2667/2675 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3404 event pairs, 25 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 3063. Up to 188 conditions per place. [2022-12-06 05:43:39,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 175 transitions, 2468 flow [2022-12-06 05:43:39,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 05:43:43,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [794] L65-1-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_427| v_~q1~0.base_233))) (and (= (+ v_~q2_back~0_347 1) v_~q2_back~0_346) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_235| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_235|) (< v_~j~0_286 v_~N~0_222) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_186| (ite (= v_~j~0_286 (select .cse0 (+ v_~q1~0.offset_233 (* v_~q1_back~0_326 4)))) 1 0)) (< v_~i~0_316 v_~N~0_222) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_326) (< v_~q1_back~0_326 v_~n1~0_220)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_29| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_186| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|) (not (< v_~i~0_315 v_~N~0_222)) (= |v_thread1Thread1of1ForFork0_#res#1.base_29| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_235| 0)) (= (+ v_~q1_back~0_326 1) v_~q1_back~0_325) (not (= (ite (= v_~i~0_316 (select (select |v_#memory_int_427| v_~q2~0.base_212) (+ v_~q2~0.offset_212 (* 4 v_~q2_back~0_347)))) 1 0) 0)) (= (+ v_~q1_front~0_341 1) v_~q1_front~0_340) (= (ite (and (< v_~q1_front~0_341 v_~q1_back~0_325) (< v_~q1_front~0_341 v_~n1~0_220) (<= 0 v_~q1_front~0_341)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_235|) (not (= (ite (and (<= 0 v_~q2_back~0_347) (< v_~q2_back~0_347 v_~n2~0_220)) 1 0) 0)) (= v_~i~0_315 (+ (select .cse0 (+ v_~q1~0.offset_233 (* v_~q1_front~0_341 4))) 1)))) InVars {~j~0=v_~j~0_286, ~q1~0.offset=v_~q1~0.offset_233, ~q1_front~0=v_~q1_front~0_341, ~n2~0=v_~n2~0_220, ~i~0=v_~i~0_316, ~n1~0=v_~n1~0_220, ~q2~0.offset=v_~q2~0.offset_212, ~N~0=v_~N~0_222, ~q1_back~0=v_~q1_back~0_326, ~q1~0.base=v_~q1~0.base_233, #memory_int=|v_#memory_int_427|, ~q2~0.base=v_~q2~0.base_212, ~q2_back~0=v_~q2_back~0_347} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_117|, ~j~0=v_~j~0_286, ~q1_front~0=v_~q1_front~0_340, ~n1~0=v_~n1~0_220, ~q2~0.offset=v_~q2~0.offset_212, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_186|, ~q1_back~0=v_~q1_back~0_325, ~q1~0.base=v_~q1~0.base_233, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_151|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_235|, ~q2~0.base=v_~q2~0.base_212, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_145|, ~q2_back~0=v_~q2_back~0_346, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_29|, ~q1~0.offset=v_~q1~0.offset_233, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_29|, ~n2~0=v_~n2~0_220, ~i~0=v_~i~0_315, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_145|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_94|, ~N~0=v_~N~0_222, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_94|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_235|, #memory_int=|v_#memory_int_427|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_117|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, thread1Thread1of1ForFork0_#res#1.offset, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:43:43,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [758] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_362| v_~q2~0.base_162))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_154| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_154|) (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_248) v_~q2~0.offset_162)) v_~i~0_234) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_154|) (< v_~i~0_234 v_~N~0_170) (< v_~j~0_211 v_~N~0_170) (= v_~q1_back~0_232 (+ v_~q1_back~0_233 1)) (= v_~q2_front~0_206 (+ v_~q2_front~0_207 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_154| 0)) (= v_~j~0_210 (+ (select .cse0 (+ v_~q2~0.offset_162 (* v_~q2_front~0_207 4))) 1)) (not (= (ite (= v_~j~0_211 (select (select |v_#memory_int_362| v_~q1~0.base_185) (+ (* v_~q1_back~0_233 4) v_~q1~0.offset_185))) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_233 v_~n1~0_172) (<= 0 v_~q1_back~0_233)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_112| 0)) (= (+ v_~q2_back~0_248 1) v_~q2_back~0_247) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_112| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_112|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_112| (ite (and (< v_~q2_front~0_207 v_~q2_back~0_247) (< v_~q2_front~0_207 v_~n2~0_172) (<= 0 v_~q2_front~0_207)) 1 0)) (not (= (ite (and (<= 0 v_~q2_back~0_248) (< v_~q2_back~0_248 v_~n2~0_172)) 1 0) 0)))) InVars {~j~0=v_~j~0_211, ~q1~0.offset=v_~q1~0.offset_185, ~n2~0=v_~n2~0_172, ~i~0=v_~i~0_234, ~q2~0.offset=v_~q2~0.offset_162, ~n1~0=v_~n1~0_172, ~q2_front~0=v_~q2_front~0_207, ~N~0=v_~N~0_170, ~q1_back~0=v_~q1_back~0_233, ~q1~0.base=v_~q1~0.base_185, #memory_int=|v_#memory_int_362|, ~q2~0.base=v_~q2~0.base_162, ~q2_back~0=v_~q2_back~0_248} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_67|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_78|, ~j~0=v_~j~0_210, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_72|, ~q1~0.offset=v_~q1~0.offset_185, ~n2~0=v_~n2~0_172, ~i~0=v_~i~0_234, ~q2~0.offset=v_~q2~0.offset_162, ~n1~0=v_~n1~0_172, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_112|, ~q2_front~0=v_~q2_front~0_206, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_48|, ~N~0=v_~N~0_170, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_48|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_72|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_112|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_154|, ~q1_back~0=v_~q1_back~0_232, ~q1~0.base=v_~q1~0.base_185, #memory_int=|v_#memory_int_362|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_154|, ~q2~0.base=v_~q2~0.base_162, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_67|, ~q2_back~0=v_~q2_back~0_247} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:43,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L47-1-->L70: Formula: (and (< v_~j~0_182 v_~N~0_144) (= (+ v_~q2_back~0_216 1) v_~q2_back~0_215) (not (= (ite (and (< v_~q2_back~0_216 v_~n2~0_152) (<= 0 v_~q2_back~0_216)) 1 0) 0)) (= (+ v_~q1_back~0_195 1) v_~q1_back~0_194) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_88| 0)) (< v_~i~0_204 v_~N~0_144) (not (= (ite (and (<= 0 v_~q1_back~0_195) (< v_~q1_back~0_195 v_~n1~0_146)) 1 0) 0)) (= (ite (= v_~j~0_182 (select (select |v_#memory_int_332| v_~q1~0.base_159) (+ (* v_~q1_back~0_195 4) v_~q1~0.offset_159))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_88| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124| 0)) (= (ite (= (select (select |v_#memory_int_332| v_~q2~0.base_142) (+ v_~q2~0.offset_142 (* 4 v_~q2_back~0_216))) v_~i~0_204) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124|)) InVars {~j~0=v_~j~0_182, ~q1~0.offset=v_~q1~0.offset_159, ~n2~0=v_~n2~0_152, ~q1_back~0=v_~q1_back~0_195, ~i~0=v_~i~0_204, ~n1~0=v_~n1~0_146, ~q2~0.offset=v_~q2~0.offset_142, ~q1~0.base=v_~q1~0.base_159, #memory_int=|v_#memory_int_332|, ~q2~0.base=v_~q2~0.base_142, ~N~0=v_~N~0_144, ~q2_back~0=v_~q2_back~0_216} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_55|, ~j~0=v_~j~0_182, ~q1~0.offset=v_~q1~0.offset_159, ~n2~0=v_~n2~0_152, ~i~0=v_~i~0_204, ~n1~0=v_~n1~0_146, ~q2~0.offset=v_~q2~0.offset_142, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_36|, ~N~0=v_~N~0_144, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_36|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_88|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124|, ~q1_back~0=v_~q1_back~0_194, ~q1~0.base=v_~q1~0.base_159, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124|, ~q2~0.base=v_~q2~0.base_142, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_55|, ~q2_back~0=v_~q2_back~0_215} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:43,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L47-1-->L70: Formula: (and (< v_~j~0_182 v_~N~0_144) (= (+ v_~q2_back~0_216 1) v_~q2_back~0_215) (not (= (ite (and (< v_~q2_back~0_216 v_~n2~0_152) (<= 0 v_~q2_back~0_216)) 1 0) 0)) (= (+ v_~q1_back~0_195 1) v_~q1_back~0_194) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_88| 0)) (< v_~i~0_204 v_~N~0_144) (not (= (ite (and (<= 0 v_~q1_back~0_195) (< v_~q1_back~0_195 v_~n1~0_146)) 1 0) 0)) (= (ite (= v_~j~0_182 (select (select |v_#memory_int_332| v_~q1~0.base_159) (+ (* v_~q1_back~0_195 4) v_~q1~0.offset_159))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_88| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124| 0)) (= (ite (= (select (select |v_#memory_int_332| v_~q2~0.base_142) (+ v_~q2~0.offset_142 (* 4 v_~q2_back~0_216))) v_~i~0_204) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124|)) InVars {~j~0=v_~j~0_182, ~q1~0.offset=v_~q1~0.offset_159, ~n2~0=v_~n2~0_152, ~q1_back~0=v_~q1_back~0_195, ~i~0=v_~i~0_204, ~n1~0=v_~n1~0_146, ~q2~0.offset=v_~q2~0.offset_142, ~q1~0.base=v_~q1~0.base_159, #memory_int=|v_#memory_int_332|, ~q2~0.base=v_~q2~0.base_142, ~N~0=v_~N~0_144, ~q2_back~0=v_~q2_back~0_216} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_55|, ~j~0=v_~j~0_182, ~q1~0.offset=v_~q1~0.offset_159, ~n2~0=v_~n2~0_152, ~i~0=v_~i~0_204, ~n1~0=v_~n1~0_146, ~q2~0.offset=v_~q2~0.offset_142, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_36|, ~N~0=v_~N~0_144, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_36|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_88|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_124|, ~q1_back~0=v_~q1_back~0_194, ~q1~0.base=v_~q1~0.base_159, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124|, ~q2~0.base=v_~q2~0.base_142, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_55|, ~q2_back~0=v_~q2_back~0_215} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [723] L52-->L65-1: Formula: (and (= (ite (and (<= 0 v_~q1_front~0_167) (< v_~q1_front~0_167 v_~n1~0_114) (< v_~q1_front~0_167 v_~q1_back~0_155)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| 0)) (= v_~q1_front~0_166 (+ v_~q1_front~0_167 1)) (= v_~q2_front~0_139 (+ v_~q2_front~0_140 1)) (= (+ (select (select |v_#memory_int_271| v_~q1~0.base_125) (+ (* v_~q1_front~0_167 4) v_~q1~0.offset_125)) 1) v_~i~0_165) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (= v_~j~0_143 (+ (select (select |v_#memory_int_271| v_~q2~0.base_109) (+ v_~q2~0.offset_109 (* v_~q2_front~0_140 4))) 1)) (= (ite (and (< v_~q2_front~0_140 v_~n2~0_122) (< v_~q2_front~0_140 v_~q2_back~0_176) (<= 0 v_~q2_front~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|)) InVars {~q1~0.offset=v_~q1~0.offset_125, ~n2~0=v_~n2~0_122, ~q1_front~0=v_~q1_front~0_167, ~q1_back~0=v_~q1_back~0_155, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_114, ~q1~0.base=v_~q1~0.base_125, #memory_int=|v_#memory_int_271|, ~q2_front~0=v_~q2_front~0_140, ~q2~0.base=v_~q2~0.base_109, ~q2_back~0=v_~q2_back~0_176} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_46|, ~j~0=v_~j~0_143, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_40|, ~q1~0.offset=v_~q1~0.offset_125, ~n2~0=v_~n2~0_122, ~q1_front~0=v_~q1_front~0_166, ~i~0=v_~i~0_165, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_114, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|, ~q2_front~0=v_~q2_front~0_139, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_40|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|, ~q1_back~0=v_~q1_back~0_155, ~q1~0.base=v_~q1~0.base_125, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_63|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91|, ~q2~0.base=v_~q2~0.base_109, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_57|, ~q2_back~0=v_~q2_back~0_176} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:44,348 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:43:44,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5152 [2022-12-06 05:43:44,348 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 171 transitions, 2474 flow [2022-12-06 05:43:44,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:44,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:44,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:44,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:44,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 05:43:44,553 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:44,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1255230384, now seen corresponding path program 1 times [2022-12-06 05:43:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:44,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236409018] [2022-12-06 05:43:44,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:44,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:45,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:45,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236409018] [2022-12-06 05:43:45,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236409018] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:45,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22033764] [2022-12-06 05:43:45,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:45,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:45,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:45,609 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:45,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:43:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:45,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 05:43:45,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:45,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:45,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:45,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:45,753 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:43:45,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2022-12-06 05:43:45,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-12-06 05:43:45,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 05:43:45,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:43:45,877 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 05:43:45,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 23 [2022-12-06 05:43:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:45,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:46,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22033764] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:46,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:46,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 05:43:46,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504275294] [2022-12-06 05:43:46,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:46,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:43:46,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:46,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:43:46,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2022-12-06 05:43:46,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:43:46,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 171 transitions, 2474 flow. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:46,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:46,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:43:46,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:48,504 INFO L130 PetriNetUnfolder]: 634/1159 cut-off events. [2022-12-06 05:43:48,504 INFO L131 PetriNetUnfolder]: For 7457/7457 co-relation queries the response was YES. [2022-12-06 05:43:48,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7938 conditions, 1159 events. 634/1159 cut-off events. For 7457/7457 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6215 event pairs, 19 based on Foata normal form. 1/1157 useless extension candidates. Maximal degree in co-relation 7875. Up to 803 conditions per place. [2022-12-06 05:43:48,512 INFO L137 encePairwiseOnDemand]: 21/51 looper letters, 111 selfloop transitions, 94 changer transitions 6/211 dead transitions. [2022-12-06 05:43:48,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 211 transitions, 3154 flow [2022-12-06 05:43:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:43:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:43:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 112 transitions. [2022-12-06 05:43:48,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13725490196078433 [2022-12-06 05:43:48,514 INFO L175 Difference]: Start difference. First operand has 103 places, 171 transitions, 2474 flow. Second operand 16 states and 112 transitions. [2022-12-06 05:43:48,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 211 transitions, 3154 flow [2022-12-06 05:43:48,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 211 transitions, 2875 flow, removed 42 selfloop flow, removed 8 redundant places. [2022-12-06 05:43:48,548 INFO L231 Difference]: Finished difference. Result has 111 places, 178 transitions, 2484 flow [2022-12-06 05:43:48,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2484, PETRI_PLACES=111, PETRI_TRANSITIONS=178} [2022-12-06 05:43:48,548 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 89 predicate places. [2022-12-06 05:43:48,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:48,548 INFO L89 Accepts]: Start accepts. Operand has 111 places, 178 transitions, 2484 flow [2022-12-06 05:43:48,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:48,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:48,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 178 transitions, 2484 flow [2022-12-06 05:43:48,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 178 transitions, 2484 flow [2022-12-06 05:43:48,596 INFO L130 PetriNetUnfolder]: 201/531 cut-off events. [2022-12-06 05:43:48,596 INFO L131 PetriNetUnfolder]: For 2336/2342 co-relation queries the response was YES. [2022-12-06 05:43:48,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3087 conditions, 531 events. 201/531 cut-off events. For 2336/2342 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3254 event pairs, 22 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 2947. Up to 191 conditions per place. [2022-12-06 05:43:48,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 178 transitions, 2484 flow [2022-12-06 05:43:48,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-06 05:43:48,611 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:48,785 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:48,785 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:48,785 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:48,785 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:48,785 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:48,785 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:48,786 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:48,786 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:48,786 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:48,786 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:49,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:43:49,624 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] L47-1-->L70: Formula: (let ((.cse1 (select |v_#memory_int_458| v_~q1~0.base_255)) (.cse0 (select |v_#memory_int_458| v_~q2~0.base_230))) (and (= v_~q2_back~0_378 (+ v_~q2_back~0_379 1)) (= v_~j~0_318 (+ (select .cse0 (+ v_~q2~0.offset_230 (* v_~q2_front~0_311 4))) 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257| 0)) (< v_~j~0_318 v_~N~0_242) (= (+ v_~q2_front~0_311 1) v_~q2_front~0_310) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212| (ite (= v_~j~0_318 (select .cse1 (+ (* v_~q1_back~0_362 4) v_~q1~0.offset_255 (- 4)))) 1 0)) (not (= (ite (and (< v_~q2_front~0_311 v_~n2~0_238) (<= 0 v_~q2_front~0_311) (< v_~q2_front~0_311 v_~q2_back~0_378)) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_362 (+ v_~n1~0_240 1)) (<= 1 v_~q1_back~0_362)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_257| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_212|) (not (= (ite (= v_~j~0_319 (select .cse1 (+ v_~q1~0.offset_255 (* v_~q1_back~0_364 4)))) 1 0) 0)) (< v_~i~0_345 v_~N~0_242) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_212| 0)) (< v_~j~0_319 v_~N~0_242) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_257| (ite (= (select .cse0 (+ v_~q2~0.offset_230 (* 4 v_~q2_back~0_379))) v_~i~0_345) 1 0)) (= (+ 2 v_~q1_back~0_364) v_~q1_back~0_362) (not (= (ite (and (<= 0 v_~q1_back~0_364) (< v_~q1_back~0_364 v_~n1~0_240)) 1 0) 0)) (not (= (ite (and (< v_~q2_back~0_379 v_~n2~0_238) (<= 0 v_~q2_back~0_379)) 1 0) 0)))) InVars {~j~0=v_~j~0_319, ~q1~0.offset=v_~q1~0.offset_255, ~n2~0=v_~n2~0_238, ~i~0=v_~i~0_345, ~n1~0=v_~n1~0_240, ~q2~0.offset=v_~q2~0.offset_230, ~q2_front~0=v_~q2_front~0_311, ~N~0=v_~N~0_242, ~q1_back~0=v_~q1_back~0_364, ~q1~0.base=v_~q1~0.base_255, #memory_int=|v_#memory_int_458|, ~q2~0.base=v_~q2~0.base_230, ~q2_back~0=v_~q2_back~0_379} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_131|, ~j~0=v_~j~0_318, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_130|, ~q1~0.offset=v_~q1~0.offset_255, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_124|, ~n2~0=v_~n2~0_238, ~i~0=v_~i~0_345, ~n1~0=v_~n1~0_240, ~q2~0.offset=v_~q2~0.offset_230, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_112|, ~q2_front~0=v_~q2_front~0_310, ~N~0=v_~N~0_242, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_112|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_124|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_212|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_257|, ~q1_back~0=v_~q1_back~0_362, ~q1~0.base=v_~q1~0.base_255, #memory_int=|v_#memory_int_458|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_257|, ~q2~0.base=v_~q2~0.base_230, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_131|, ~q2_back~0=v_~q2_back~0_378} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:49,911 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:43:49,993 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:43:49,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1446 [2022-12-06 05:43:49,994 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 177 transitions, 2545 flow [2022-12-06 05:43:49,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:49,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:49,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:49,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:50,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 05:43:50,195 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:50,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:50,195 INFO L85 PathProgramCache]: Analyzing trace with hash 748762824, now seen corresponding path program 1 times [2022-12-06 05:43:50,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:50,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127055756] [2022-12-06 05:43:50,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:50,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:50,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:50,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127055756] [2022-12-06 05:43:50,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127055756] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:50,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047298317] [2022-12-06 05:43:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:50,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:50,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:50,372 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:50,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:43:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:50,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:43:50,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:50,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:50,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047298317] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:50,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:50,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 05:43:50,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416831221] [2022-12-06 05:43:50,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:50,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:43:50,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:50,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:43:50,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:43:50,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:43:50,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 177 transitions, 2545 flow. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:50,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:50,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:43:50,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:51,085 INFO L130 PetriNetUnfolder]: 621/1155 cut-off events. [2022-12-06 05:43:51,086 INFO L131 PetriNetUnfolder]: For 8704/8704 co-relation queries the response was YES. [2022-12-06 05:43:51,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7884 conditions, 1155 events. 621/1155 cut-off events. For 8704/8704 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6239 event pairs, 134 based on Foata normal form. 30/1182 useless extension candidates. Maximal degree in co-relation 7457. Up to 793 conditions per place. [2022-12-06 05:43:51,111 INFO L137 encePairwiseOnDemand]: 33/56 looper letters, 186 selfloop transitions, 24 changer transitions 12/222 dead transitions. [2022-12-06 05:43:51,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 222 transitions, 3381 flow [2022-12-06 05:43:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:43:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:43:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-12-06 05:43:51,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24744897959183673 [2022-12-06 05:43:51,114 INFO L175 Difference]: Start difference. First operand has 109 places, 177 transitions, 2545 flow. Second operand 7 states and 97 transitions. [2022-12-06 05:43:51,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 222 transitions, 3381 flow [2022-12-06 05:43:51,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 222 transitions, 3206 flow, removed 33 selfloop flow, removed 9 redundant places. [2022-12-06 05:43:51,192 INFO L231 Difference]: Finished difference. Result has 107 places, 165 transitions, 2232 flow [2022-12-06 05:43:51,193 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2309, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2232, PETRI_PLACES=107, PETRI_TRANSITIONS=165} [2022-12-06 05:43:51,207 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 85 predicate places. [2022-12-06 05:43:51,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:51,208 INFO L89 Accepts]: Start accepts. Operand has 107 places, 165 transitions, 2232 flow [2022-12-06 05:43:51,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:51,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:51,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 165 transitions, 2232 flow [2022-12-06 05:43:51,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 165 transitions, 2232 flow [2022-12-06 05:43:51,281 INFO L130 PetriNetUnfolder]: 202/531 cut-off events. [2022-12-06 05:43:51,281 INFO L131 PetriNetUnfolder]: For 2074/2082 co-relation queries the response was YES. [2022-12-06 05:43:51,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 531 events. 202/531 cut-off events. For 2074/2082 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3225 event pairs, 22 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 2812. Up to 188 conditions per place. [2022-12-06 05:43:51,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 165 transitions, 2232 flow [2022-12-06 05:43:51,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 05:43:51,288 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:51,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 05:43:51,288 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 165 transitions, 2232 flow [2022-12-06 05:43:51,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:51,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:51,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:51,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:51,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:51,496 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:51,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:51,496 INFO L85 PathProgramCache]: Analyzing trace with hash -453311582, now seen corresponding path program 1 times [2022-12-06 05:43:51,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:51,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69798082] [2022-12-06 05:43:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:51,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:52,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:52,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69798082] [2022-12-06 05:43:52,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69798082] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:52,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389362953] [2022-12-06 05:43:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:52,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:52,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:52,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:52,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:43:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:52,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 05:43:52,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:52,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:52,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:52,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-06 05:43:52,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:52,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-12-06 05:43:52,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:52,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:52,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-06 05:43:52,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 05:43:52,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 05:43:52,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:43:52,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:52,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:43:52,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 17 [2022-12-06 05:43:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:52,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:52,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389362953] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:52,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:52,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:43:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293697879] [2022-12-06 05:43:52,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:52,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:43:52,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:52,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:43:52,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=223, Unknown=3, NotChecked=0, Total=272 [2022-12-06 05:43:52,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:43:52,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 165 transitions, 2232 flow. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:52,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:52,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:43:52,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:54,276 INFO L130 PetriNetUnfolder]: 639/1164 cut-off events. [2022-12-06 05:43:54,276 INFO L131 PetriNetUnfolder]: For 6438/6438 co-relation queries the response was YES. [2022-12-06 05:43:54,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7682 conditions, 1164 events. 639/1164 cut-off events. For 6438/6438 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6226 event pairs, 18 based on Foata normal form. 2/1165 useless extension candidates. Maximal degree in co-relation 7132. Up to 764 conditions per place. [2022-12-06 05:43:54,286 INFO L137 encePairwiseOnDemand]: 17/48 looper letters, 89 selfloop transitions, 109 changer transitions 8/206 dead transitions. [2022-12-06 05:43:54,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 206 transitions, 2952 flow [2022-12-06 05:43:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:43:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:43:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 106 transitions. [2022-12-06 05:43:54,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15773809523809523 [2022-12-06 05:43:54,288 INFO L175 Difference]: Start difference. First operand has 99 places, 165 transitions, 2232 flow. Second operand 14 states and 106 transitions. [2022-12-06 05:43:54,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 206 transitions, 2952 flow [2022-12-06 05:43:54,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 206 transitions, 2882 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 05:43:54,318 INFO L231 Difference]: Finished difference. Result has 110 places, 175 transitions, 2577 flow [2022-12-06 05:43:54,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2577, PETRI_PLACES=110, PETRI_TRANSITIONS=175} [2022-12-06 05:43:54,318 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 88 predicate places. [2022-12-06 05:43:54,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:54,318 INFO L89 Accepts]: Start accepts. Operand has 110 places, 175 transitions, 2577 flow [2022-12-06 05:43:54,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:54,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:54,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 175 transitions, 2577 flow [2022-12-06 05:43:54,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 175 transitions, 2577 flow [2022-12-06 05:43:54,366 INFO L130 PetriNetUnfolder]: 206/538 cut-off events. [2022-12-06 05:43:54,366 INFO L131 PetriNetUnfolder]: For 2495/2503 co-relation queries the response was YES. [2022-12-06 05:43:54,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 538 events. 206/538 cut-off events. For 2495/2503 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3270 event pairs, 21 based on Foata normal form. 0/517 useless extension candidates. Maximal degree in co-relation 3094. Up to 191 conditions per place. [2022-12-06 05:43:54,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 175 transitions, 2577 flow [2022-12-06 05:43:54,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 05:43:54,382 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:54,550 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [706] L47-1-->L65-1: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= v_~j~0_119 (+ (select (select |v_#memory_int_217| v_~q2~0.base_80) (+ (* v_~q2_front~0_111 4) v_~q2~0.offset_80)) 1)) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (ite (and (< v_~q2_front~0_111 v_~q2_back~0_131) (< v_~q2_front~0_111 v_~n2~0_94) (<= 0 v_~q2_front~0_111)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= (+ v_~q2_front~0_111 1) v_~q2_front~0_110) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (not (< v_~i~0_123 v_~N~0_78))) InVars {~n2~0=v_~n2~0_94, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, #memory_int=|v_#memory_int_217|, ~q2_front~0=v_~q2_front~0_111, ~q2~0.base=v_~q2~0.base_80, ~N~0=v_~N~0_78, ~q2_back~0=v_~q2_back~0_131} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_34|, ~j~0=v_~j~0_119, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_28|, ~n2~0=v_~n2~0_94, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, ~q2_front~0=v_~q2_front~0_110, ~N~0=v_~N~0_78, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_28|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, #memory_int=|v_#memory_int_217|, ~q2~0.base=v_~q2~0.base_80, ~q2_back~0=v_~q2_back~0_131, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:43:54,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-06 05:43:54,807 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [802] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_454| v_~q1~0.base_251))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_255| 0)) (< v_~j~0_312 v_~N~0_238) (not (= (ite (and (<= 0 v_~q1_back~0_355) (< v_~q1_back~0_355 v_~n1~0_236)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206|) (= (+ v_~q1_back~0_355 1) v_~q1_back~0_354) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| (ite (= v_~j~0_312 (select .cse0 (+ v_~q1~0.offset_251 (* v_~q1_back~0_355 4)))) 1 0)) (= (ite (and (<= 0 v_~q1_front~0_366) (< v_~q1_front~0_366 v_~n1~0_236) (< v_~q1_front~0_366 v_~q1_back~0_354)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_255|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_255| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_255|) (= v_~i~0_343 (+ (select .cse0 (+ (* v_~q1_front~0_366 4) v_~q1~0.offset_251)) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206| 0)) (= v_~q1_front~0_365 (+ v_~q1_front~0_366 1)))) InVars {~j~0=v_~j~0_312, ~q1~0.offset=v_~q1~0.offset_251, ~q1_front~0=v_~q1_front~0_366, ~q1_back~0=v_~q1_back~0_355, ~n1~0=v_~n1~0_236, ~q1~0.base=v_~q1~0.base_251, #memory_int=|v_#memory_int_454|, ~N~0=v_~N~0_238} OutVars{~j~0=v_~j~0_312, ~q1~0.offset=v_~q1~0.offset_251, ~q1_front~0=v_~q1_front~0_365, ~i~0=v_~i~0_343, ~n1~0=v_~n1~0_236, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_157|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_108|, ~N~0=v_~N~0_238, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_108|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_255|, ~q1_back~0=v_~q1_back~0_354, ~q1~0.base=v_~q1~0.base_251, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_163|, #memory_int=|v_#memory_int_454|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_255|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_157|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:43:54,943 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:43:54,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 626 [2022-12-06 05:43:54,944 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 173 transitions, 2576 flow [2022-12-06 05:43:54,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:54,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:54,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:54,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:55,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 05:43:55,146 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:55,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:55,146 INFO L85 PathProgramCache]: Analyzing trace with hash 307356654, now seen corresponding path program 1 times [2022-12-06 05:43:55,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:55,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872766677] [2022-12-06 05:43:55,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:55,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:55,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:55,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872766677] [2022-12-06 05:43:55,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872766677] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:55,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131438411] [2022-12-06 05:43:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:55,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:55,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:55,998 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:56,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 05:43:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:56,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 05:43:56,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:56,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:56,180 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-12-06 05:43:56,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 100 [2022-12-06 05:43:56,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 05:43:56,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-06 05:43:56,213 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:56,213 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2022-12-06 05:43:56,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:56,234 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-12-06 05:43:56,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 32 [2022-12-06 05:43:56,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-06 05:43:56,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:56,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:43:56,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:43:56,555 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 05:43:56,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 22 [2022-12-06 05:43:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:56,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:56,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131438411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:56,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:56,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:43:56,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656394501] [2022-12-06 05:43:56,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:56,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:43:56,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:56,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:43:56,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=224, Unknown=5, NotChecked=0, Total=272 [2022-12-06 05:43:56,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:43:56,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 173 transitions, 2576 flow. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:56,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:56,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:43:56,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:58,212 INFO L130 PetriNetUnfolder]: 647/1176 cut-off events. [2022-12-06 05:43:58,213 INFO L131 PetriNetUnfolder]: For 10252/10252 co-relation queries the response was YES. [2022-12-06 05:43:58,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8375 conditions, 1176 events. 647/1176 cut-off events. For 10252/10252 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6287 event pairs, 125 based on Foata normal form. 2/1177 useless extension candidates. Maximal degree in co-relation 7995. Up to 839 conditions per place. [2022-12-06 05:43:58,221 INFO L137 encePairwiseOnDemand]: 13/53 looper letters, 106 selfloop transitions, 108 changer transitions 12/226 dead transitions. [2022-12-06 05:43:58,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 226 transitions, 3445 flow [2022-12-06 05:43:58,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:43:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:43:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 122 transitions. [2022-12-06 05:43:58,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14386792452830188 [2022-12-06 05:43:58,245 INFO L175 Difference]: Start difference. First operand has 106 places, 173 transitions, 2576 flow. Second operand 16 states and 122 transitions. [2022-12-06 05:43:58,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 226 transitions, 3445 flow [2022-12-06 05:43:58,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 226 transitions, 3249 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-06 05:43:58,291 INFO L231 Difference]: Finished difference. Result has 118 places, 182 transitions, 2855 flow [2022-12-06 05:43:58,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2398, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2855, PETRI_PLACES=118, PETRI_TRANSITIONS=182} [2022-12-06 05:43:58,291 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 96 predicate places. [2022-12-06 05:43:58,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:58,291 INFO L89 Accepts]: Start accepts. Operand has 118 places, 182 transitions, 2855 flow [2022-12-06 05:43:58,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:58,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:58,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 182 transitions, 2855 flow [2022-12-06 05:43:58,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 182 transitions, 2855 flow [2022-12-06 05:43:58,359 INFO L130 PetriNetUnfolder]: 209/554 cut-off events. [2022-12-06 05:43:58,360 INFO L131 PetriNetUnfolder]: For 2881/2893 co-relation queries the response was YES. [2022-12-06 05:43:58,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3429 conditions, 554 events. 209/554 cut-off events. For 2881/2893 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3426 event pairs, 26 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 3314. Up to 195 conditions per place. [2022-12-06 05:43:58,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 182 transitions, 2855 flow [2022-12-06 05:43:58,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 386 [2022-12-06 05:43:58,390 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:58,390 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:58,390 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:58,390 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:58,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:43:58,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [706] L47-1-->L65-1: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= v_~j~0_119 (+ (select (select |v_#memory_int_217| v_~q2~0.base_80) (+ (* v_~q2_front~0_111 4) v_~q2~0.offset_80)) 1)) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (ite (and (< v_~q2_front~0_111 v_~q2_back~0_131) (< v_~q2_front~0_111 v_~n2~0_94) (<= 0 v_~q2_front~0_111)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= (+ v_~q2_front~0_111 1) v_~q2_front~0_110) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (not (< v_~i~0_123 v_~N~0_78))) InVars {~n2~0=v_~n2~0_94, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, #memory_int=|v_#memory_int_217|, ~q2_front~0=v_~q2_front~0_111, ~q2~0.base=v_~q2~0.base_80, ~N~0=v_~N~0_78, ~q2_back~0=v_~q2_back~0_131} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_34|, ~j~0=v_~j~0_119, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_28|, ~n2~0=v_~n2~0_94, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, ~q2_front~0=v_~q2_front~0_110, ~N~0=v_~N~0_78, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_28|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, #memory_int=|v_#memory_int_217|, ~q2~0.base=v_~q2~0.base_80, ~q2_back~0=v_~q2_back~0_131, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:43:59,099 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,099 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,099 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,099 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,100 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,100 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,303 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,303 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,303 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,303 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,303 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,303 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,668 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,669 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,669 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,669 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,669 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,669 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,839 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,839 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,840 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,840 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,840 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:59,840 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [803] L65-1-->L65-1: Formula: (and (= v_~j~0_314 (+ (select (select |v_#memory_int_456| v_~q2~0.base_228) (+ (* v_~q2_front~0_307 4) v_~q2~0.offset_228)) 1)) (not (= (ite (and (<= 0 v_~q1_back~0_359) (< v_~q1_back~0_359 v_~n1~0_238)) 1 0) 0)) (not (= (ite (= v_~j~0_315 (select (select |v_#memory_int_456| v_~q1~0.base_253) (+ (* v_~q1_back~0_359 4) v_~q1~0.offset_253))) 1 0) 0)) (= (+ v_~q2_front~0_307 1) v_~q2_front~0_306) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_208|) (= (+ v_~q1_back~0_359 1) v_~q1_back~0_358) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| (ite (and (< v_~q2_front~0_307 v_~q2_back~0_376) (< v_~q2_front~0_307 v_~n2~0_236) (<= 0 v_~q2_front~0_307)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_208| 0)) (< v_~j~0_315 v_~N~0_240)) InVars {~j~0=v_~j~0_315, ~q1~0.offset=v_~q1~0.offset_253, ~n2~0=v_~n2~0_236, ~q1_back~0=v_~q1_back~0_359, ~q2~0.offset=v_~q2~0.offset_228, ~n1~0=v_~n1~0_238, ~q1~0.base=v_~q1~0.base_253, #memory_int=|v_#memory_int_456|, ~q2_front~0=v_~q2_front~0_307, ~q2~0.base=v_~q2~0.base_228, ~N~0=v_~N~0_240, ~q2_back~0=v_~q2_back~0_376} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_128|, ~j~0=v_~j~0_314, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_122|, ~q1~0.offset=v_~q1~0.offset_253, ~n2~0=v_~n2~0_236, ~q2~0.offset=v_~q2~0.offset_228, ~n1~0=v_~n1~0_238, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208|, ~q2_front~0=v_~q2_front~0_306, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_110|, ~N~0=v_~N~0_240, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_110|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_122|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_208|, ~q1_back~0=v_~q1_back~0_358, ~q1~0.base=v_~q1~0.base_253, #memory_int=|v_#memory_int_456|, ~q2~0.base=v_~q2~0.base_228, ~q2_back~0=v_~q2_back~0_376} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:44:00,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [831] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_509| v_~q1~0.base_293))) (and (= v_~j~0_399 (+ (select (select |v_#memory_int_509| v_~q2~0.base_270) (+ v_~q2~0.offset_270 (* v_~q2_front~0_398 4))) 1)) (= (+ v_~q1_back~0_451 1) v_~q1_back~0_450) (= (ite (and (< v_~q1_front~0_409 v_~n1~0_278) (< v_~q1_front~0_409 v_~q1_back~0_450) (<= 0 v_~q1_front~0_409)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291| 0)) (= v_~i~0_382 (+ (select .cse0 (+ (* v_~q1_front~0_409 4) v_~q1~0.offset_293)) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291| (ite (and (< v_~q2_front~0_398 v_~q2_back~0_431) (< v_~q2_front~0_398 v_~n2~0_278) (<= 0 v_~q2_front~0_398)) 1 0)) (= (+ v_~q2_front~0_398 1) v_~q2_front~0_397) (= v_~q1_front~0_408 (+ v_~q1_front~0_409 1)) (not (= (ite (and (< v_~q1_back~0_451 v_~n1~0_278) (<= 0 v_~q1_back~0_451)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (< v_~j~0_400 v_~N~0_280) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|) (not (= (ite (= v_~j~0_400 (select .cse0 (+ v_~q1~0.offset_293 (* v_~q1_back~0_451 4)))) 1 0) 0)))) InVars {~j~0=v_~j~0_400, ~q1~0.offset=v_~q1~0.offset_293, ~q1_front~0=v_~q1_front~0_409, ~n2~0=v_~n2~0_278, ~n1~0=v_~n1~0_278, ~q2~0.offset=v_~q2~0.offset_270, ~q2_front~0=v_~q2_front~0_398, ~N~0=v_~N~0_280, ~q1_back~0=v_~q1_back~0_451, ~q1~0.base=v_~q1~0.base_293, #memory_int=|v_#memory_int_509|, ~q2~0.base=v_~q2~0.base_270, ~q2_back~0=v_~q2_back~0_431} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_181|, ~j~0=v_~j~0_399, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_175|, ~q1_front~0=v_~q1_front~0_408, ~n1~0=v_~n1~0_278, ~q2~0.offset=v_~q2~0.offset_270, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_175|, ~q1_back~0=v_~q1_back~0_450, ~q1~0.base=v_~q1~0.base_293, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_189|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, ~q2~0.base=v_~q2~0.base_270, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_183|, ~q2_back~0=v_~q2_back~0_431, ~q1~0.offset=v_~q1~0.offset_293, ~n2~0=v_~n2~0_278, ~i~0=v_~i~0_382, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_183|, ~q2_front~0=v_~q2_front~0_397, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_165|, ~N~0=v_~N~0_280, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_165|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, #memory_int=|v_#memory_int_509|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [813] L65-1-->L65-1: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_43| 0) (not (= (ite (= v_~j~0_349 (select (select |v_#memory_int_478| v_~q1~0.base_269) (+ (* v_~q1_back~0_392 4) v_~q1~0.offset_269))) 1 0) 0)) (not (< v_~i~0_365 v_~N~0_254)) (= (ite (and (< v_~q2_front~0_349 v_~n2~0_254) (<= 0 v_~q2_front~0_349) (< v_~q2_front~0_349 v_~q2_back~0_404)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_242|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_242| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_242|) (< v_~j~0_349 v_~N~0_254) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_242| 0)) (not (= (ite (and (< v_~q1_back~0_392 v_~n1~0_254) (<= 0 v_~q1_back~0_392)) 1 0) 0)) (= (+ v_~q1_back~0_392 1) v_~q1_back~0_391) (= |v_thread1Thread1of1ForFork0_#res#1.offset_43| 0) (= (+ v_~q2_front~0_349 1) v_~q2_front~0_348) (= v_~j~0_348 (+ (select (select |v_#memory_int_478| v_~q2~0.base_246) (+ v_~q2~0.offset_246 (* v_~q2_front~0_349 4))) 1))) InVars {~j~0=v_~j~0_349, ~q1~0.offset=v_~q1~0.offset_269, ~n2~0=v_~n2~0_254, ~i~0=v_~i~0_365, ~q2~0.offset=v_~q2~0.offset_246, ~n1~0=v_~n1~0_254, ~q2_front~0=v_~q2_front~0_349, ~N~0=v_~N~0_254, ~q1_back~0=v_~q1_back~0_392, ~q1~0.base=v_~q1~0.base_269, #memory_int=|v_#memory_int_478|, ~q2~0.base=v_~q2~0.base_246, ~q2_back~0=v_~q2_back~0_404} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_153|, ~j~0=v_~j~0_348, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_147|, ~q1~0.offset=v_~q1~0.offset_269, ~n2~0=v_~n2~0_254, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_43|, ~i~0=v_~i~0_365, ~q2~0.offset=v_~q2~0.offset_246, ~n1~0=v_~n1~0_254, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_242|, ~q2_front~0=v_~q2_front~0_348, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_129|, ~N~0=v_~N~0_254, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_129|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_147|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_242|, ~q1_back~0=v_~q1_back~0_391, ~q1~0.base=v_~q1~0.base_269, #memory_int=|v_#memory_int_478|, ~q2~0.base=v_~q2~0.base_246, ~q2_back~0=v_~q2_back~0_404, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork0_#res#1.offset, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:44:00,230 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,230 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,230 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,230 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,230 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,230 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,230 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,231 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,592 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,592 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,672 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,672 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,672 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,672 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,672 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,672 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:00,825 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:44:00,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2540 [2022-12-06 05:44:00,831 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 179 transitions, 2848 flow [2022-12-06 05:44:00,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:00,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:00,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:00,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:01,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 05:44:01,036 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:01,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:01,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2110944287, now seen corresponding path program 1 times [2022-12-06 05:44:01,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:01,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675762473] [2022-12-06 05:44:01,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:01,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:01,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:01,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675762473] [2022-12-06 05:44:01,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675762473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:01,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:01,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:01,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954433452] [2022-12-06 05:44:01,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:01,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:01,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:01,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 05:44:01,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 179 transitions, 2848 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:01,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:01,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 05:44:01,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:01,371 INFO L130 PetriNetUnfolder]: 664/1285 cut-off events. [2022-12-06 05:44:01,371 INFO L131 PetriNetUnfolder]: For 11507/11507 co-relation queries the response was YES. [2022-12-06 05:44:01,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8979 conditions, 1285 events. 664/1285 cut-off events. For 11507/11507 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7432 event pairs, 133 based on Foata normal form. 112/1396 useless extension candidates. Maximal degree in co-relation 8888. Up to 529 conditions per place. [2022-12-06 05:44:01,380 INFO L137 encePairwiseOnDemand]: 26/59 looper letters, 129 selfloop transitions, 63 changer transitions 15/207 dead transitions. [2022-12-06 05:44:01,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 207 transitions, 3499 flow [2022-12-06 05:44:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-06 05:44:01,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3601694915254237 [2022-12-06 05:44:01,381 INFO L175 Difference]: Start difference. First operand has 114 places, 179 transitions, 2848 flow. Second operand 4 states and 85 transitions. [2022-12-06 05:44:01,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 207 transitions, 3499 flow [2022-12-06 05:44:01,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 207 transitions, 3311 flow, removed 16 selfloop flow, removed 9 redundant places. [2022-12-06 05:44:01,418 INFO L231 Difference]: Finished difference. Result has 110 places, 167 transitions, 2682 flow [2022-12-06 05:44:01,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2356, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2682, PETRI_PLACES=110, PETRI_TRANSITIONS=167} [2022-12-06 05:44:01,419 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 88 predicate places. [2022-12-06 05:44:01,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:01,419 INFO L89 Accepts]: Start accepts. Operand has 110 places, 167 transitions, 2682 flow [2022-12-06 05:44:01,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:01,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:01,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 167 transitions, 2682 flow [2022-12-06 05:44:01,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 167 transitions, 2682 flow [2022-12-06 05:44:01,470 INFO L130 PetriNetUnfolder]: 202/557 cut-off events. [2022-12-06 05:44:01,470 INFO L131 PetriNetUnfolder]: For 3240/3247 co-relation queries the response was YES. [2022-12-06 05:44:01,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3490 conditions, 557 events. 202/557 cut-off events. For 3240/3247 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3520 event pairs, 33 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 3416. Up to 176 conditions per place. [2022-12-06 05:44:01,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 167 transitions, 2682 flow [2022-12-06 05:44:01,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 05:44:01,479 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:44:01,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< v_~i~0_In_6 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~i~0=v_~i~0_In_6, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~i~0=v_~i~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:44:01,631 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:01,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 05:44:01,631 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 165 transitions, 2676 flow [2022-12-06 05:44:01,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:01,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:01,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:01,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:44:01,632 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash 422782435, now seen corresponding path program 1 times [2022-12-06 05:44:01,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:01,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935881267] [2022-12-06 05:44:01,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:01,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:01,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:01,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935881267] [2022-12-06 05:44:01,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935881267] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:01,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638046595] [2022-12-06 05:44:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:01,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:01,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:01,753 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:01,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 05:44:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:01,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:44:01,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:44:01,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:44:01,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638046595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:01,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:44:01,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-06 05:44:01,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603361675] [2022-12-06 05:44:01,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:01,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:01,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:01,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:01,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:44:01,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 05:44:01,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 165 transitions, 2676 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:01,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:01,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 05:44:01,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:02,094 INFO L130 PetriNetUnfolder]: 697/1341 cut-off events. [2022-12-06 05:44:02,094 INFO L131 PetriNetUnfolder]: For 11763/11763 co-relation queries the response was YES. [2022-12-06 05:44:02,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9932 conditions, 1341 events. 697/1341 cut-off events. For 11763/11763 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6990 event pairs, 134 based on Foata normal form. 78/1418 useless extension candidates. Maximal degree in co-relation 9819. Up to 526 conditions per place. [2022-12-06 05:44:02,103 INFO L137 encePairwiseOnDemand]: 27/46 looper letters, 118 selfloop transitions, 49 changer transitions 5/172 dead transitions. [2022-12-06 05:44:02,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 172 transitions, 3006 flow [2022-12-06 05:44:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 05:44:02,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.358695652173913 [2022-12-06 05:44:02,104 INFO L175 Difference]: Start difference. First operand has 97 places, 165 transitions, 2676 flow. Second operand 4 states and 66 transitions. [2022-12-06 05:44:02,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 172 transitions, 3006 flow [2022-12-06 05:44:02,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 172 transitions, 2794 flow, removed 48 selfloop flow, removed 8 redundant places. [2022-12-06 05:44:02,147 INFO L231 Difference]: Finished difference. Result has 94 places, 135 transitions, 2189 flow [2022-12-06 05:44:02,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2189, PETRI_PLACES=94, PETRI_TRANSITIONS=135} [2022-12-06 05:44:02,148 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 72 predicate places. [2022-12-06 05:44:02,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:02,148 INFO L89 Accepts]: Start accepts. Operand has 94 places, 135 transitions, 2189 flow [2022-12-06 05:44:02,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:02,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:02,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 135 transitions, 2189 flow [2022-12-06 05:44:02,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 135 transitions, 2189 flow [2022-12-06 05:44:02,202 INFO L130 PetriNetUnfolder]: 231/629 cut-off events. [2022-12-06 05:44:02,202 INFO L131 PetriNetUnfolder]: For 4030/4034 co-relation queries the response was YES. [2022-12-06 05:44:02,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 629 events. 231/629 cut-off events. For 4030/4034 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3552 event pairs, 38 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 3554. Up to 217 conditions per place. [2022-12-06 05:44:02,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 135 transitions, 2189 flow [2022-12-06 05:44:02,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-06 05:44:02,207 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:02,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 05:44:02,208 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 135 transitions, 2189 flow [2022-12-06 05:44:02,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:02,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:02,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:02,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:02,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:02,413 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1155603500, now seen corresponding path program 1 times [2022-12-06 05:44:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:02,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740731701] [2022-12-06 05:44:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:03,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:03,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740731701] [2022-12-06 05:44:03,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740731701] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:03,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491649570] [2022-12-06 05:44:03,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:03,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:03,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:03,664 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:03,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 05:44:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:03,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 05:44:03,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:03,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:03,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:03,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:03,826 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:44:03,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-06 05:44:03,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:03,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 05:44:03,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 05:44:03,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:44:04,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 20 [2022-12-06 05:44:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:04,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:04,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491649570] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:04,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:04,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 05:44:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161747190] [2022-12-06 05:44:04,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:04,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:44:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:44:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-12-06 05:44:04,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:44:04,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 135 transitions, 2189 flow. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:04,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:04,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:44:04,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:05,464 INFO L130 PetriNetUnfolder]: 688/1313 cut-off events. [2022-12-06 05:44:05,464 INFO L131 PetriNetUnfolder]: For 9827/9827 co-relation queries the response was YES. [2022-12-06 05:44:05,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9464 conditions, 1313 events. 688/1313 cut-off events. For 9827/9827 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6715 event pairs, 61 based on Foata normal form. 5/1316 useless extension candidates. Maximal degree in co-relation 7925. Up to 749 conditions per place. [2022-12-06 05:44:05,471 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 45 selfloop transitions, 105 changer transitions 6/156 dead transitions. [2022-12-06 05:44:05,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 156 transitions, 2613 flow [2022-12-06 05:44:05,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:44:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:44:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2022-12-06 05:44:05,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17873303167420815 [2022-12-06 05:44:05,472 INFO L175 Difference]: Start difference. First operand has 93 places, 135 transitions, 2189 flow. Second operand 13 states and 79 transitions. [2022-12-06 05:44:05,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 156 transitions, 2613 flow [2022-12-06 05:44:05,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 156 transitions, 2475 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:05,495 INFO L231 Difference]: Finished difference. Result has 104 places, 136 transitions, 2283 flow [2022-12-06 05:44:05,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2051, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2283, PETRI_PLACES=104, PETRI_TRANSITIONS=136} [2022-12-06 05:44:05,496 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 82 predicate places. [2022-12-06 05:44:05,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:05,496 INFO L89 Accepts]: Start accepts. Operand has 104 places, 136 transitions, 2283 flow [2022-12-06 05:44:05,496 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:05,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:05,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 136 transitions, 2283 flow [2022-12-06 05:44:05,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 136 transitions, 2283 flow [2022-12-06 05:44:05,547 INFO L130 PetriNetUnfolder]: 226/620 cut-off events. [2022-12-06 05:44:05,547 INFO L131 PetriNetUnfolder]: For 3639/3643 co-relation queries the response was YES. [2022-12-06 05:44:05,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3990 conditions, 620 events. 226/620 cut-off events. For 3639/3643 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3530 event pairs, 38 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 3920. Up to 217 conditions per place. [2022-12-06 05:44:05,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 136 transitions, 2283 flow [2022-12-06 05:44:05,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 05:44:05,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:44:05,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:44:05,813 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:05,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 318 [2022-12-06 05:44:05,814 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 135 transitions, 2301 flow [2022-12-06 05:44:05,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:05,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:05,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:05,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:06,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-06 05:44:06,015 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:06,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:06,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1704438174, now seen corresponding path program 1 times [2022-12-06 05:44:06,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:06,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873031348] [2022-12-06 05:44:06,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:06,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:07,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873031348] [2022-12-06 05:44:07,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873031348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:07,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226822184] [2022-12-06 05:44:07,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:07,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:07,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:07,378 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:07,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 05:44:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:07,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 05:44:07,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:07,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:07,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:07,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:07,531 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:44:07,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2022-12-06 05:44:07,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-12-06 05:44:07,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 05:44:07,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:44:07,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 20 [2022-12-06 05:44:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:07,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:08,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226822184] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:08,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:08,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-06 05:44:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024625295] [2022-12-06 05:44:08,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:08,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 05:44:08,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 05:44:08,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-12-06 05:44:08,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:44:08,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 135 transitions, 2301 flow. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:08,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:08,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:44:08,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:09,843 INFO L130 PetriNetUnfolder]: 686/1303 cut-off events. [2022-12-06 05:44:09,844 INFO L131 PetriNetUnfolder]: For 8806/8806 co-relation queries the response was YES. [2022-12-06 05:44:09,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9563 conditions, 1303 events. 686/1303 cut-off events. For 8806/8806 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6586 event pairs, 51 based on Foata normal form. 5/1302 useless extension candidates. Maximal degree in co-relation 9483. Up to 618 conditions per place. [2022-12-06 05:44:09,852 INFO L137 encePairwiseOnDemand]: 6/36 looper letters, 35 selfloop transitions, 102 changer transitions 42/179 dead transitions. [2022-12-06 05:44:09,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 179 transitions, 2993 flow [2022-12-06 05:44:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 05:44:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 05:44:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 102 transitions. [2022-12-06 05:44:09,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1349206349206349 [2022-12-06 05:44:09,877 INFO L175 Difference]: Start difference. First operand has 102 places, 135 transitions, 2301 flow. Second operand 21 states and 102 transitions. [2022-12-06 05:44:09,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 179 transitions, 2993 flow [2022-12-06 05:44:09,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 179 transitions, 2738 flow, removed 8 selfloop flow, removed 11 redundant places. [2022-12-06 05:44:09,907 INFO L231 Difference]: Finished difference. Result has 117 places, 127 transitions, 2144 flow [2022-12-06 05:44:09,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2144, PETRI_PLACES=117, PETRI_TRANSITIONS=127} [2022-12-06 05:44:09,907 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 95 predicate places. [2022-12-06 05:44:09,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:09,907 INFO L89 Accepts]: Start accepts. Operand has 117 places, 127 transitions, 2144 flow [2022-12-06 05:44:09,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:09,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:09,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 127 transitions, 2144 flow [2022-12-06 05:44:09,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 127 transitions, 2144 flow [2022-12-06 05:44:09,959 INFO L130 PetriNetUnfolder]: 222/585 cut-off events. [2022-12-06 05:44:09,959 INFO L131 PetriNetUnfolder]: For 4245/4249 co-relation queries the response was YES. [2022-12-06 05:44:09,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4146 conditions, 585 events. 222/585 cut-off events. For 4245/4249 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3196 event pairs, 31 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 4076. Up to 211 conditions per place. [2022-12-06 05:44:09,963 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 127 transitions, 2144 flow [2022-12-06 05:44:09,963 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 05:44:09,964 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:09,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 05:44:09,965 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 127 transitions, 2144 flow [2022-12-06 05:44:09,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:09,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:09,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:09,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:10,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-06 05:44:10,171 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:10,171 INFO L85 PathProgramCache]: Analyzing trace with hash -840530870, now seen corresponding path program 1 times [2022-12-06 05:44:10,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:10,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396257971] [2022-12-06 05:44:10,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:10,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:12,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:12,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396257971] [2022-12-06 05:44:12,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396257971] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:12,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191246556] [2022-12-06 05:44:12,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:12,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:12,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:12,270 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:12,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 05:44:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:12,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 05:44:12,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:12,421 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-06 05:44:12,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 84 [2022-12-06 05:44:12,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-12-06 05:44:12,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-12-06 05:44:12,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 25 [2022-12-06 05:44:12,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-06 05:44:12,454 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:12,455 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2022-12-06 05:44:12,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:12,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 05:44:12,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:44:12,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:44:12,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2022-12-06 05:44:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:12,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:12,919 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_1055 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1055))) (let ((.cse0 (select .cse3 c_~q1~0.base))) (or (< (+ (select .cse0 .cse1) 1) c_~N~0) (not (= c_~j~0 (select .cse0 .cse2))) (< (select (select .cse3 c_~q2~0.base) .cse4) c_~N~0))))) (forall ((v_ArrVal_1055 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1055))) (let ((.cse7 (select .cse6 c_~q1~0.base))) (let ((.cse5 (select .cse7 .cse1))) (or (< .cse5 (+ (select (select .cse6 c_~q2~0.base) .cse4) 1)) (< (+ .cse5 1) c_~N~0) (not (= c_~j~0 (select .cse7 .cse2)))))))))) is different from false [2022-12-06 05:44:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:13,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191246556] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:13,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:13,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 05:44:13,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925236327] [2022-12-06 05:44:13,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:13,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:44:13,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:13,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:44:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=292, Unknown=3, NotChecked=34, Total=380 [2022-12-06 05:44:13,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:44:13,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 127 transitions, 2144 flow. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:13,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:13,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:44:13,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:19,547 WARN L233 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 121 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:44:22,155 INFO L130 PetriNetUnfolder]: 737/1397 cut-off events. [2022-12-06 05:44:22,155 INFO L131 PetriNetUnfolder]: For 12946/12946 co-relation queries the response was YES. [2022-12-06 05:44:22,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11032 conditions, 1397 events. 737/1397 cut-off events. For 12946/12946 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7194 event pairs, 121 based on Foata normal form. 3/1387 useless extension candidates. Maximal degree in co-relation 10949. Up to 1173 conditions per place. [2022-12-06 05:44:22,167 INFO L137 encePairwiseOnDemand]: 8/32 looper letters, 115 selfloop transitions, 69 changer transitions 12/196 dead transitions. [2022-12-06 05:44:22,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 196 transitions, 3512 flow [2022-12-06 05:44:22,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:44:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:44:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2022-12-06 05:44:22,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.201171875 [2022-12-06 05:44:22,188 INFO L175 Difference]: Start difference. First operand has 99 places, 127 transitions, 2144 flow. Second operand 16 states and 103 transitions. [2022-12-06 05:44:22,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 196 transitions, 3512 flow [2022-12-06 05:44:22,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 196 transitions, 3058 flow, removed 38 selfloop flow, removed 16 redundant places. [2022-12-06 05:44:22,238 INFO L231 Difference]: Finished difference. Result has 106 places, 165 transitions, 2661 flow [2022-12-06 05:44:22,238 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2661, PETRI_PLACES=106, PETRI_TRANSITIONS=165} [2022-12-06 05:44:22,239 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 84 predicate places. [2022-12-06 05:44:22,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:22,239 INFO L89 Accepts]: Start accepts. Operand has 106 places, 165 transitions, 2661 flow [2022-12-06 05:44:22,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:22,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:22,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 165 transitions, 2661 flow [2022-12-06 05:44:22,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 165 transitions, 2661 flow [2022-12-06 05:44:22,340 INFO L130 PetriNetUnfolder]: 323/805 cut-off events. [2022-12-06 05:44:22,341 INFO L131 PetriNetUnfolder]: For 4929/4943 co-relation queries the response was YES. [2022-12-06 05:44:22,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5287 conditions, 805 events. 323/805 cut-off events. For 4929/4943 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4652 event pairs, 34 based on Foata normal form. 2/784 useless extension candidates. Maximal degree in co-relation 4877. Up to 328 conditions per place. [2022-12-06 05:44:22,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 165 transitions, 2661 flow [2022-12-06 05:44:22,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-06 05:44:22,584 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:22,585 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:22,585 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:22,585 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:22,585 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:22,585 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:22,585 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:22,585 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:22,892 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] [2022-12-06 05:44:23,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:44:23,384 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-06 05:44:23,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-06 05:44:23,523 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-06 05:44:31,690 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-06 05:44:31,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-06 05:44:31,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:44:32,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [842] L52-->L65-1: Formula: (and (= (+ (select (select |v_#memory_int_528| v_~q1~0.base_305) (+ (* v_~q1_front~0_424 4) v_~q1~0.offset_305)) 1) v_~i~0_395) (= v_~q2_front~0_436 (+ v_~q2_front~0_437 1)) (= v_~j~0_430 (+ (select (select |v_#memory_int_528| v_~q2~0.base_286) (+ v_~q2~0.offset_286 (* v_~q2_front~0_437 4))) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300| (ite (and (< v_~q1_front~0_424 v_~q1_back~0_478) (<= 0 v_~q1_front~0_424) (< v_~q1_front~0_424 v_~n1~0_290)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_300|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_300| 0)) (= (+ v_~q1_front~0_424 1) v_~q1_front~0_423) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318| (ite (and (< v_~q2_front~0_437 v_~q2_back~0_448) (<= 0 v_~q2_front~0_437) (< v_~q2_front~0_437 v_~n2~0_294)) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_305, ~n2~0=v_~n2~0_294, ~q1_front~0=v_~q1_front~0_424, ~q1_back~0=v_~q1_back~0_478, ~q2~0.offset=v_~q2~0.offset_286, ~n1~0=v_~n1~0_290, ~q1~0.base=v_~q1~0.base_305, #memory_int=|v_#memory_int_528|, ~q2_front~0=v_~q2_front~0_437, ~q2~0.base=v_~q2~0.base_286, ~q2_back~0=v_~q2_back~0_448} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_205|, ~j~0=v_~j~0_430, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_199|, ~q1~0.offset=v_~q1~0.offset_305, ~n2~0=v_~n2~0_294, ~q1_front~0=v_~q1_front~0_423, ~i~0=v_~i~0_395, ~q2~0.offset=v_~q2~0.offset_286, ~n1~0=v_~n1~0_290, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_191|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318|, ~q2_front~0=v_~q2_front~0_436, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_199|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300|, ~q1_back~0=v_~q1_back~0_478, ~q1~0.base=v_~q1~0.base_305, #memory_int=|v_#memory_int_528|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_197|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_300|, ~q2~0.base=v_~q2~0.base_286, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_191|, ~q2_back~0=v_~q2_back~0_448} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:44:36,123 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 05:44:36,124 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13885 [2022-12-06 05:44:36,124 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 161 transitions, 2749 flow [2022-12-06 05:44:36,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:36,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:36,124 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:36,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 05:44:36,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 05:44:36,331 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1353452714, now seen corresponding path program 1 times [2022-12-06 05:44:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:36,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806145412] [2022-12-06 05:44:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:37,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:37,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806145412] [2022-12-06 05:44:37,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806145412] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:37,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335154796] [2022-12-06 05:44:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:37,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:37,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:37,706 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:37,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 05:44:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:37,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 05:44:37,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:37,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:37,910 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-12-06 05:44:37,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 100 [2022-12-06 05:44:37,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 05:44:37,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-06 05:44:37,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:37,965 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-12-06 05:44:37,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 32 [2022-12-06 05:44:37,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-06 05:44:37,982 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:37,983 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2022-12-06 05:44:38,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:38,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:44:38,176 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-06 05:44:38,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 20 [2022-12-06 05:44:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:38,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:38,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335154796] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:38,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:38,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:44:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430290503] [2022-12-06 05:44:38,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:38,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:44:38,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:38,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:44:38,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=190, Unknown=4, NotChecked=0, Total=240 [2022-12-06 05:44:38,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:44:38,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 161 transitions, 2749 flow. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:38,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:38,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:44:38,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:39,765 INFO L130 PetriNetUnfolder]: 763/1457 cut-off events. [2022-12-06 05:44:39,766 INFO L131 PetriNetUnfolder]: For 12129/12129 co-relation queries the response was YES. [2022-12-06 05:44:39,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10779 conditions, 1457 events. 763/1457 cut-off events. For 12129/12129 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7854 event pairs, 93 based on Foata normal form. 7/1457 useless extension candidates. Maximal degree in co-relation 9730. Up to 905 conditions per place. [2022-12-06 05:44:39,775 INFO L137 encePairwiseOnDemand]: 14/48 looper letters, 91 selfloop transitions, 114 changer transitions 18/223 dead transitions. [2022-12-06 05:44:39,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 223 transitions, 3895 flow [2022-12-06 05:44:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:44:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:44:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 116 transitions. [2022-12-06 05:44:39,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16111111111111112 [2022-12-06 05:44:39,776 INFO L175 Difference]: Start difference. First operand has 103 places, 161 transitions, 2749 flow. Second operand 15 states and 116 transitions. [2022-12-06 05:44:39,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 223 transitions, 3895 flow [2022-12-06 05:44:39,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 223 transitions, 3680 flow, removed 66 selfloop flow, removed 5 redundant places. [2022-12-06 05:44:39,816 INFO L231 Difference]: Finished difference. Result has 118 places, 180 transitions, 3290 flow [2022-12-06 05:44:39,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2539, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3290, PETRI_PLACES=118, PETRI_TRANSITIONS=180} [2022-12-06 05:44:39,817 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 96 predicate places. [2022-12-06 05:44:39,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:39,817 INFO L89 Accepts]: Start accepts. Operand has 118 places, 180 transitions, 3290 flow [2022-12-06 05:44:39,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:39,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:39,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 180 transitions, 3290 flow [2022-12-06 05:44:39,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 180 transitions, 3290 flow [2022-12-06 05:44:39,900 INFO L130 PetriNetUnfolder]: 343/845 cut-off events. [2022-12-06 05:44:39,901 INFO L131 PetriNetUnfolder]: For 7086/7103 co-relation queries the response was YES. [2022-12-06 05:44:39,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5985 conditions, 845 events. 343/845 cut-off events. For 7086/7103 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5107 event pairs, 39 based on Foata normal form. 1/805 useless extension candidates. Maximal degree in co-relation 5741. Up to 328 conditions per place. [2022-12-06 05:44:39,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 180 transitions, 3290 flow [2022-12-06 05:44:39,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 05:44:39,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [842] L52-->L65-1: Formula: (and (= (+ (select (select |v_#memory_int_528| v_~q1~0.base_305) (+ (* v_~q1_front~0_424 4) v_~q1~0.offset_305)) 1) v_~i~0_395) (= v_~q2_front~0_436 (+ v_~q2_front~0_437 1)) (= v_~j~0_430 (+ (select (select |v_#memory_int_528| v_~q2~0.base_286) (+ v_~q2~0.offset_286 (* v_~q2_front~0_437 4))) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300| (ite (and (< v_~q1_front~0_424 v_~q1_back~0_478) (<= 0 v_~q1_front~0_424) (< v_~q1_front~0_424 v_~n1~0_290)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_300|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_300| 0)) (= (+ v_~q1_front~0_424 1) v_~q1_front~0_423) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318| (ite (and (< v_~q2_front~0_437 v_~q2_back~0_448) (<= 0 v_~q2_front~0_437) (< v_~q2_front~0_437 v_~n2~0_294)) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_305, ~n2~0=v_~n2~0_294, ~q1_front~0=v_~q1_front~0_424, ~q1_back~0=v_~q1_back~0_478, ~q2~0.offset=v_~q2~0.offset_286, ~n1~0=v_~n1~0_290, ~q1~0.base=v_~q1~0.base_305, #memory_int=|v_#memory_int_528|, ~q2_front~0=v_~q2_front~0_437, ~q2~0.base=v_~q2~0.base_286, ~q2_back~0=v_~q2_back~0_448} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_205|, ~j~0=v_~j~0_430, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_199|, ~q1~0.offset=v_~q1~0.offset_305, ~n2~0=v_~n2~0_294, ~q1_front~0=v_~q1_front~0_423, ~i~0=v_~i~0_395, ~q2~0.offset=v_~q2~0.offset_286, ~n1~0=v_~n1~0_290, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_191|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318|, ~q2_front~0=v_~q2_front~0_436, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_199|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300|, ~q1_back~0=v_~q1_back~0_478, ~q1~0.base=v_~q1~0.base_305, #memory_int=|v_#memory_int_528|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_197|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_300|, ~q2~0.base=v_~q2~0.base_286, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_191|, ~q2_back~0=v_~q2_back~0_448} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:44:40,130 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:44:40,222 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:40,223 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:40,223 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:40,223 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:40,223 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:40,223 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:40,223 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:40,223 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:40,223 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:40,223 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:40,442 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:40,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 625 [2022-12-06 05:44:40,442 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 180 transitions, 3310 flow [2022-12-06 05:44:40,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:40,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:40,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:40,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:40,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:40,643 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:40,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1481939158, now seen corresponding path program 1 times [2022-12-06 05:44:40,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:40,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721107616] [2022-12-06 05:44:40,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:40,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:41,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:41,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721107616] [2022-12-06 05:44:41,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721107616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:41,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177011889] [2022-12-06 05:44:41,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:41,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:41,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:41,364 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:41,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 05:44:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:41,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 05:44:41,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:41,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:41,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:44:41,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:41,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-12-06 05:44:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:41,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:41,966 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-06 05:44:41,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 352 [2022-12-06 05:44:41,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:41,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-06 05:44:42,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:42,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-06 05:45:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:05,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177011889] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:05,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:05,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-06 05:45:05,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728096338] [2022-12-06 05:45:05,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:05,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:45:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:05,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:45:05,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:45:05,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:45:05,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 180 transitions, 3310 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:05,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:05,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:45:05,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:06,350 INFO L130 PetriNetUnfolder]: 820/1569 cut-off events. [2022-12-06 05:45:06,350 INFO L131 PetriNetUnfolder]: For 16341/16341 co-relation queries the response was YES. [2022-12-06 05:45:06,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12358 conditions, 1569 events. 820/1569 cut-off events. For 16341/16341 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8743 event pairs, 53 based on Foata normal form. 17/1578 useless extension candidates. Maximal degree in co-relation 12072. Up to 807 conditions per place. [2022-12-06 05:45:06,359 INFO L137 encePairwiseOnDemand]: 12/49 looper letters, 89 selfloop transitions, 158 changer transitions 12/259 dead transitions. [2022-12-06 05:45:06,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 259 transitions, 4877 flow [2022-12-06 05:45:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:45:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:45:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 129 transitions. [2022-12-06 05:45:06,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1385606874328679 [2022-12-06 05:45:06,362 INFO L175 Difference]: Start difference. First operand has 113 places, 180 transitions, 3310 flow. Second operand 19 states and 129 transitions. [2022-12-06 05:45:06,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 259 transitions, 4877 flow [2022-12-06 05:45:06,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 259 transitions, 4788 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-12-06 05:45:06,406 INFO L231 Difference]: Finished difference. Result has 135 places, 219 transitions, 4486 flow [2022-12-06 05:45:06,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3235, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4486, PETRI_PLACES=135, PETRI_TRANSITIONS=219} [2022-12-06 05:45:06,406 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 113 predicate places. [2022-12-06 05:45:06,406 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:06,406 INFO L89 Accepts]: Start accepts. Operand has 135 places, 219 transitions, 4486 flow [2022-12-06 05:45:06,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:06,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:06,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 219 transitions, 4486 flow [2022-12-06 05:45:06,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 219 transitions, 4486 flow [2022-12-06 05:45:06,499 INFO L130 PetriNetUnfolder]: 350/889 cut-off events. [2022-12-06 05:45:06,500 INFO L131 PetriNetUnfolder]: For 10963/10978 co-relation queries the response was YES. [2022-12-06 05:45:06,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7372 conditions, 889 events. 350/889 cut-off events. For 10963/10978 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5562 event pairs, 38 based on Foata normal form. 3/861 useless extension candidates. Maximal degree in co-relation 6937. Up to 348 conditions per place. [2022-12-06 05:45:06,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 219 transitions, 4486 flow [2022-12-06 05:45:06,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 05:45:06,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-06 05:45:07,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:45:07,065 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:45:07,126 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [850] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_558| v_~q2~0.base_299))) (and (not (= (ite (= v_~j~0_447 (select (select |v_#memory_int_558| v_~q1~0.base_315) (+ v_~q1~0.offset_315 (* v_~q1_back~0_497 4)))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_338| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_338|) (= (+ v_~q2_back~0_469 1) v_~q2_back~0_468) (< v_~i~0_411 v_~N~0_302) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_338| (ite (and (< v_~q2_front~0_455 v_~q2_back~0_468) (< v_~q2_front~0_455 v_~n2~0_304) (<= 0 v_~q2_front~0_455)) 1 0)) (not (= (ite (and (<= 0 v_~q1_back~0_497) (< v_~q1_back~0_497 v_~n1~0_300)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_320| 0)) (= (+ v_~q2_front~0_455 1) v_~q2_front~0_454) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_320| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_320|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_338| 0)) (not (= (ite (and (< v_~q2_back~0_469 v_~n2~0_304) (<= 0 v_~q2_back~0_469)) 1 0) 0)) (= (+ v_~q1_back~0_497 1) v_~q1_back~0_496) (= (ite (= (select .cse0 (+ v_~q2~0.offset_299 (* 4 v_~q2_back~0_469))) v_~i~0_411) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_320|) (< v_~j~0_447 v_~N~0_302) (= v_~j~0_446 (+ (select .cse0 (+ v_~q2~0.offset_299 (* v_~q2_front~0_455 4))) 1)))) InVars {~j~0=v_~j~0_447, ~q1~0.offset=v_~q1~0.offset_315, ~n2~0=v_~n2~0_304, ~i~0=v_~i~0_411, ~q2~0.offset=v_~q2~0.offset_299, ~n1~0=v_~n1~0_300, ~q2_front~0=v_~q2_front~0_455, ~N~0=v_~N~0_302, ~q1_back~0=v_~q1_back~0_497, ~q1~0.base=v_~q1~0.base_315, #memory_int=|v_#memory_int_558|, ~q2~0.base=v_~q2~0.base_299, ~q2_back~0=v_~q2_back~0_469} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_161|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_217|, ~j~0=v_~j~0_446, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_211|, ~q1~0.offset=v_~q1~0.offset_315, ~n2~0=v_~n2~0_304, ~i~0=v_~i~0_411, ~q2~0.offset=v_~q2~0.offset_299, ~n1~0=v_~n1~0_300, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_338|, ~q2_front~0=v_~q2_front~0_454, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_191|, ~N~0=v_~N~0_302, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_191|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_211|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_338|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_320|, ~q1_back~0=v_~q1_back~0_496, ~q1~0.base=v_~q1~0.base_315, #memory_int=|v_#memory_int_558|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_320|, ~q2~0.base=v_~q2~0.base_299, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_161|, ~q2_back~0=v_~q2_back~0_468} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:45:07,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:45:07,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:45:07,379 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,380 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,380 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,380 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,380 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,380 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,380 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,380 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,380 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,380 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,380 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,380 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [849] L65-1-->L65-1: Formula: (let ((.cse1 (select |v_#memory_int_556| v_~q2~0.base_297)) (.cse0 (select |v_#memory_int_556| v_~q1~0.base_313))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_334| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334|) (< v_~j~0_443 v_~N~0_300) (= (+ v_~q2_back~0_465 1) v_~q2_back~0_464) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_316| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_316|) (not (= (ite (= v_~j~0_443 (select .cse0 (+ (* v_~q1_back~0_493 4) v_~q1~0.offset_313))) 1 0) 0)) (not (= (ite (and (< v_~q2_back~0_465 v_~n2~0_302) (<= 0 v_~q2_back~0_465)) 1 0) 0)) (= (+ v_~q1_back~0_493 1) v_~q1_back~0_492) (= (+ v_~q2_front~0_451 1) v_~q2_front~0_450) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_316| (ite (and (<= 0 v_~q1_front~0_438) (< v_~q1_front~0_438 v_~n1~0_298) (< v_~q1_front~0_438 v_~q1_back~0_492)) 1 0)) (= v_~j~0_442 (+ (select .cse1 (+ v_~q2~0.offset_297 (* v_~q2_front~0_451 4))) 1)) (not (= (ite (= (select .cse1 (+ v_~q2~0.offset_297 (* 4 v_~q2_back~0_465))) v_~i~0_408) 1 0) 0)) (= v_~q1_front~0_437 (+ v_~q1_front~0_438 1)) (not (= (ite (and (< v_~q1_back~0_493 v_~n1~0_298) (<= 0 v_~q1_back~0_493)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_334| (ite (and (< v_~q2_front~0_451 v_~n2~0_302) (< v_~q2_front~0_451 v_~q2_back~0_464) (<= 0 v_~q2_front~0_451)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334| 0)) (= (+ (select .cse0 (+ v_~q1~0.offset_313 (* v_~q1_front~0_438 4))) 1) v_~i~0_407) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_316| 0)) (< v_~i~0_408 v_~N~0_300))) InVars {~j~0=v_~j~0_443, ~q1~0.offset=v_~q1~0.offset_313, ~n2~0=v_~n2~0_302, ~q1_front~0=v_~q1_front~0_438, ~i~0=v_~i~0_408, ~q2~0.offset=v_~q2~0.offset_297, ~n1~0=v_~n1~0_298, ~q2_front~0=v_~q2_front~0_451, ~N~0=v_~N~0_300, ~q1_back~0=v_~q1_back~0_493, ~q1~0.base=v_~q1~0.base_313, #memory_int=|v_#memory_int_556|, ~q2~0.base=v_~q2~0.base_297, ~q2_back~0=v_~q2_back~0_465} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_159|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_215|, ~j~0=v_~j~0_442, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_209|, ~q1_front~0=v_~q1_front~0_437, ~q2~0.offset=v_~q2~0.offset_297, ~n1~0=v_~n1~0_298, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_334|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_209|, ~q1_back~0=v_~q1_back~0_492, ~q1~0.base=v_~q1~0.base_313, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_207|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_316|, ~q2~0.base=v_~q2~0.base_297, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_201|, ~q2_back~0=v_~q2_back~0_464, ~q1~0.offset=v_~q1~0.offset_313, ~n2~0=v_~n2~0_302, ~i~0=v_~i~0_407, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_201|, ~q2_front~0=v_~q2_front~0_450, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_189|, ~N~0=v_~N~0_300, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_189|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_316|, #memory_int=|v_#memory_int_556|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_159|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [870] L47-1-->L70: Formula: (and (= (ite (= v_~j~0_489 (select (select |v_#memory_int_633| v_~q1~0.base_345) (+ v_~q1~0.offset_345 (* v_~q1_back~0_547 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_373|) (< v_~j~0_489 v_~N~0_338) (= v_~q2_back~0_516 (+ v_~q2_back~0_517 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_373| 0)) (= (+ v_~q1_back~0_547 1) v_~q1_back~0_546) (not (= (ite (and (< v_~q2_back~0_517 v_~n2~0_338) (<= 0 v_~q2_back~0_517)) 1 0) 0)) (not (= (ite (and (<= 0 v_~q1_back~0_547) (< v_~q1_back~0_547 v_~n1~0_328)) 1 0) 0)) (< v_~i~0_445 v_~N~0_338) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_348| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_373| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_373|) (= (ite (= (select (select |v_#memory_int_633| v_~q2~0.base_339) (+ v_~q2~0.offset_339 (* 4 v_~q2_back~0_517))) v_~i~0_445) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_348|)) InVars {~j~0=v_~j~0_489, ~q1~0.offset=v_~q1~0.offset_345, ~n2~0=v_~n2~0_338, ~q1_back~0=v_~q1_back~0_547, ~i~0=v_~i~0_445, ~n1~0=v_~n1~0_328, ~q2~0.offset=v_~q2~0.offset_339, ~q1~0.base=v_~q1~0.base_345, #memory_int=|v_#memory_int_633|, ~q2~0.base=v_~q2~0.base_339, ~N~0=v_~N~0_338, ~q2_back~0=v_~q2_back~0_517} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_179|, ~j~0=v_~j~0_489, ~q1~0.offset=v_~q1~0.offset_345, ~n2~0=v_~n2~0_338, ~i~0=v_~i~0_445, ~n1~0=v_~n1~0_328, ~q2~0.offset=v_~q2~0.offset_339, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_373|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_215|, ~N~0=v_~N~0_338, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_215|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_373|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_348|, ~q1_back~0=v_~q1_back~0_546, ~q1~0.base=v_~q1~0.base_345, #memory_int=|v_#memory_int_633|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348|, ~q2~0.base=v_~q2~0.base_339, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_179|, ~q2_back~0=v_~q2_back~0_516} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:45:07,678 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,678 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,678 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,678 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,678 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,678 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,678 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,678 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,678 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,678 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,679 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:07,679 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:08,253 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 05:45:08,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1849 [2022-12-06 05:45:08,255 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 218 transitions, 4565 flow [2022-12-06 05:45:08,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:08,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:08,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:08,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:08,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:08,461 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1720336635, now seen corresponding path program 1 times [2022-12-06 05:45:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:08,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182068085] [2022-12-06 05:45:08,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:08,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:09,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:09,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182068085] [2022-12-06 05:45:09,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182068085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:09,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:09,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:09,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499976386] [2022-12-06 05:45:09,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:09,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:45:09,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:09,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:45:09,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:45:09,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:45:09,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 218 transitions, 4565 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:09,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:09,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:45:09,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:09,698 INFO L130 PetriNetUnfolder]: 803/1529 cut-off events. [2022-12-06 05:45:09,698 INFO L131 PetriNetUnfolder]: For 22791/22791 co-relation queries the response was YES. [2022-12-06 05:45:09,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13690 conditions, 1529 events. 803/1529 cut-off events. For 22791/22791 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8361 event pairs, 105 based on Foata normal form. 1/1522 useless extension candidates. Maximal degree in co-relation 13153. Up to 1383 conditions per place. [2022-12-06 05:45:09,709 INFO L137 encePairwiseOnDemand]: 26/57 looper letters, 166 selfloop transitions, 52 changer transitions 10/228 dead transitions. [2022-12-06 05:45:09,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 228 transitions, 5087 flow [2022-12-06 05:45:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:45:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:45:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-06 05:45:09,712 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27017543859649124 [2022-12-06 05:45:09,712 INFO L175 Difference]: Start difference. First operand has 132 places, 218 transitions, 4565 flow. Second operand 5 states and 77 transitions. [2022-12-06 05:45:09,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 228 transitions, 5087 flow [2022-12-06 05:45:09,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 228 transitions, 4997 flow, removed 45 selfloop flow, removed 1 redundant places. [2022-12-06 05:45:09,770 INFO L231 Difference]: Finished difference. Result has 136 places, 213 transitions, 4519 flow [2022-12-06 05:45:09,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=4475, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4519, PETRI_PLACES=136, PETRI_TRANSITIONS=213} [2022-12-06 05:45:09,771 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 114 predicate places. [2022-12-06 05:45:09,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:09,771 INFO L89 Accepts]: Start accepts. Operand has 136 places, 213 transitions, 4519 flow [2022-12-06 05:45:09,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:09,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:09,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 213 transitions, 4519 flow [2022-12-06 05:45:09,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 213 transitions, 4519 flow [2022-12-06 05:45:09,870 INFO L130 PetriNetUnfolder]: 359/879 cut-off events. [2022-12-06 05:45:09,870 INFO L131 PetriNetUnfolder]: For 11641/11655 co-relation queries the response was YES. [2022-12-06 05:45:09,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7456 conditions, 879 events. 359/879 cut-off events. For 11641/11655 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5393 event pairs, 35 based on Foata normal form. 6/851 useless extension candidates. Maximal degree in co-relation 7359. Up to 349 conditions per place. [2022-12-06 05:45:09,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 213 transitions, 4519 flow [2022-12-06 05:45:09,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 05:45:09,879 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:09,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 05:45:09,880 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 213 transitions, 4519 flow [2022-12-06 05:45:09,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:09,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:09,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:09,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:45:09,880 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1366827908, now seen corresponding path program 1 times [2022-12-06 05:45:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:09,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489563064] [2022-12-06 05:45:09,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:09,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:10,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:10,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489563064] [2022-12-06 05:45:10,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489563064] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:10,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744645291] [2022-12-06 05:45:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:10,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:10,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:10,731 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:10,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 05:45:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:10,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:45:10,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:10,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-12-06 05:45:10,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:45:10,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 20 [2022-12-06 05:45:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:11,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:11,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:11,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 248 treesize of output 276 [2022-12-06 05:45:11,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:11,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 168 [2022-12-06 05:45:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:13,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744645291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:13,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:13,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:45:13,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401133185] [2022-12-06 05:45:13,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:13,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:45:13,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:45:13,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:45:13,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 05:45:13,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 213 transitions, 4519 flow. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:13,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:13,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 05:45:13,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:15,052 INFO L130 PetriNetUnfolder]: 891/1700 cut-off events. [2022-12-06 05:45:15,052 INFO L131 PetriNetUnfolder]: For 25363/25363 co-relation queries the response was YES. [2022-12-06 05:45:15,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15301 conditions, 1700 events. 891/1700 cut-off events. For 25363/25363 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9664 event pairs, 93 based on Foata normal form. 3/1695 useless extension candidates. Maximal degree in co-relation 14861. Up to 988 conditions per place. [2022-12-06 05:45:15,064 INFO L137 encePairwiseOnDemand]: 14/54 looper letters, 119 selfloop transitions, 160 changer transitions 22/301 dead transitions. [2022-12-06 05:45:15,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 301 transitions, 6442 flow [2022-12-06 05:45:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 05:45:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 05:45:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 142 transitions. [2022-12-06 05:45:15,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13148148148148148 [2022-12-06 05:45:15,066 INFO L175 Difference]: Start difference. First operand has 131 places, 213 transitions, 4519 flow. Second operand 20 states and 142 transitions. [2022-12-06 05:45:15,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 301 transitions, 6442 flow [2022-12-06 05:45:15,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 301 transitions, 6290 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-06 05:45:15,136 INFO L231 Difference]: Finished difference. Result has 153 places, 243 transitions, 5622 flow [2022-12-06 05:45:15,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4377, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=5622, PETRI_PLACES=153, PETRI_TRANSITIONS=243} [2022-12-06 05:45:15,136 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 131 predicate places. [2022-12-06 05:45:15,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:15,137 INFO L89 Accepts]: Start accepts. Operand has 153 places, 243 transitions, 5622 flow [2022-12-06 05:45:15,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:15,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:15,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 243 transitions, 5622 flow [2022-12-06 05:45:15,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 243 transitions, 5622 flow [2022-12-06 05:45:15,272 INFO L130 PetriNetUnfolder]: 386/969 cut-off events. [2022-12-06 05:45:15,272 INFO L131 PetriNetUnfolder]: For 15828/15842 co-relation queries the response was YES. [2022-12-06 05:45:15,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8991 conditions, 969 events. 386/969 cut-off events. For 15828/15842 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6273 event pairs, 42 based on Foata normal form. 6/939 useless extension candidates. Maximal degree in co-relation 8759. Up to 385 conditions per place. [2022-12-06 05:45:15,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 243 transitions, 5622 flow [2022-12-06 05:45:15,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 05:45:18,085 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [842] L52-->L65-1: Formula: (and (= (+ (select (select |v_#memory_int_528| v_~q1~0.base_305) (+ (* v_~q1_front~0_424 4) v_~q1~0.offset_305)) 1) v_~i~0_395) (= v_~q2_front~0_436 (+ v_~q2_front~0_437 1)) (= v_~j~0_430 (+ (select (select |v_#memory_int_528| v_~q2~0.base_286) (+ v_~q2~0.offset_286 (* v_~q2_front~0_437 4))) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300| (ite (and (< v_~q1_front~0_424 v_~q1_back~0_478) (<= 0 v_~q1_front~0_424) (< v_~q1_front~0_424 v_~n1~0_290)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_300|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_300| 0)) (= (+ v_~q1_front~0_424 1) v_~q1_front~0_423) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318| (ite (and (< v_~q2_front~0_437 v_~q2_back~0_448) (<= 0 v_~q2_front~0_437) (< v_~q2_front~0_437 v_~n2~0_294)) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_305, ~n2~0=v_~n2~0_294, ~q1_front~0=v_~q1_front~0_424, ~q1_back~0=v_~q1_back~0_478, ~q2~0.offset=v_~q2~0.offset_286, ~n1~0=v_~n1~0_290, ~q1~0.base=v_~q1~0.base_305, #memory_int=|v_#memory_int_528|, ~q2_front~0=v_~q2_front~0_437, ~q2~0.base=v_~q2~0.base_286, ~q2_back~0=v_~q2_back~0_448} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_205|, ~j~0=v_~j~0_430, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_199|, ~q1~0.offset=v_~q1~0.offset_305, ~n2~0=v_~n2~0_294, ~q1_front~0=v_~q1_front~0_423, ~i~0=v_~i~0_395, ~q2~0.offset=v_~q2~0.offset_286, ~n1~0=v_~n1~0_290, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_191|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318|, ~q2_front~0=v_~q2_front~0_436, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_199|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300|, ~q1_back~0=v_~q1_back~0_478, ~q1~0.base=v_~q1~0.base_305, #memory_int=|v_#memory_int_528|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_197|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_300|, ~q2~0.base=v_~q2~0.base_286, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_191|, ~q2_back~0=v_~q2_back~0_448} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:45:18,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [843] L52-->L65-1: Formula: (and (= (+ v_~q2_front~0_441 1) v_~q2_front~0_440) (= (+ (select (select |v_#memory_int_530| v_~q1~0.base_307) (+ v_~q1~0.offset_307 (* v_~q1_front~0_428 4))) 1) v_~i~0_397) (= (ite (and (< v_~q1_front~0_428 v_~q1_back~0_480) (<= 0 v_~q1_front~0_428) (< v_~q1_front~0_428 v_~n1~0_292)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_302|) (= v_~q1_front~0_427 (+ v_~q1_front~0_428 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_302| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_302|) (= |v_thread1Thread1of1ForFork0_#res#1.base_59| 0) (not (< v_~i~0_397 v_~N~0_294)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_320| (ite (and (<= 0 v_~q2_front~0_441) (< v_~q2_front~0_441 v_~n2~0_296) (< v_~q2_front~0_441 v_~q2_back~0_450)) 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_59| 0) (= v_~j~0_432 (+ (select (select |v_#memory_int_530| v_~q2~0.base_288) (+ v_~q2~0.offset_288 (* v_~q2_front~0_441 4))) 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_302| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_320| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_320| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_320|)) InVars {~q1~0.offset=v_~q1~0.offset_307, ~n2~0=v_~n2~0_296, ~q1_front~0=v_~q1_front~0_428, ~q1_back~0=v_~q1_back~0_480, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_292, ~q1~0.base=v_~q1~0.base_307, #memory_int=|v_#memory_int_530|, ~q2_front~0=v_~q2_front~0_441, ~q2~0.base=v_~q2~0.base_288, ~N~0=v_~N~0_294, ~q2_back~0=v_~q2_back~0_450} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_207|, ~j~0=v_~j~0_432, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_201|, ~q1_front~0=v_~q1_front~0_427, ~q2~0.offset=v_~q2~0.offset_288, ~n1~0=v_~n1~0_292, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_320|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_201|, ~q1_back~0=v_~q1_back~0_480, ~q1~0.base=v_~q1~0.base_307, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_199|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_302|, ~q2~0.base=v_~q2~0.base_288, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_193|, ~q2_back~0=v_~q2_back~0_450, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_59|, ~q1~0.offset=v_~q1~0.offset_307, ~n2~0=v_~n2~0_296, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_59|, ~i~0=v_~i~0_397, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_193|, ~q2_front~0=v_~q2_front~0_440, ~N~0=v_~N~0_294, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_320|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_302|, #memory_int=|v_#memory_int_530|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, thread1Thread1of1ForFork0_#res#1.offset, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:45:18,400 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:18,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3263 [2022-12-06 05:45:18,400 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 243 transitions, 5658 flow [2022-12-06 05:45:18,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:18,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:18,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:18,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 05:45:18,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 05:45:18,606 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:18,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:18,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1605241097, now seen corresponding path program 1 times [2022-12-06 05:45:18,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:18,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172743555] [2022-12-06 05:45:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:18,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:19,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:19,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172743555] [2022-12-06 05:45:19,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172743555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:19,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706986690] [2022-12-06 05:45:19,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:19,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:19,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:19,180 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:19,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 05:45:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:19,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:45:19,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:19,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2022-12-06 05:45:19,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:45:19,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 20 [2022-12-06 05:45:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:19,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:19,631 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse4 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_1428 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1428))) (let ((.cse0 (select .cse2 c_~q1~0.base))) (or (< (select .cse0 .cse1) c_~N~0) (< (+ (select (select .cse2 c_~q2~0.base) .cse3) 1) c_~N~0) (not (= (select .cse0 .cse4) c_~j~0)))))) (forall ((v_ArrVal_1428 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1428))) (let ((.cse6 (select .cse5 c_~q1~0.base))) (or (< (select (select .cse5 c_~q2~0.base) .cse3) c_~N~0) (not (= (select .cse6 .cse4) c_~j~0)) (< (+ (select .cse6 .cse1) 1) c_~N~0))))))) is different from false [2022-12-06 05:45:19,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:19,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 248 [2022-12-06 05:45:19,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:19,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-06 05:45:19,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:19,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-06 05:45:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:28,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706986690] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:28,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:28,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-06 05:45:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477954681] [2022-12-06 05:45:28,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:28,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:45:28,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:28,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:45:28,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=147, Unknown=1, NotChecked=24, Total=210 [2022-12-06 05:45:28,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:45:28,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 243 transitions, 5658 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:28,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:28,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:45:28,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:29,366 INFO L130 PetriNetUnfolder]: 896/1722 cut-off events. [2022-12-06 05:45:29,366 INFO L131 PetriNetUnfolder]: For 31522/31522 co-relation queries the response was YES. [2022-12-06 05:45:29,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16539 conditions, 1722 events. 896/1722 cut-off events. For 31522/31522 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9989 event pairs, 163 based on Foata normal form. 6/1719 useless extension candidates. Maximal degree in co-relation 16231. Up to 1075 conditions per place. [2022-12-06 05:45:29,378 INFO L137 encePairwiseOnDemand]: 13/56 looper letters, 105 selfloop transitions, 166 changer transitions 19/290 dead transitions. [2022-12-06 05:45:29,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 290 transitions, 6800 flow [2022-12-06 05:45:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:45:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:45:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 123 transitions. [2022-12-06 05:45:29,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14642857142857144 [2022-12-06 05:45:29,380 INFO L175 Difference]: Start difference. First operand has 153 places, 243 transitions, 5658 flow. Second operand 15 states and 123 transitions. [2022-12-06 05:45:29,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 290 transitions, 6800 flow [2022-12-06 05:45:29,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 290 transitions, 6650 flow, removed 23 selfloop flow, removed 9 redundant places. [2022-12-06 05:45:29,465 INFO L231 Difference]: Finished difference. Result has 162 places, 251 transitions, 6217 flow [2022-12-06 05:45:29,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=5508, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6217, PETRI_PLACES=162, PETRI_TRANSITIONS=251} [2022-12-06 05:45:29,469 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 140 predicate places. [2022-12-06 05:45:29,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:29,469 INFO L89 Accepts]: Start accepts. Operand has 162 places, 251 transitions, 6217 flow [2022-12-06 05:45:29,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:29,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:29,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 251 transitions, 6217 flow [2022-12-06 05:45:29,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 251 transitions, 6217 flow [2022-12-06 05:45:29,603 INFO L130 PetriNetUnfolder]: 439/1074 cut-off events. [2022-12-06 05:45:29,603 INFO L131 PetriNetUnfolder]: For 20108/20127 co-relation queries the response was YES. [2022-12-06 05:45:29,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10268 conditions, 1074 events. 439/1074 cut-off events. For 20108/20127 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7062 event pairs, 87 based on Foata normal form. 3/1011 useless extension candidates. Maximal degree in co-relation 10061. Up to 413 conditions per place. [2022-12-06 05:45:29,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 251 transitions, 6217 flow [2022-12-06 05:45:29,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-06 05:45:29,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [868] L65-1-->L70: Formula: (let ((.cse1 (select |v_#memory_int_623| v_~q2~0.base_335)) (.cse2 (select |v_#memory_int_623| v_~q1~0.base_341)) (.cse3 (* v_~q1_back~0_541 4))) (and (not (= (ite (and (< v_~q2_back~0_512 v_~n2~0_334) (<= 0 v_~q2_back~0_512)) 1 0) 0)) (not (= (ite (let ((.cse0 (+ v_~q1_back~0_541 1))) (and (<= 0 .cse0) (< .cse0 v_~n1~0_326))) 1 0) 0)) (< v_~j~0_484 v_~N~0_336) (= v_~j~0_483 (+ (select .cse1 (+ v_~q2~0.offset_335 (* v_~q2_front~0_486 4))) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_343| (ite (= (select .cse1 (+ v_~q2~0.offset_335 (* 4 v_~q2_back~0_512))) v_~i~0_442) 1 0)) (< v_~j~0_483 v_~N~0_336) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_367| (ite (= v_~j~0_483 (select .cse2 (+ v_~q1~0.offset_341 .cse3 4))) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_367| 0)) (not (= (ite (and (< v_~q1_back~0_541 v_~n1~0_326) (<= 0 v_~q1_back~0_541)) 1 0) 0)) (< v_~i~0_442 v_~N~0_336) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_367| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_367|) (not (= 0 (ite (= v_~j~0_484 (select .cse2 (+ v_~q1~0.offset_341 .cse3))) 1 0))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_343| 0)) (= (+ 2 v_~q1_back~0_541) v_~q1_back~0_539) (= (+ v_~q2_back~0_512 1) v_~q2_back~0_511) (= (+ v_~q2_front~0_486 1) v_~q2_front~0_485) (not (= (ite (and (< v_~q2_front~0_486 v_~q2_back~0_511) (<= 0 v_~q2_front~0_486) (< v_~q2_front~0_486 v_~n2~0_334)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_343| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_343|))) InVars {~j~0=v_~j~0_484, ~q1~0.offset=v_~q1~0.offset_341, ~n2~0=v_~n2~0_334, ~i~0=v_~i~0_442, ~n1~0=v_~n1~0_326, ~q2~0.offset=v_~q2~0.offset_335, ~q2_front~0=v_~q2_front~0_486, ~N~0=v_~N~0_336, ~q1_back~0=v_~q1_back~0_541, ~q1~0.base=v_~q1~0.base_341, #memory_int=|v_#memory_int_623|, ~q2~0.base=v_~q2~0.base_335, ~q2_back~0=v_~q2_back~0_512} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_175|, ~j~0=v_~j~0_483, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_229|, ~q1~0.offset=v_~q1~0.offset_341, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_223|, ~n2~0=v_~n2~0_334, ~i~0=v_~i~0_442, ~n1~0=v_~n1~0_326, ~q2~0.offset=v_~q2~0.offset_335, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_367|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_209|, ~q2_front~0=v_~q2_front~0_485, ~N~0=v_~N~0_336, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_209|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_223|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_367|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_343|, ~q1_back~0=v_~q1_back~0_539, ~q1~0.base=v_~q1~0.base_341, #memory_int=|v_#memory_int_623|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_343|, ~q2~0.base=v_~q2~0.base_335, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_175|, ~q2_back~0=v_~q2_back~0_511} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:45:29,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:45:29,936 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] [2022-12-06 05:45:29,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-06 05:45:30,112 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:45:30,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 644 [2022-12-06 05:45:30,113 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 248 transitions, 6187 flow [2022-12-06 05:45:30,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:30,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:30,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:30,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-06 05:45:30,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 05:45:30,314 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:30,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1748854734, now seen corresponding path program 1 times [2022-12-06 05:45:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:30,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860467266] [2022-12-06 05:45:30,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:30,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:30,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:30,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860467266] [2022-12-06 05:45:30,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860467266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:30,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:30,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:45:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161106501] [2022-12-06 05:45:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:30,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:45:30,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:30,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:45:30,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:45:30,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:45:30,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 248 transitions, 6187 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:30,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:30,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:45:30,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:30,777 INFO L130 PetriNetUnfolder]: 914/1738 cut-off events. [2022-12-06 05:45:30,777 INFO L131 PetriNetUnfolder]: For 37590/37590 co-relation queries the response was YES. [2022-12-06 05:45:30,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17943 conditions, 1738 events. 914/1738 cut-off events. For 37590/37590 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9884 event pairs, 324 based on Foata normal form. 2/1734 useless extension candidates. Maximal degree in co-relation 17612. Up to 1623 conditions per place. [2022-12-06 05:45:30,790 INFO L137 encePairwiseOnDemand]: 50/58 looper letters, 246 selfloop transitions, 26 changer transitions 5/277 dead transitions. [2022-12-06 05:45:30,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 277 transitions, 7131 flow [2022-12-06 05:45:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:45:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:45:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-06 05:45:30,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43103448275862066 [2022-12-06 05:45:30,791 INFO L175 Difference]: Start difference. First operand has 157 places, 248 transitions, 6187 flow. Second operand 3 states and 75 transitions. [2022-12-06 05:45:30,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 277 transitions, 7131 flow [2022-12-06 05:45:30,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 277 transitions, 6994 flow, removed 14 selfloop flow, removed 10 redundant places. [2022-12-06 05:45:30,881 INFO L231 Difference]: Finished difference. Result has 150 places, 256 transitions, 6217 flow [2022-12-06 05:45:30,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=5949, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=6217, PETRI_PLACES=150, PETRI_TRANSITIONS=256} [2022-12-06 05:45:30,882 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 128 predicate places. [2022-12-06 05:45:30,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:30,882 INFO L89 Accepts]: Start accepts. Operand has 150 places, 256 transitions, 6217 flow [2022-12-06 05:45:30,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:30,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:30,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 256 transitions, 6217 flow [2022-12-06 05:45:30,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 256 transitions, 6217 flow [2022-12-06 05:45:31,010 INFO L130 PetriNetUnfolder]: 446/1079 cut-off events. [2022-12-06 05:45:31,010 INFO L131 PetriNetUnfolder]: For 18975/18995 co-relation queries the response was YES. [2022-12-06 05:45:31,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10357 conditions, 1079 events. 446/1079 cut-off events. For 18975/18995 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7070 event pairs, 91 based on Foata normal form. 3/1026 useless extension candidates. Maximal degree in co-relation 10040. Up to 409 conditions per place. [2022-12-06 05:45:31,022 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 256 transitions, 6217 flow [2022-12-06 05:45:31,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-06 05:45:31,024 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:31,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-06 05:45:31,025 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 256 transitions, 6217 flow [2022-12-06 05:45:31,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:31,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:31,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:31,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:45:31,025 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1765450993, now seen corresponding path program 1 times [2022-12-06 05:45:31,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:31,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605498072] [2022-12-06 05:45:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:32,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605498072] [2022-12-06 05:45:32,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605498072] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:32,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037709228] [2022-12-06 05:45:32,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:32,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:32,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:32,037 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:32,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 05:45:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:32,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 05:45:32,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:32,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-12-06 05:45:32,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:45:32,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 17 [2022-12-06 05:45:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:32,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:32,486 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:32,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 248 treesize of output 276 [2022-12-06 05:45:32,514 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:32,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 168 [2022-12-06 05:45:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:33,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037709228] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:33,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:33,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:45:33,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172587470] [2022-12-06 05:45:33,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:33,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:45:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:45:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:45:33,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:45:33,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 256 transitions, 6217 flow. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:33,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:33,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:45:33,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:35,242 INFO L130 PetriNetUnfolder]: 985/1892 cut-off events. [2022-12-06 05:45:35,243 INFO L131 PetriNetUnfolder]: For 39079/39079 co-relation queries the response was YES. [2022-12-06 05:45:35,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19500 conditions, 1892 events. 985/1892 cut-off events. For 39079/39079 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11279 event pairs, 133 based on Foata normal form. 2/1888 useless extension candidates. Maximal degree in co-relation 19169. Up to 1136 conditions per place. [2022-12-06 05:45:35,258 INFO L137 encePairwiseOnDemand]: 9/57 looper letters, 104 selfloop transitions, 200 changer transitions 11/315 dead transitions. [2022-12-06 05:45:35,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 315 transitions, 7702 flow [2022-12-06 05:45:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:45:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:45:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 132 transitions. [2022-12-06 05:45:35,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1286549707602339 [2022-12-06 05:45:35,259 INFO L175 Difference]: Start difference. First operand has 150 places, 256 transitions, 6217 flow. Second operand 18 states and 132 transitions. [2022-12-06 05:45:35,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 315 transitions, 7702 flow [2022-12-06 05:45:35,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 315 transitions, 7676 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:45:35,385 INFO L231 Difference]: Finished difference. Result has 171 places, 277 transitions, 7391 flow [2022-12-06 05:45:35,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=6191, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7391, PETRI_PLACES=171, PETRI_TRANSITIONS=277} [2022-12-06 05:45:35,386 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 149 predicate places. [2022-12-06 05:45:35,386 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:35,386 INFO L89 Accepts]: Start accepts. Operand has 171 places, 277 transitions, 7391 flow [2022-12-06 05:45:35,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:35,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:35,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 277 transitions, 7391 flow [2022-12-06 05:45:35,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 277 transitions, 7391 flow [2022-12-06 05:45:35,541 INFO L130 PetriNetUnfolder]: 480/1177 cut-off events. [2022-12-06 05:45:35,541 INFO L131 PetriNetUnfolder]: For 25123/25152 co-relation queries the response was YES. [2022-12-06 05:45:35,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12075 conditions, 1177 events. 480/1177 cut-off events. For 25123/25152 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7991 event pairs, 102 based on Foata normal form. 8/1120 useless extension candidates. Maximal degree in co-relation 11801. Up to 445 conditions per place. [2022-12-06 05:45:35,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 277 transitions, 7391 flow [2022-12-06 05:45:35,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-06 05:45:35,560 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:45:35,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:35,639 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-06 05:45:35,639 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 276 transitions, 7367 flow [2022-12-06 05:45:35,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:35,639 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:35,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:35,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:35,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:35,845 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1368899660, now seen corresponding path program 1 times [2022-12-06 05:45:35,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:35,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447233563] [2022-12-06 05:45:35,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:37,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447233563] [2022-12-06 05:45:37,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447233563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:37,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354125832] [2022-12-06 05:45:37,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:37,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:37,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:37,377 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:37,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 05:45:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:37,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 05:45:37,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:37,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-06 05:45:37,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:45:37,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 22 [2022-12-06 05:45:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:37,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:37,875 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~q1_back~0 4)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (* c_~q1_front~0 4))) (and (forall ((v_ArrVal_1588 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1588))) (or (forall ((~q1~0.offset Int)) (let ((.cse0 (select .cse3 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse0 (+ .cse1 ~q1~0.offset)))) (< (+ (select .cse0 (+ .cse2 ~q1~0.offset)) 1) c_~N~0)))) (< (select (select .cse3 c_~q2~0.base) .cse4) c_~N~0)))) (forall ((~q1~0.offset Int) (v_ArrVal_1588 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1588))) (let ((.cse5 (select .cse7 c_~q1~0.base))) (let ((.cse6 (select .cse5 (+ .cse2 ~q1~0.offset)))) (or (not (= c_~j~0 (select .cse5 (+ .cse1 ~q1~0.offset)))) (< (+ .cse6 1) c_~N~0) (< .cse6 (+ (select (select .cse7 c_~q2~0.base) .cse4) 1))))))))) is different from false [2022-12-06 05:45:37,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:37,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 280 treesize of output 436 [2022-12-06 05:45:38,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:38,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 204 [2022-12-06 05:45:38,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:38,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 186 [2022-12-06 05:46:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:14,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354125832] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:14,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:14,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 05:46:14,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369397030] [2022-12-06 05:46:14,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:14,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:46:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:46:14,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=296, Unknown=1, NotChecked=34, Total=380 [2022-12-06 05:46:14,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:46:14,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 276 transitions, 7367 flow. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:14,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:14,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:46:14,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:16,967 INFO L130 PetriNetUnfolder]: 1055/2042 cut-off events. [2022-12-06 05:46:16,968 INFO L131 PetriNetUnfolder]: For 51276/51276 co-relation queries the response was YES. [2022-12-06 05:46:16,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22413 conditions, 2042 events. 1055/2042 cut-off events. For 51276/51276 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12568 event pairs, 158 based on Foata normal form. 2/2034 useless extension candidates. Maximal degree in co-relation 22078. Up to 1612 conditions per place. [2022-12-06 05:46:16,985 INFO L137 encePairwiseOnDemand]: 13/58 looper letters, 207 selfloop transitions, 130 changer transitions 13/350 dead transitions. [2022-12-06 05:46:16,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 350 transitions, 9471 flow [2022-12-06 05:46:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:46:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:46:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 124 transitions. [2022-12-06 05:46:16,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1257606490872211 [2022-12-06 05:46:16,987 INFO L175 Difference]: Start difference. First operand has 170 places, 276 transitions, 7367 flow. Second operand 17 states and 124 transitions. [2022-12-06 05:46:16,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 350 transitions, 9471 flow [2022-12-06 05:46:17,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 350 transitions, 9412 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-06 05:46:17,189 INFO L231 Difference]: Finished difference. Result has 183 places, 301 transitions, 8367 flow [2022-12-06 05:46:17,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=7308, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8367, PETRI_PLACES=183, PETRI_TRANSITIONS=301} [2022-12-06 05:46:17,189 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 161 predicate places. [2022-12-06 05:46:17,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:17,190 INFO L89 Accepts]: Start accepts. Operand has 183 places, 301 transitions, 8367 flow [2022-12-06 05:46:17,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:17,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:17,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 301 transitions, 8367 flow [2022-12-06 05:46:17,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 301 transitions, 8367 flow [2022-12-06 05:46:17,361 INFO L130 PetriNetUnfolder]: 507/1253 cut-off events. [2022-12-06 05:46:17,361 INFO L131 PetriNetUnfolder]: For 29083/29099 co-relation queries the response was YES. [2022-12-06 05:46:17,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13051 conditions, 1253 events. 507/1253 cut-off events. For 29083/29099 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8764 event pairs, 106 based on Foata normal form. 5/1188 useless extension candidates. Maximal degree in co-relation 12860. Up to 468 conditions per place. [2022-12-06 05:46:17,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 301 transitions, 8367 flow [2022-12-06 05:46:17,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-06 05:46:20,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [887] L47-1-->L98-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388|) (= (+ v_~q2_back~0_561 1) v_~q2_back~0_560) (not (= 0 (ite (and (<= 0 v_~q2_back~0_561) (< v_~q2_back~0_561 v_~n2~0_362)) 1 0))) (= |v_ULTIMATE.start_main_#t~mem22#1_98| (select (select |v_#memory_int_671| |v_ULTIMATE.start_main_~#t1~0#1.base_83|) |v_ULTIMATE.start_main_~#t1~0#1.offset_83|)) (= (ite (= (select (select |v_#memory_int_671| v_~q2~0.base_363) (+ v_~q2~0.offset_363 (* 4 v_~q2_back~0_561))) v_~i~0_485) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388| 0)) (< v_~i~0_485 v_~N~0_368)) InVars {~n2~0=v_~n2~0_362, ~i~0=v_~i~0_485, ~q2~0.offset=v_~q2~0.offset_363, #memory_int=|v_#memory_int_671|, ~q2~0.base=v_~q2~0.base_363, ~N~0=v_~N~0_368, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_83|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_83|, ~q2_back~0=v_~q2_back~0_561} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_201|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_80|, ~n2~0=v_~n2~0_362, ~i~0=v_~i~0_485, ~q2~0.offset=v_~q2~0.offset_363, ~N~0=v_~N~0_368, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_83|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_83|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_133|, #memory_int=|v_#memory_int_671|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388|, ~q2~0.base=v_~q2~0.base_363, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_201|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_98|, ~q2_back~0=v_~q2_back~0_560} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ULTIMATE.start_main_#t~mem22#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-06 05:46:20,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:46:21,802 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:46:21,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4615 [2022-12-06 05:46:21,805 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 299 transitions, 8407 flow [2022-12-06 05:46:21,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:21,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:21,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:21,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:22,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:22,011 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash 949500142, now seen corresponding path program 1 times [2022-12-06 05:46:22,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:22,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20681969] [2022-12-06 05:46:22,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:22,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:22,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:22,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20681969] [2022-12-06 05:46:22,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20681969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:22,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:22,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:22,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314001717] [2022-12-06 05:46:22,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:22,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:22,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:22,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:22,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:22,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:46:22,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 299 transitions, 8407 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:22,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:22,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:46:22,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:22,697 INFO L130 PetriNetUnfolder]: 958/1931 cut-off events. [2022-12-06 05:46:22,697 INFO L131 PetriNetUnfolder]: For 50665/50665 co-relation queries the response was YES. [2022-12-06 05:46:22,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21099 conditions, 1931 events. 958/1931 cut-off events. For 50665/50665 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12171 event pairs, 470 based on Foata normal form. 68/1994 useless extension candidates. Maximal degree in co-relation 20961. Up to 1608 conditions per place. [2022-12-06 05:46:22,711 INFO L137 encePairwiseOnDemand]: 46/61 looper letters, 221 selfloop transitions, 6 changer transitions 41/268 dead transitions. [2022-12-06 05:46:22,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 268 transitions, 7573 flow [2022-12-06 05:46:22,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-06 05:46:22,712 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3442622950819672 [2022-12-06 05:46:22,713 INFO L175 Difference]: Start difference. First operand has 181 places, 299 transitions, 8407 flow. Second operand 4 states and 84 transitions. [2022-12-06 05:46:22,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 268 transitions, 7573 flow [2022-12-06 05:46:22,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 268 transitions, 7307 flow, removed 29 selfloop flow, removed 11 redundant places. [2022-12-06 05:46:22,881 INFO L231 Difference]: Finished difference. Result has 172 places, 212 transitions, 5396 flow [2022-12-06 05:46:22,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=6313, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5396, PETRI_PLACES=172, PETRI_TRANSITIONS=212} [2022-12-06 05:46:22,882 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 150 predicate places. [2022-12-06 05:46:22,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:22,882 INFO L89 Accepts]: Start accepts. Operand has 172 places, 212 transitions, 5396 flow [2022-12-06 05:46:22,883 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:22,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:22,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 212 transitions, 5396 flow [2022-12-06 05:46:22,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 212 transitions, 5396 flow [2022-12-06 05:46:22,993 INFO L130 PetriNetUnfolder]: 347/914 cut-off events. [2022-12-06 05:46:22,993 INFO L131 PetriNetUnfolder]: For 16777/16796 co-relation queries the response was YES. [2022-12-06 05:46:22,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8656 conditions, 914 events. 347/914 cut-off events. For 16777/16796 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6174 event pairs, 99 based on Foata normal form. 9/837 useless extension candidates. Maximal degree in co-relation 8509. Up to 338 conditions per place. [2022-12-06 05:46:23,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 212 transitions, 5396 flow [2022-12-06 05:46:23,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 05:46:23,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:46:23,080 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:23,080 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:23,080 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:23,080 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:23,080 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:23,080 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:23,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [861] L65-1-->L65-1: Formula: (and (not (= (ite (= v_~j~0_463 (select (select |v_#memory_int_604| v_~q1~0.base_329) (+ v_~q1~0.offset_329 (* v_~q1_back~0_517 4)))) 1 0) 0)) (= (+ v_~q2_front~0_467 1) v_~q2_front~0_466) (= v_~j~0_462 (+ (select (select |v_#memory_int_604| v_~q2~0.base_323) (+ v_~q2~0.offset_323 (* v_~q2_front~0_467 4))) 1)) (not (= (ite (and (<= 0 v_~q1_back~0_517) (< v_~q1_back~0_517 v_~n1~0_314)) 1 0) 0)) (= (+ v_~q1_back~0_517 1) v_~q1_back~0_516) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_346| 0)) (< v_~j~0_463 v_~N~0_324) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_346|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (and (< v_~q2_front~0_467 v_~n2~0_324) (<= 0 v_~q2_front~0_467) (< v_~q2_front~0_467 v_~q2_back~0_500)) 1 0))) InVars {~j~0=v_~j~0_463, ~q1~0.offset=v_~q1~0.offset_329, ~n2~0=v_~n2~0_324, ~q1_back~0=v_~q1_back~0_517, ~q2~0.offset=v_~q2~0.offset_323, ~n1~0=v_~n1~0_314, ~q1~0.base=v_~q1~0.base_329, #memory_int=|v_#memory_int_604|, ~q2_front~0=v_~q2_front~0_467, ~q2~0.base=v_~q2~0.base_323, ~N~0=v_~N~0_324, ~q2_back~0=v_~q2_back~0_500} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_219|, ~j~0=v_~j~0_462, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_213|, ~q1~0.offset=v_~q1~0.offset_329, ~n2~0=v_~n2~0_324, ~q2~0.offset=v_~q2~0.offset_323, ~n1~0=v_~n1~0_314, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, ~q2_front~0=v_~q2_front~0_466, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_197|, ~N~0=v_~N~0_324, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_197|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_213|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_346|, ~q1_back~0=v_~q1_back~0_516, ~q1~0.base=v_~q1~0.base_329, #memory_int=|v_#memory_int_604|, ~q2~0.base=v_~q2~0.base_323, ~q2_back~0=v_~q2_back~0_500} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:46:23,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-06 05:46:23,953 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:46:23,954 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1072 [2022-12-06 05:46:23,954 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 209 transitions, 5406 flow [2022-12-06 05:46:23,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:23,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:23,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:23,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 05:46:23,954 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:23,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:23,954 INFO L85 PathProgramCache]: Analyzing trace with hash -801958277, now seen corresponding path program 1 times [2022-12-06 05:46:23,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:23,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856889806] [2022-12-06 05:46:23,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:23,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:25,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:25,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856889806] [2022-12-06 05:46:25,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856889806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:25,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472816300] [2022-12-06 05:46:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:25,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:25,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:25,393 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:46:25,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 05:46:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:25,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 05:46:25,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:25,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:46:25,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:46:25,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:25,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-12-06 05:46:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:25,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:26,063 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1711))) (or (forall ((~q1~0.base Int)) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (< (select .cse0 .cse2) c_~N~0)))) (< (+ (select (select .cse3 c_~q2~0.base) .cse4) 1) c_~N~0)))) (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1711))) (or (< (select (select .cse5 c_~q2~0.base) .cse4) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse6 (select .cse5 ~q1~0.base))) (or (not (= c_~j~0 (select .cse6 .cse1))) (< (+ (select .cse6 .cse2) 1) c_~N~0))))))))) is different from false [2022-12-06 05:46:26,222 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-06 05:46:26,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 352 [2022-12-06 05:46:26,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:26,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-06 05:46:26,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:26,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-06 05:46:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:49,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472816300] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:49,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:49,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-06 05:46:49,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014560213] [2022-12-06 05:46:49,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:49,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 05:46:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:49,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 05:46:49,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2022-12-06 05:46:49,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:46:49,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 209 transitions, 5406 flow. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:49,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:49,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:46:49,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:51,593 INFO L130 PetriNetUnfolder]: 944/1865 cut-off events. [2022-12-06 05:46:51,594 INFO L131 PetriNetUnfolder]: For 42657/42657 co-relation queries the response was YES. [2022-12-06 05:46:51,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19891 conditions, 1865 events. 944/1865 cut-off events. For 42657/42657 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11796 event pairs, 60 based on Foata normal form. 4/1865 useless extension candidates. Maximal degree in co-relation 19730. Up to 881 conditions per place. [2022-12-06 05:46:51,608 INFO L137 encePairwiseOnDemand]: 8/49 looper letters, 77 selfloop transitions, 182 changer transitions 43/302 dead transitions. [2022-12-06 05:46:51,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 302 transitions, 7439 flow [2022-12-06 05:46:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 05:46:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 05:46:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 155 transitions. [2022-12-06 05:46:51,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13180272108843538 [2022-12-06 05:46:51,612 INFO L175 Difference]: Start difference. First operand has 158 places, 209 transitions, 5406 flow. Second operand 24 states and 155 transitions. [2022-12-06 05:46:51,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 302 transitions, 7439 flow [2022-12-06 05:46:51,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 302 transitions, 6835 flow, removed 98 selfloop flow, removed 12 redundant places. [2022-12-06 05:46:51,731 INFO L231 Difference]: Finished difference. Result has 183 places, 232 transitions, 6172 flow [2022-12-06 05:46:51,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4962, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6172, PETRI_PLACES=183, PETRI_TRANSITIONS=232} [2022-12-06 05:46:51,732 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 161 predicate places. [2022-12-06 05:46:51,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:51,732 INFO L89 Accepts]: Start accepts. Operand has 183 places, 232 transitions, 6172 flow [2022-12-06 05:46:51,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:51,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:51,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 232 transitions, 6172 flow [2022-12-06 05:46:51,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 232 transitions, 6172 flow [2022-12-06 05:46:51,849 INFO L130 PetriNetUnfolder]: 351/929 cut-off events. [2022-12-06 05:46:51,849 INFO L131 PetriNetUnfolder]: For 22730/22744 co-relation queries the response was YES. [2022-12-06 05:46:51,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9410 conditions, 929 events. 351/929 cut-off events. For 22730/22744 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6485 event pairs, 99 based on Foata normal form. 6/851 useless extension candidates. Maximal degree in co-relation 9283. Up to 343 conditions per place. [2022-12-06 05:46:51,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 232 transitions, 6172 flow [2022-12-06 05:46:51,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-06 05:46:51,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [882] L65-1-->L65-1: Formula: (and (not (= (ite (= v_~j~0_520 (select (select |v_#memory_int_659| v_~q1~0.base_363) (+ v_~q1~0.offset_363 (* v_~q1_back~0_578 4)))) 1 0) 0)) (< v_~j~0_520 v_~N~0_358) (= v_~q2_front~0_517 (+ v_~q2_front~0_518 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_393| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_393|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_393| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_578) (< v_~q1_back~0_578 v_~n1~0_344)) 1 0) 0)) (= v_~j~0_519 (+ (select (select |v_#memory_int_659| v_~q2~0.base_355) (+ (* v_~q2_front~0_518 4) v_~q2~0.offset_355)) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_393| (ite (and (<= 0 v_~q2_front~0_518) (< v_~q2_front~0_518 v_~q2_back~0_549) (< v_~q2_front~0_518 v_~n2~0_354)) 1 0)) (= (+ v_~q1_back~0_578 1) v_~q1_back~0_577)) InVars {~j~0=v_~j~0_520, ~q1~0.offset=v_~q1~0.offset_363, ~n2~0=v_~n2~0_354, ~q1_back~0=v_~q1_back~0_578, ~q2~0.offset=v_~q2~0.offset_355, ~n1~0=v_~n1~0_344, ~q1~0.base=v_~q1~0.base_363, #memory_int=|v_#memory_int_659|, ~q2_front~0=v_~q2_front~0_518, ~q2~0.base=v_~q2~0.base_355, ~N~0=v_~N~0_358, ~q2_back~0=v_~q2_back~0_549} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_247|, ~j~0=v_~j~0_519, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_241|, ~q1~0.offset=v_~q1~0.offset_363, ~n2~0=v_~n2~0_354, ~q2~0.offset=v_~q2~0.offset_355, ~n1~0=v_~n1~0_344, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_393|, ~q2_front~0=v_~q2_front~0_517, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_231|, ~N~0=v_~N~0_358, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_231|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_241|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_393|, ~q1_back~0=v_~q1_back~0_577, ~q1~0.base=v_~q1~0.base_363, #memory_int=|v_#memory_int_659|, ~q2~0.base=v_~q2~0.base_355, ~q2_back~0=v_~q2_back~0_549} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:46:52,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:46:52,149 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:52,149 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:52,149 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:52,150 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:52,150 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:52,150 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:52,376 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:46:52,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 645 [2022-12-06 05:46:52,377 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 230 transitions, 6188 flow [2022-12-06 05:46:52,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:52,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:52,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:52,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:52,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-06 05:46:52,584 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash -358280482, now seen corresponding path program 1 times [2022-12-06 05:46:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:52,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096087270] [2022-12-06 05:46:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:53,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:53,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096087270] [2022-12-06 05:46:53,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096087270] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:53,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103065940] [2022-12-06 05:46:53,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:53,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:53,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:53,447 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:46:53,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 05:46:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:53,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 05:46:53,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:53,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:46:53,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:46:53,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:46:53,621 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:46:53,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-06 05:46:53,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-12-06 05:46:53,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:46:53,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 05:46:53,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:46:53,873 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 05:46:53,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 20 [2022-12-06 05:46:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:53,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:54,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103065940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:54,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:54,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-06 05:46:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759397243] [2022-12-06 05:46:54,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:54,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 05:46:54,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:54,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 05:46:54,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-12-06 05:46:54,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:46:54,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 230 transitions, 6188 flow. Second operand has 21 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:54,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:54,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:46:54,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:58,210 INFO L130 PetriNetUnfolder]: 1055/2044 cut-off events. [2022-12-06 05:46:58,210 INFO L131 PetriNetUnfolder]: For 55970/55970 co-relation queries the response was YES. [2022-12-06 05:46:58,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22375 conditions, 2044 events. 1055/2044 cut-off events. For 55970/55970 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 12987 event pairs, 66 based on Foata normal form. 2/2042 useless extension candidates. Maximal degree in co-relation 22194. Up to 953 conditions per place. [2022-12-06 05:46:58,227 INFO L137 encePairwiseOnDemand]: 10/51 looper letters, 82 selfloop transitions, 228 changer transitions 16/326 dead transitions. [2022-12-06 05:46:58,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 326 transitions, 8290 flow [2022-12-06 05:46:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 05:46:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 05:46:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 163 transitions. [2022-12-06 05:46:58,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11020960108181203 [2022-12-06 05:46:58,228 INFO L175 Difference]: Start difference. First operand has 173 places, 230 transitions, 6188 flow. Second operand 29 states and 163 transitions. [2022-12-06 05:46:58,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 326 transitions, 8290 flow [2022-12-06 05:46:58,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 326 transitions, 8049 flow, removed 73 selfloop flow, removed 15 redundant places. [2022-12-06 05:46:58,379 INFO L231 Difference]: Finished difference. Result has 194 places, 268 transitions, 7547 flow [2022-12-06 05:46:58,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=6004, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=7547, PETRI_PLACES=194, PETRI_TRANSITIONS=268} [2022-12-06 05:46:58,379 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 172 predicate places. [2022-12-06 05:46:58,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:58,380 INFO L89 Accepts]: Start accepts. Operand has 194 places, 268 transitions, 7547 flow [2022-12-06 05:46:58,381 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:58,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:58,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 268 transitions, 7547 flow [2022-12-06 05:46:58,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 268 transitions, 7547 flow [2022-12-06 05:46:58,511 INFO L130 PetriNetUnfolder]: 403/1065 cut-off events. [2022-12-06 05:46:58,512 INFO L131 PetriNetUnfolder]: For 23966/23981 co-relation queries the response was YES. [2022-12-06 05:46:58,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10874 conditions, 1065 events. 403/1065 cut-off events. For 23966/23981 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7819 event pairs, 123 based on Foata normal form. 5/970 useless extension candidates. Maximal degree in co-relation 10731. Up to 378 conditions per place. [2022-12-06 05:46:58,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 268 transitions, 7547 flow [2022-12-06 05:46:58,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 05:46:58,558 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:58,558 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:58,558 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:58,558 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:58,558 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:58,558 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:58,558 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:58,558 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:58,558 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:58,559 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:58,559 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:58,559 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:59,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-06 05:46:59,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [908] L65-1-->L70: Formula: (let ((.cse0 (+ v_~q1_front~0_564 1)) (.cse2 (select |v_#memory_int_726| v_~q1~0.base_405)) (.cse1 (select |v_#memory_int_726| v_~q2~0.base_399))) (and (< v_~j~0_594 v_~N~0_402) (= (+ 2 v_~q1_back~0_666) v_~q1_back~0_664) (= v_~q1_front~0_563 .cse0) (= (+ v_~q2_back~0_613 1) v_~q2_back~0_612) (= (ite (= (select .cse1 (+ v_~q2~0.offset_399 (* 4 v_~q2_back~0_613))) v_~i~0_524) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_436|) (= (+ (select .cse2 (+ v_~q1~0.offset_405 (* v_~q1_front~0_564 4))) 1) v_~i~0_524) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_463| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_436| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_436|) (not (= (ite (= v_~j~0_595 (select .cse2 (+ (* v_~q1_back~0_666 4) v_~q1~0.offset_405))) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_back~0_613 v_~n2~0_394) (<= 0 v_~q2_back~0_613)) 1 0))) (not (= 0 (ite (and (<= 1 v_~q1_back~0_664) (< v_~q1_back~0_664 (+ v_~n1~0_386 1))) 1 0))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_436| 0)) (= v_~q2_front~0_584 (+ v_~q2_front~0_585 1)) (not (= (ite (and (< .cse0 v_~q1_back~0_664) (<= 0 v_~q1_front~0_564) (< v_~q1_front~0_564 v_~n1~0_386)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_585 v_~q2_back~0_612) (< v_~q2_front~0_585 v_~n2~0_394) (<= 0 v_~q2_front~0_585)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_463| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_463|) (< v_~j~0_595 v_~N~0_402) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_463| (ite (= v_~j~0_594 (select .cse2 (+ v_~q1~0.offset_405 (- 4) (* v_~q1_back~0_664 4)))) 1 0)) (= v_~j~0_594 (+ (select .cse1 (+ v_~q2~0.offset_399 (* v_~q2_front~0_585 4))) 1)) (< v_~i~0_524 v_~N~0_402))) InVars {~j~0=v_~j~0_595, ~q1~0.offset=v_~q1~0.offset_405, ~q1_front~0=v_~q1_front~0_564, ~n2~0=v_~n2~0_394, ~n1~0=v_~n1~0_386, ~q2~0.offset=v_~q2~0.offset_399, ~q2_front~0=v_~q2_front~0_585, ~N~0=v_~N~0_402, ~q1_back~0=v_~q1_back~0_666, ~q1~0.base=v_~q1~0.base_405, #memory_int=|v_#memory_int_726|, ~q2~0.base=v_~q2~0.base_399, ~q2_back~0=v_~q2_back~0_613} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_224|, ~j~0=v_~j~0_594, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_286|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_280|, ~q1_front~0=v_~q1_front~0_563, ~n1~0=v_~n1~0_386, ~q2~0.offset=v_~q2~0.offset_399, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_463|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_280|, ~q1_back~0=v_~q1_back~0_664, ~q1~0.base=v_~q1~0.base_405, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_436|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_274|, ~q2~0.base=v_~q2~0.base_399, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_268|, ~q2_back~0=v_~q2_back~0_612, ~q1~0.offset=v_~q1~0.offset_405, ~n2~0=v_~n2~0_394, ~i~0=v_~i~0_524, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_268|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_281|, ~q2_front~0=v_~q2_front~0_584, ~N~0=v_~N~0_402, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_281|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_463|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_436|, #memory_int=|v_#memory_int_726|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_224|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:46:59,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-06 05:46:59,985 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:47:00,050 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:47:00,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1672 [2022-12-06 05:47:00,051 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 265 transitions, 7553 flow [2022-12-06 05:47:00,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:00,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:00,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:00,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:00,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-06 05:47:00,258 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:00,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1025171729, now seen corresponding path program 1 times [2022-12-06 05:47:00,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:00,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343677208] [2022-12-06 05:47:00,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:00,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:00,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343677208] [2022-12-06 05:47:00,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343677208] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:00,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000184337] [2022-12-06 05:47:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:00,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:00,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:00,924 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:00,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 05:47:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:01,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 05:47:01,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:01,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:01,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:47:01,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:01,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-12-06 05:47:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:01,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:01,805 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-06 05:47:01,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 352 [2022-12-06 05:47:01,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:01,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-06 05:47:01,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:01,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-06 05:47:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:11,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000184337] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:11,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:11,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-06 05:47:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939100226] [2022-12-06 05:47:11,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:11,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 05:47:11,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:11,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 05:47:11,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-12-06 05:47:11,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:47:11,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 265 transitions, 7553 flow. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:11,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:11,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:47:11,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:14,173 INFO L130 PetriNetUnfolder]: 1189/2311 cut-off events. [2022-12-06 05:47:14,173 INFO L131 PetriNetUnfolder]: For 66070/66070 co-relation queries the response was YES. [2022-12-06 05:47:14,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26327 conditions, 2311 events. 1189/2311 cut-off events. For 66070/66070 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 15371 event pairs, 67 based on Foata normal form. 29/2336 useless extension candidates. Maximal degree in co-relation 26154. Up to 896 conditions per place. [2022-12-06 05:47:14,193 INFO L137 encePairwiseOnDemand]: 7/57 looper letters, 96 selfloop transitions, 266 changer transitions 19/381 dead transitions. [2022-12-06 05:47:14,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 381 transitions, 10636 flow [2022-12-06 05:47:14,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 05:47:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 05:47:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 177 transitions. [2022-12-06 05:47:14,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10350877192982456 [2022-12-06 05:47:14,194 INFO L175 Difference]: Start difference. First operand has 189 places, 265 transitions, 7553 flow. Second operand 30 states and 177 transitions. [2022-12-06 05:47:14,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 381 transitions, 10636 flow [2022-12-06 05:47:14,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 381 transitions, 10211 flow, removed 67 selfloop flow, removed 8 redundant places. [2022-12-06 05:47:14,404 INFO L231 Difference]: Finished difference. Result has 220 places, 321 transitions, 9781 flow [2022-12-06 05:47:14,405 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=7187, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=9781, PETRI_PLACES=220, PETRI_TRANSITIONS=321} [2022-12-06 05:47:14,405 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 198 predicate places. [2022-12-06 05:47:14,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:14,405 INFO L89 Accepts]: Start accepts. Operand has 220 places, 321 transitions, 9781 flow [2022-12-06 05:47:14,406 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:14,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:14,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 321 transitions, 9781 flow [2022-12-06 05:47:14,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 321 transitions, 9781 flow [2022-12-06 05:47:14,584 INFO L130 PetriNetUnfolder]: 439/1142 cut-off events. [2022-12-06 05:47:14,585 INFO L131 PetriNetUnfolder]: For 35242/35279 co-relation queries the response was YES. [2022-12-06 05:47:14,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13400 conditions, 1142 events. 439/1142 cut-off events. For 35242/35279 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 8459 event pairs, 120 based on Foata normal form. 7/1048 useless extension candidates. Maximal degree in co-relation 13239. Up to 421 conditions per place. [2022-12-06 05:47:14,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 321 transitions, 9781 flow [2022-12-06 05:47:14,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-06 05:47:14,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [915] L52-->L52: Formula: (and (= (+ (select (select |v_#memory_int_747| v_~q1~0.base_413) (+ v_~q1~0.offset_413 (* v_~q1_front~0_583 4))) 1) v_~i~0_543) (= (+ v_~q1_front~0_583 1) v_~q1_front~0_582) (= (+ v_~q2_back~0_642 1) v_~q2_back~0_641) (= (ite (= (select (select |v_#memory_int_747| v_~q2~0.base_414) (+ v_~q2~0.offset_414 (* 4 v_~q2_back~0_642))) v_~i~0_543) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_457|) (not (= (ite (and (< v_~q1_front~0_583 v_~n1~0_394) (< v_~q1_front~0_583 v_~q1_back~0_681) (<= 0 v_~q1_front~0_583)) 1 0) 0)) (< v_~i~0_543 v_~N~0_416) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_457| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_457| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_457|) (not (= (ite (and (<= 0 v_~q2_back~0_642) (< v_~q2_back~0_642 v_~n2~0_408)) 1 0) 0))) InVars {~q1~0.offset=v_~q1~0.offset_413, ~n2~0=v_~n2~0_408, ~q1_front~0=v_~q1_front~0_583, ~q1_back~0=v_~q1_back~0_681, ~q2~0.offset=v_~q2~0.offset_414, ~n1~0=v_~n1~0_394, ~q1~0.base=v_~q1~0.base_413, #memory_int=|v_#memory_int_747|, ~q2~0.base=v_~q2~0.base_414, ~N~0=v_~N~0_416, ~q2_back~0=v_~q2_back~0_642} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_240|, ~q1~0.offset=v_~q1~0.offset_413, ~n2~0=v_~n2~0_408, ~q1_front~0=v_~q1_front~0_582, ~i~0=v_~i~0_543, ~q2~0.offset=v_~q2~0.offset_414, ~n1~0=v_~n1~0_394, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_280|, ~N~0=v_~N~0_416, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_457|, ~q1_back~0=v_~q1_back~0_681, ~q1~0.base=v_~q1~0.base_413, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_457|, #memory_int=|v_#memory_int_747|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_286|, ~q2~0.base=v_~q2~0.base_414, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_280|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_240|, ~q2_back~0=v_~q2_back~0_641} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:47:14,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [915] L52-->L52: Formula: (and (= (+ (select (select |v_#memory_int_747| v_~q1~0.base_413) (+ v_~q1~0.offset_413 (* v_~q1_front~0_583 4))) 1) v_~i~0_543) (= (+ v_~q1_front~0_583 1) v_~q1_front~0_582) (= (+ v_~q2_back~0_642 1) v_~q2_back~0_641) (= (ite (= (select (select |v_#memory_int_747| v_~q2~0.base_414) (+ v_~q2~0.offset_414 (* 4 v_~q2_back~0_642))) v_~i~0_543) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_457|) (not (= (ite (and (< v_~q1_front~0_583 v_~n1~0_394) (< v_~q1_front~0_583 v_~q1_back~0_681) (<= 0 v_~q1_front~0_583)) 1 0) 0)) (< v_~i~0_543 v_~N~0_416) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_457| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_457| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_457|) (not (= (ite (and (<= 0 v_~q2_back~0_642) (< v_~q2_back~0_642 v_~n2~0_408)) 1 0) 0))) InVars {~q1~0.offset=v_~q1~0.offset_413, ~n2~0=v_~n2~0_408, ~q1_front~0=v_~q1_front~0_583, ~q1_back~0=v_~q1_back~0_681, ~q2~0.offset=v_~q2~0.offset_414, ~n1~0=v_~n1~0_394, ~q1~0.base=v_~q1~0.base_413, #memory_int=|v_#memory_int_747|, ~q2~0.base=v_~q2~0.base_414, ~N~0=v_~N~0_416, ~q2_back~0=v_~q2_back~0_642} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_240|, ~q1~0.offset=v_~q1~0.offset_413, ~n2~0=v_~n2~0_408, ~q1_front~0=v_~q1_front~0_582, ~i~0=v_~i~0_543, ~q2~0.offset=v_~q2~0.offset_414, ~n1~0=v_~n1~0_394, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_280|, ~N~0=v_~N~0_416, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_457|, ~q1_back~0=v_~q1_back~0_681, ~q1~0.base=v_~q1~0.base_413, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_457|, #memory_int=|v_#memory_int_747|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_286|, ~q2~0.base=v_~q2~0.base_414, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_280|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_240|, ~q2_back~0=v_~q2_back~0_641} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:47:14,979 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:47:16,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [911] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_734| v_~q1~0.base_409)) (.cse3 (* v_~q1_front~0_573 4)) (.cse5 (+ v_~q1_front~0_573 1))) (let ((.cse4 (< .cse5 v_~q1_back~0_674)) (.cse1 (+ (select .cse0 (+ .cse3 v_~q1~0.offset_409)) 1)) (.cse2 (select |v_#memory_int_734| v_~q2~0.base_405))) (and (not (= (ite (and (< v_~q2_back~0_625 v_~n2~0_400) (<= 0 v_~q2_back~0_625)) 1 0) 0)) (not (= (ite (= v_~j~0_605 (select .cse0 (+ v_~q1~0.offset_409 (* v_~q1_back~0_675 4)))) 1 0) 0)) (< .cse1 v_~N~0_408) (= v_~j~0_604 (+ (select .cse2 (+ v_~q2~0.offset_405 (* v_~q2_front~0_595 4))) 1)) (= (+ 2 v_~q1_front~0_573) v_~q1_front~0_571) (= (+ v_~q2_back~0_625 1) v_~q2_back~0_624) (= v_~q1_back~0_674 (+ 2 v_~q1_back~0_675)) (not (= (ite (and (<= 1 v_~q1_back~0_674) (< v_~q1_back~0_674 (+ v_~n1~0_390 1))) 1 0) 0)) (= (+ (select .cse0 (+ .cse3 v_~q1~0.offset_409 4)) 1) v_~i~0_530) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_442| (ite (and .cse4 (< .cse5 v_~n1~0_390) (<= 0 .cse5)) 1 0)) (not (= (ite (and (<= 0 v_~q1_front~0_573) .cse4 (< v_~q1_front~0_573 v_~n1~0_390)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_595 v_~q2_back~0_624) (< v_~q2_front~0_595 v_~n2~0_400) (<= 0 v_~q2_front~0_595)) 1 0) 0)) (< v_~j~0_605 v_~N~0_408) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_442| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_442|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471| (ite (= v_~j~0_604 (select .cse0 (+ (* v_~q1_back~0_674 4) v_~q1~0.offset_409 (- 4)))) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471| 0)) (= (+ v_~q2_front~0_595 1) v_~q2_front~0_594) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471|) (< v_~j~0_604 v_~N~0_408) (not (= (ite (= .cse1 (select .cse2 (+ v_~q2~0.offset_405 (* 4 v_~q2_back~0_625)))) 1 0) 0))))) InVars {~j~0=v_~j~0_605, ~q1~0.offset=v_~q1~0.offset_409, ~q1_front~0=v_~q1_front~0_573, ~n2~0=v_~n2~0_400, ~n1~0=v_~n1~0_390, ~q2~0.offset=v_~q2~0.offset_405, ~q2_front~0=v_~q2_front~0_595, ~N~0=v_~N~0_408, ~q1_back~0=v_~q1_back~0_675, ~q1~0.base=v_~q1~0.base_409, #memory_int=|v_#memory_int_734|, ~q2~0.base=v_~q2~0.base_405, ~q2_back~0=v_~q2_back~0_625} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_230|, ~j~0=v_~j~0_604, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_292|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_286|, ~q1_front~0=v_~q1_front~0_571, ~n1~0=v_~n1~0_390, ~q2~0.offset=v_~q2~0.offset_405, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_286|, ~q1_back~0=v_~q1_back~0_674, ~q1~0.base=v_~q1~0.base_409, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_278|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_442|, ~q2~0.base=v_~q2~0.base_405, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_272|, ~q2_back~0=v_~q2_back~0_624, ~q1~0.offset=v_~q1~0.offset_409, ~n2~0=v_~n2~0_400, ~i~0=v_~i~0_530, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_272|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_287|, ~q2_front~0=v_~q2_front~0_594, ~N~0=v_~N~0_408, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_287|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_442|, #memory_int=|v_#memory_int_734|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_230|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:47:16,470 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:47:16,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2066 [2022-12-06 05:47:16,471 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 318 transitions, 9793 flow [2022-12-06 05:47:16,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:16,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:16,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:16,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 05:47:16,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:16,672 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:16,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1989918511, now seen corresponding path program 1 times [2022-12-06 05:47:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:16,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154277245] [2022-12-06 05:47:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:17,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:17,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154277245] [2022-12-06 05:47:17,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154277245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:17,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799332949] [2022-12-06 05:47:17,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:17,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:17,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:17,897 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:17,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 05:47:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:18,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 05:47:18,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:18,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:18,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:18,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:18,110 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:47:18,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-06 05:47:18,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-12-06 05:47:18,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 05:47:18,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:18,230 INFO L321 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-12-06 05:47:18,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 34 [2022-12-06 05:47:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:18,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:20,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799332949] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:20,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:20,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 05:47:20,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293266547] [2022-12-06 05:47:20,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:20,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:47:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:20,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:47:20,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:47:20,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:47:20,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 318 transitions, 9793 flow. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:20,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:20,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:47:20,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:33,201 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 112 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:47:35,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:47:40,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:47:41,501 INFO L130 PetriNetUnfolder]: 1153/2204 cut-off events. [2022-12-06 05:47:41,501 INFO L131 PetriNetUnfolder]: For 76065/76065 co-relation queries the response was YES. [2022-12-06 05:47:41,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27704 conditions, 2204 events. 1153/2204 cut-off events. For 76065/76065 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 14208 event pairs, 60 based on Foata normal form. 13/2213 useless extension candidates. Maximal degree in co-relation 27526. Up to 1174 conditions per place. [2022-12-06 05:47:41,524 INFO L137 encePairwiseOnDemand]: 9/61 looper letters, 81 selfloop transitions, 276 changer transitions 17/374 dead transitions. [2022-12-06 05:47:41,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 374 transitions, 11316 flow [2022-12-06 05:47:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 05:47:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 05:47:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 148 transitions. [2022-12-06 05:47:41,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10109289617486339 [2022-12-06 05:47:41,526 INFO L175 Difference]: Start difference. First operand has 212 places, 318 transitions, 9793 flow. Second operand 24 states and 148 transitions. [2022-12-06 05:47:41,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 374 transitions, 11316 flow [2022-12-06 05:47:41,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 374 transitions, 10746 flow, removed 39 selfloop flow, removed 14 redundant places. [2022-12-06 05:47:41,862 INFO L231 Difference]: Finished difference. Result has 226 places, 328 transitions, 10166 flow [2022-12-06 05:47:41,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=9127, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=10166, PETRI_PLACES=226, PETRI_TRANSITIONS=328} [2022-12-06 05:47:41,863 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 204 predicate places. [2022-12-06 05:47:41,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:41,863 INFO L89 Accepts]: Start accepts. Operand has 226 places, 328 transitions, 10166 flow [2022-12-06 05:47:41,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:41,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:41,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 328 transitions, 10166 flow [2022-12-06 05:47:41,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 328 transitions, 10166 flow [2022-12-06 05:47:42,034 INFO L130 PetriNetUnfolder]: 443/1143 cut-off events. [2022-12-06 05:47:42,035 INFO L131 PetriNetUnfolder]: For 40542/40556 co-relation queries the response was YES. [2022-12-06 05:47:42,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14162 conditions, 1143 events. 443/1143 cut-off events. For 40542/40556 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8463 event pairs, 111 based on Foata normal form. 6/1046 useless extension candidates. Maximal degree in co-relation 14015. Up to 429 conditions per place. [2022-12-06 05:47:42,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 328 transitions, 10166 flow [2022-12-06 05:47:42,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-06 05:47:42,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:47:42,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L47-1-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_448| (ite (and (< v_~q1_front~0_578 v_~q1_back~0_678) (< v_~q1_front~0_578 v_~n1~0_392) (<= 0 v_~q1_front~0_578)) 1 0)) (not (= (ite (and (< v_~q2_back~0_633 v_~n2~0_404) (<= 0 v_~q2_back~0_633)) 1 0) 0)) (< v_~i~0_537 v_~N~0_412) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_448| 0)) (= (+ v_~q2_back~0_633 1) v_~q2_back~0_632) (= v_~q1_front~0_577 (+ v_~q1_front~0_578 1)) (not (= (ite (= v_~i~0_537 (select (select |v_#memory_int_740| v_~q2~0.base_409) (+ (* 4 v_~q2_back~0_633) v_~q2~0.offset_409))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_448| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_448|) (= v_~i~0_536 (+ (select (select |v_#memory_int_740| v_~q1~0.base_411) (+ (* v_~q1_front~0_578 4) v_~q1~0.offset_411)) 1))) InVars {~q1~0.offset=v_~q1~0.offset_411, ~q1_front~0=v_~q1_front~0_578, ~n2~0=v_~n2~0_404, ~q1_back~0=v_~q1_back~0_678, ~i~0=v_~i~0_537, ~n1~0=v_~n1~0_392, ~q2~0.offset=v_~q2~0.offset_409, ~q1~0.base=v_~q1~0.base_411, #memory_int=|v_#memory_int_740|, ~q2~0.base=v_~q2~0.base_409, ~N~0=v_~N~0_412, ~q2_back~0=v_~q2_back~0_633} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_234|, ~q1~0.offset=v_~q1~0.offset_411, ~q1_front~0=v_~q1_front~0_577, ~n2~0=v_~n2~0_404, ~i~0=v_~i~0_536, ~n1~0=v_~n1~0_392, ~q2~0.offset=v_~q2~0.offset_409, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_276|, ~N~0=v_~N~0_412, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_448|, ~q1_back~0=v_~q1_back~0_678, ~q1~0.base=v_~q1~0.base_411, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_282|, #memory_int=|v_#memory_int_740|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_448|, ~q2~0.base=v_~q2~0.base_409, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_276|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_234|, ~q2_back~0=v_~q2_back~0_632} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:47:42,318 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:42,319 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:42,319 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:42,319 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:42,319 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:42,319 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:43,650 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:43,650 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:43,650 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:43,650 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:43,650 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:43,650 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:44,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [921] L65-1-->L65-1: Formula: (let ((.cse1 (select |v_#memory_int_759| v_~q1~0.base_423)) (.cse2 (* v_~q1_front~0_603 4)) (.cse6 (+ v_~q1_front~0_603 1)) (.cse0 (select |v_#memory_int_759| v_~q2~0.base_426))) (let ((.cse4 (+ 1 (select .cse0 (+ v_~q2~0.offset_426 (* v_~q2_front~0_621 4))))) (.cse5 (< .cse6 v_~q1_back~0_699)) (.cse3 (+ (select .cse1 (+ .cse2 v_~q1~0.offset_423)) 1))) (and (not (= (ite (and (< v_~q1_back~0_699 (+ v_~n1~0_404 1)) (<= 1 v_~q1_back~0_699)) 1 0) 0)) (= v_~j~0_630 (+ (select .cse0 (+ (* v_~q2_front~0_619 4) v_~q2~0.offset_426 (- 4))) 1)) (< v_~j~0_632 v_~N~0_428) (= (+ (select .cse1 (+ .cse2 v_~q1~0.offset_423 4)) 1) v_~i~0_555) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_491| 0)) (not (= (ite (= v_~j~0_632 (select .cse1 (+ (* v_~q1_back~0_700 4) v_~q1~0.offset_423))) 1 0) 0)) (< .cse3 v_~N~0_428) (< .cse4 v_~N~0_428) (not (= (ite (and (<= 0 v_~q2_back~0_668) (< v_~q2_back~0_668 v_~n2~0_420)) 1 0) 0)) (not (= (ite (= .cse4 (select .cse1 (+ (* v_~q1_back~0_699 4) v_~q1~0.offset_423 (- 4)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_473| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_473|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_491| (ite (and (< v_~q2_front~0_619 (+ v_~n2~0_420 1)) (< v_~q2_front~0_619 (+ v_~q2_back~0_667 1)) (<= 1 v_~q2_front~0_619)) 1 0)) (= (+ 2 v_~q1_back~0_700) v_~q1_back~0_699) (= (ite (and .cse5 (< .cse6 v_~n1~0_404) (<= 0 .cse6)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_473|) (not (= (ite (and (<= 0 v_~q2_front~0_621) (< v_~q2_front~0_621 v_~n2~0_420) (< v_~q2_front~0_621 v_~q2_back~0_667)) 1 0) 0)) (= (+ v_~q2_back~0_668 1) v_~q2_back~0_667) (not (= (ite (and .cse5 (< v_~q1_front~0_603 v_~n1~0_404) (<= 0 v_~q1_front~0_603)) 1 0) 0)) (= v_~q2_front~0_619 (+ 2 v_~q2_front~0_621)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_491| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_491|) (not (= (ite (= (select .cse0 (+ v_~q2~0.offset_426 (* 4 v_~q2_back~0_668))) .cse3) 1 0) 0)) (= (+ 2 v_~q1_front~0_603) v_~q1_front~0_602)))) InVars {~j~0=v_~j~0_632, ~q1~0.offset=v_~q1~0.offset_423, ~n2~0=v_~n2~0_420, ~q1_front~0=v_~q1_front~0_603, ~q2~0.offset=v_~q2~0.offset_426, ~n1~0=v_~n1~0_404, ~q2_front~0=v_~q2_front~0_621, ~N~0=v_~N~0_428, ~q1_back~0=v_~q1_back~0_700, ~q1~0.base=v_~q1~0.base_423, #memory_int=|v_#memory_int_759|, ~q2~0.base=v_~q2~0.base_426, ~q2_back~0=v_~q2_back~0_668} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_254|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_308|, ~j~0=v_~j~0_630, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_302|, ~q1_front~0=v_~q1_front~0_602, ~q2~0.offset=v_~q2~0.offset_426, ~n1~0=v_~n1~0_404, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_491|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_302|, ~q1_back~0=v_~q1_back~0_699, ~q1~0.base=v_~q1~0.base_423, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_296|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_473|, ~q2~0.base=v_~q2~0.base_426, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_290|, ~q2_back~0=v_~q2_back~0_667, ~q1~0.offset=v_~q1~0.offset_423, ~n2~0=v_~n2~0_420, ~i~0=v_~i~0_555, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_290|, ~q2_front~0=v_~q2_front~0_619, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_299|, ~N~0=v_~N~0_428, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_299|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_491|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_473|, #memory_int=|v_#memory_int_759|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_254|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:47:44,969 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:44,970 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:44,970 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:44,970 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:44,970 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:44,970 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:44,970 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:44,970 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:45,665 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [910] L65-1-->L65-1: Formula: (let ((.cse2 (select |v_#memory_int_732| v_~q2~0.base_403))) (let ((.cse0 (+ (select .cse2 (+ v_~q2~0.offset_403 (* v_~q2_front~0_590 4))) 1)) (.cse3 (+ v_~q1_front~0_568 1)) (.cse1 (select |v_#memory_int_732| v_~q1~0.base_407))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467| 0)) (< v_~j~0_600 v_~N~0_406) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_440| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_440|) (not (= (ite (= .cse0 (select .cse1 (+ (* v_~q1_back~0_670 4) v_~q1~0.offset_407 (- 4)))) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_670 (+ v_~n1~0_388 1)) (<= 1 v_~q1_back~0_670)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_590 v_~q2_back~0_620) (<= 0 v_~q2_front~0_590) (< v_~q2_front~0_590 v_~n2~0_398)) 1 0) 0)) (= v_~j~0_598 (+ (select .cse2 (+ v_~q2~0.offset_403 (* v_~q2_front~0_588 4) (- 4))) 1)) (= (+ 2 v_~q2_front~0_590) v_~q2_front~0_588) (< .cse0 v_~N~0_406) (= (ite (= (select .cse2 (+ (* 4 v_~q2_back~0_621) v_~q2~0.offset_403)) v_~i~0_528) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_440|) (not (= (ite (and (< .cse3 v_~q1_back~0_670) (< v_~q1_front~0_568 v_~n1~0_388) (<= 0 v_~q1_front~0_568)) 1 0) 0)) (not (= (ite (and (<= 0 v_~q2_back~0_621) (< v_~q2_back~0_621 v_~n2~0_398)) 1 0) 0)) (= (+ v_~q2_back~0_621 1) v_~q2_back~0_620) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_440| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| (ite (and (< v_~q2_front~0_588 (+ v_~q2_back~0_620 1)) (< v_~q2_front~0_588 (+ v_~n2~0_398 1)) (<= 1 v_~q2_front~0_588)) 1 0)) (= .cse3 v_~q1_front~0_567) (= (+ (select .cse1 (+ v_~q1~0.offset_407 (* v_~q1_front~0_568 4))) 1) v_~i~0_528) (< v_~i~0_528 v_~N~0_406) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|) (= (+ 2 v_~q1_back~0_671) v_~q1_back~0_670) (not (= (ite (= v_~j~0_600 (select .cse1 (+ v_~q1~0.offset_407 (* v_~q1_back~0_671 4)))) 1 0) 0))))) InVars {~j~0=v_~j~0_600, ~q1~0.offset=v_~q1~0.offset_407, ~n2~0=v_~n2~0_398, ~q1_front~0=v_~q1_front~0_568, ~q2~0.offset=v_~q2~0.offset_403, ~n1~0=v_~n1~0_388, ~q2_front~0=v_~q2_front~0_590, ~N~0=v_~N~0_406, ~q1_back~0=v_~q1_back~0_671, ~q1~0.base=v_~q1~0.base_407, #memory_int=|v_#memory_int_732|, ~q2~0.base=v_~q2~0.base_403, ~q2_back~0=v_~q2_back~0_621} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_228|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_288|, ~j~0=v_~j~0_598, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_282|, ~q1_front~0=v_~q1_front~0_567, ~q2~0.offset=v_~q2~0.offset_403, ~n1~0=v_~n1~0_388, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_282|, ~q1_back~0=v_~q1_back~0_670, ~q1~0.base=v_~q1~0.base_407, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_440|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_276|, ~q2~0.base=v_~q2~0.base_403, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_270|, ~q2_back~0=v_~q2_back~0_620, ~q1~0.offset=v_~q1~0.offset_407, ~n2~0=v_~n2~0_398, ~i~0=v_~i~0_528, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_270|, ~q2_front~0=v_~q2_front~0_588, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_285|, ~N~0=v_~N~0_406, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_285|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_440|, #memory_int=|v_#memory_int_732|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_228|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:47:46,247 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:46,247 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:46,248 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:46,248 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:46,248 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:46,248 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:48,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] L65-1-->L70: Formula: (let ((.cse3 (select |v_#memory_int_780| v_~q2~0.base_442))) (let ((.cse0 (+ (select .cse3 (+ (* v_~q2_front~0_660 4) v_~q2~0.offset_442)) 1)) (.cse2 (* v_~q1_back~0_735 4)) (.cse1 (select |v_#memory_int_780| v_~q1~0.base_441))) (and (= (+ 2 v_~q2_front~0_660) v_~q2_front~0_659) (= (+ 3 v_~q1_back~0_737) v_~q1_back~0_735) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_517| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_517|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_504| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_504|) (< v_~i~0_582 v_~N~0_446) (< .cse0 v_~N~0_446) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_517| 0)) (not (= (ite (and (<= 0 v_~q2_front~0_660) (< v_~q2_front~0_660 v_~n2~0_436) (< v_~q2_front~0_660 v_~q2_back~0_704)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q1~0.offset_441 (- 8))) .cse0) 1 0) 0)) (= (+ v_~q2_back~0_705 1) v_~q2_back~0_704) (= v_~q1_front~0_645 (+ v_~q1_front~0_646 1)) (not (= (ite (and (< v_~q1_back~0_735 (+ v_~n1~0_422 1)) (<= 1 v_~q1_back~0_735)) 1 0) 0)) (< v_~j~0_669 v_~N~0_446) (not (= (ite (and (<= 1 v_~q2_front~0_659) (< v_~q2_front~0_659 (+ v_~q2_back~0_704 1)) (< v_~q2_front~0_659 (+ v_~n2~0_436 1))) 1 0) 0)) (< v_~j~0_670 v_~N~0_446) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_504| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_504| (ite (= (select .cse3 (+ (* 4 v_~q2_back~0_705) v_~q2~0.offset_442)) v_~i~0_582) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_517| (ite (= v_~j~0_669 (select .cse1 (+ .cse2 v_~q1~0.offset_441 (- 4)))) 1 0)) (not (= (ite (and (<= 0 v_~q1_front~0_646) (< v_~q1_front~0_646 v_~n1~0_422) (< (+ 2 v_~q1_front~0_646) v_~q1_back~0_735)) 1 0) 0)) (not (= (ite (= v_~j~0_670 (select .cse1 (+ v_~q1~0.offset_441 (* v_~q1_back~0_737 4)))) 1 0) 0)) (not (= (ite (and (< v_~q2_back~0_705 v_~n2~0_436) (<= 0 v_~q2_back~0_705)) 1 0) 0)) (= (+ (select .cse1 (+ v_~q1~0.offset_441 (* v_~q1_front~0_646 4))) 1) v_~i~0_582) (= v_~j~0_669 (+ (select .cse3 (+ (* v_~q2_front~0_659 4) v_~q2~0.offset_442 (- 4))) 1))))) InVars {~j~0=v_~j~0_670, ~q1~0.offset=v_~q1~0.offset_441, ~q1_front~0=v_~q1_front~0_646, ~n2~0=v_~n2~0_436, ~n1~0=v_~n1~0_422, ~q2~0.offset=v_~q2~0.offset_442, ~q2_front~0=v_~q2_front~0_660, ~N~0=v_~N~0_446, ~q1_back~0=v_~q1_back~0_737, ~q1~0.base=v_~q1~0.base_441, #memory_int=|v_#memory_int_780|, ~q2~0.base=v_~q2~0.base_442, ~q2_back~0=v_~q2_back~0_705} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_275|, ~j~0=v_~j~0_669, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_332|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_326|, ~q1_front~0=v_~q1_front~0_645, ~n1~0=v_~n1~0_422, ~q2~0.offset=v_~q2~0.offset_442, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_517|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_326|, ~q1_back~0=v_~q1_back~0_735, ~q1~0.base=v_~q1~0.base_441, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_504|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_322|, ~q2~0.base=v_~q2~0.base_442, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_316|, ~q2_back~0=v_~q2_back~0_704, ~q1~0.offset=v_~q1~0.offset_441, ~n2~0=v_~n2~0_436, ~i~0=v_~i~0_582, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_316|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_317|, ~q2_front~0=v_~q2_front~0_659, ~N~0=v_~N~0_446, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_317|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_517|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_504|, #memory_int=|v_#memory_int_780|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_275|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:47:49,147 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:47:49,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7284 [2022-12-06 05:47:49,148 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 327 transitions, 10377 flow [2022-12-06 05:47:49,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:49,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:49,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:49,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:49,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:49,348 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:49,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1473012522, now seen corresponding path program 1 times [2022-12-06 05:47:49,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:49,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488275264] [2022-12-06 05:47:49,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:49,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:49,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488275264] [2022-12-06 05:47:49,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488275264] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:49,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965950614] [2022-12-06 05:47:49,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:49,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:49,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:49,419 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:49,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 05:47:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:49,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:47:49,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:49,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:47:49,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965950614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:49,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:47:49,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 05:47:49,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866284615] [2022-12-06 05:47:49,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:49,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:49,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:49,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:49,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:47:49,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 05:47:49,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 327 transitions, 10377 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:49,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:49,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 05:47:49,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:50,335 INFO L130 PetriNetUnfolder]: 1440/2780 cut-off events. [2022-12-06 05:47:50,335 INFO L131 PetriNetUnfolder]: For 113642/113642 co-relation queries the response was YES. [2022-12-06 05:47:50,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36398 conditions, 2780 events. 1440/2780 cut-off events. For 113642/113642 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 18343 event pairs, 651 based on Foata normal form. 78/2854 useless extension candidates. Maximal degree in co-relation 36186. Up to 1737 conditions per place. [2022-12-06 05:47:50,363 INFO L137 encePairwiseOnDemand]: 50/66 looper letters, 378 selfloop transitions, 7 changer transitions 32/417 dead transitions. [2022-12-06 05:47:50,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 417 transitions, 13606 flow [2022-12-06 05:47:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-12-06 05:47:50,364 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2022-12-06 05:47:50,365 INFO L175 Difference]: Start difference. First operand has 220 places, 327 transitions, 10377 flow. Second operand 4 states and 100 transitions. [2022-12-06 05:47:50,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 417 transitions, 13606 flow [2022-12-06 05:47:50,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 417 transitions, 13371 flow, removed 74 selfloop flow, removed 12 redundant places. [2022-12-06 05:47:50,820 INFO L231 Difference]: Finished difference. Result has 212 places, 294 transitions, 9083 flow [2022-12-06 05:47:50,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=9613, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9083, PETRI_PLACES=212, PETRI_TRANSITIONS=294} [2022-12-06 05:47:50,821 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 190 predicate places. [2022-12-06 05:47:50,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:50,821 INFO L89 Accepts]: Start accepts. Operand has 212 places, 294 transitions, 9083 flow [2022-12-06 05:47:50,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:50,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:50,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 294 transitions, 9083 flow [2022-12-06 05:47:50,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 294 transitions, 9083 flow [2022-12-06 05:47:51,041 INFO L130 PetriNetUnfolder]: 542/1419 cut-off events. [2022-12-06 05:47:51,041 INFO L131 PetriNetUnfolder]: For 45783/45804 co-relation queries the response was YES. [2022-12-06 05:47:51,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17075 conditions, 1419 events. 542/1419 cut-off events. For 45783/45804 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10850 event pairs, 149 based on Foata normal form. 6/1295 useless extension candidates. Maximal degree in co-relation 16799. Up to 525 conditions per place. [2022-12-06 05:47:51,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 294 transitions, 9083 flow [2022-12-06 05:47:51,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-06 05:47:53,064 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,064 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,064 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,064 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,065 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,065 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,065 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,065 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,065 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,065 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,065 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,065 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,639 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,640 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,640 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,640 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,640 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,640 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,640 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,640 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,640 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,640 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,640 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:53,641 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:54,257 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:54,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3437 [2022-12-06 05:47:54,258 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 295 transitions, 9169 flow [2022-12-06 05:47:54,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:54,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:54,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:54,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-06 05:47:54,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-06 05:47:54,463 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash 329410655, now seen corresponding path program 1 times [2022-12-06 05:47:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:54,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538882869] [2022-12-06 05:47:54,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:54,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:55,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538882869] [2022-12-06 05:47:55,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538882869] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:55,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391612585] [2022-12-06 05:47:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:55,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:55,038 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:55,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 05:47:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:55,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 05:47:55,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:55,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:55,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:55,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:55,221 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:47:55,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-06 05:47:55,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 05:47:55,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-12-06 05:47:55,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:55,357 INFO L321 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2022-12-06 05:47:55,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 34 [2022-12-06 05:47:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:55,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:56,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391612585] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:56,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:56,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:47:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386183836] [2022-12-06 05:47:56,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:56,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:47:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:56,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:47:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:47:56,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:47:56,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 295 transitions, 9169 flow. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:56,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:56,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:47:56,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:58,400 INFO L130 PetriNetUnfolder]: 1391/2694 cut-off events. [2022-12-06 05:47:58,400 INFO L131 PetriNetUnfolder]: For 97964/97964 co-relation queries the response was YES. [2022-12-06 05:47:58,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34554 conditions, 2694 events. 1391/2694 cut-off events. For 97964/97964 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17803 event pairs, 148 based on Foata normal form. 7/2697 useless extension candidates. Maximal degree in co-relation 34148. Up to 1822 conditions per place. [2022-12-06 05:47:58,425 INFO L137 encePairwiseOnDemand]: 18/61 looper letters, 126 selfloop transitions, 191 changer transitions 15/332 dead transitions. [2022-12-06 05:47:58,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 332 transitions, 10196 flow [2022-12-06 05:47:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:47:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:47:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 121 transitions. [2022-12-06 05:47:58,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11020036429872496 [2022-12-06 05:47:58,427 INFO L175 Difference]: Start difference. First operand has 207 places, 295 transitions, 9169 flow. Second operand 18 states and 121 transitions. [2022-12-06 05:47:58,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 332 transitions, 10196 flow [2022-12-06 05:47:58,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 332 transitions, 9963 flow, removed 35 selfloop flow, removed 8 redundant places. [2022-12-06 05:47:58,776 INFO L231 Difference]: Finished difference. Result has 222 places, 290 transitions, 9197 flow [2022-12-06 05:47:58,776 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=8776, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=9197, PETRI_PLACES=222, PETRI_TRANSITIONS=290} [2022-12-06 05:47:58,776 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 200 predicate places. [2022-12-06 05:47:58,776 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:58,777 INFO L89 Accepts]: Start accepts. Operand has 222 places, 290 transitions, 9197 flow [2022-12-06 05:47:58,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:58,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:58,778 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 290 transitions, 9197 flow [2022-12-06 05:47:58,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 290 transitions, 9197 flow [2022-12-06 05:47:58,938 INFO L130 PetriNetUnfolder]: 431/1142 cut-off events. [2022-12-06 05:47:58,938 INFO L131 PetriNetUnfolder]: For 35200/35215 co-relation queries the response was YES. [2022-12-06 05:47:58,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13663 conditions, 1142 events. 431/1142 cut-off events. For 35200/35215 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8537 event pairs, 134 based on Foata normal form. 6/1043 useless extension candidates. Maximal degree in co-relation 13505. Up to 425 conditions per place. [2022-12-06 05:47:58,955 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 290 transitions, 9197 flow [2022-12-06 05:47:58,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-06 05:47:59,038 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:59,038 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:59,038 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:59,038 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:59,038 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:59,038 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:59,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [948] L65-1-->L52: Formula: (let ((.cse0 (select |v_#memory_int_805| v_~q1~0.base_463))) (let ((.cse1 (* v_~q1_back~0_780 4)) (.cse2 (+ (select .cse0 (+ (* v_~q1_front~0_696 4) v_~q1~0.offset_463)) 1)) (.cse4 (select |v_#memory_int_805| v_~q2~0.base_464)) (.cse5 (* 4 v_~q2_back~0_756))) (and (< v_~j~0_707 v_~N~0_468) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_543| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_543|) (= (+ (select .cse0 (+ v_~q1~0.offset_463 (- 4) (* v_~q1_front~0_695 4))) 1) v_~i~0_613) (not (= (ite (= v_~j~0_707 (select .cse0 (+ .cse1 v_~q1~0.offset_463))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_543| 0)) (< .cse2 v_~N~0_468) (< v_~i~0_613 v_~N~0_468) (= (ite (= v_~j~0_706 (select .cse0 (+ .cse1 v_~q1~0.offset_463 4))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_543|) (= (+ 2 v_~q1_back~0_780) v_~q1_back~0_779) (not (= (ite (and (<= 0 v_~q1_front~0_696) (< v_~q1_front~0_696 v_~n1~0_444) (< v_~q1_front~0_696 v_~q1_back~0_779)) 1 0) 0)) (not (= (ite (let ((.cse3 (+ v_~q1_back~0_780 1))) (and (< .cse3 v_~n1~0_444) (<= 0 .cse3))) 1 0) 0)) (= (+ 2 v_~q1_front~0_696) v_~q1_front~0_695) (= v_~q2_front~0_701 (+ v_~q2_front~0_702 1)) (= v_~j~0_706 (+ (select .cse4 (+ v_~q2~0.offset_464 (* v_~q2_front~0_702 4))) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_543| (ite (= (select .cse4 (+ v_~q2~0.offset_464 .cse5 4)) v_~i~0_613) 1 0)) (not (= (ite (and (< v_~q2_front~0_702 v_~n2~0_458) (<= 0 v_~q2_front~0_702) (< v_~q2_front~0_702 v_~q2_back~0_756)) 1 0) 0)) (not (= (ite (let ((.cse6 (+ v_~q2_back~0_756 1))) (and (< .cse6 v_~n2~0_458) (<= 0 .cse6))) 1 0) 0)) (< v_~j~0_706 v_~N~0_468) (not (= (ite (and (<= 1 v_~q1_front~0_695) (< v_~q1_front~0_695 (+ v_~n1~0_444 1)) (< v_~q1_front~0_695 (+ v_~q1_back~0_779 1))) 1 0) 0)) (= (+ 2 v_~q2_back~0_756) v_~q2_back~0_754) (not (= (ite (= .cse2 (select .cse4 (+ v_~q2~0.offset_464 .cse5))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_543| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_543|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_543| 0))))) InVars {~j~0=v_~j~0_707, ~q1~0.offset=v_~q1~0.offset_463, ~n2~0=v_~n2~0_458, ~q1_front~0=v_~q1_front~0_696, ~q2~0.offset=v_~q2~0.offset_464, ~n1~0=v_~n1~0_444, ~q2_front~0=v_~q2_front~0_702, ~N~0=v_~N~0_468, ~q1_back~0=v_~q1_back~0_780, ~q1~0.base=v_~q1~0.base_463, #memory_int=|v_#memory_int_805|, ~q2~0.base=v_~q2~0.base_464, ~q2_back~0=v_~q2_back~0_756} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_302|, ~j~0=v_~j~0_706, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_354|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_348|, ~q1_front~0=v_~q1_front~0_695, ~q2~0.offset=v_~q2~0.offset_464, ~n1~0=v_~n1~0_444, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_543|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_348|, ~q1_back~0=v_~q1_back~0_779, ~q1~0.base=v_~q1~0.base_463, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_543|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_352|, ~q2~0.base=v_~q2~0.base_464, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_346|, ~q2_back~0=v_~q2_back~0_754, ~q1~0.offset=v_~q1~0.offset_463, ~n2~0=v_~n2~0_458, ~i~0=v_~i~0_613, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_346|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_339|, ~q2_front~0=v_~q2_front~0_701, ~N~0=v_~N~0_468, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_339|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_543|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_543|, #memory_int=|v_#memory_int_805|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_302|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [946] L70-->L70: Formula: (and (= (+ v_~q2_front~0_698 1) v_~q2_front~0_697) (= (ite (= v_~j~0_704 (select (select |v_#memory_int_803| v_~q1~0.base_461) (+ (* v_~q1_back~0_776 4) v_~q1~0.offset_461))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_539|) (not (= (ite (and (<= 0 v_~q1_back~0_776) (< v_~q1_back~0_776 v_~n1~0_442)) 1 0) 0)) (= v_~j~0_704 (+ (select (select |v_#memory_int_803| v_~q2~0.base_462) (+ (* v_~q2_front~0_698 4) v_~q2~0.offset_462)) 1)) (= (+ v_~q1_back~0_776 1) v_~q1_back~0_775) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_539| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_539|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_539| 0)) (< v_~j~0_704 v_~N~0_466) (not (= (ite (and (< v_~q2_front~0_698 v_~n2~0_456) (<= 0 v_~q2_front~0_698) (< v_~q2_front~0_698 v_~q2_back~0_752)) 1 0) 0))) InVars {~q1~0.offset=v_~q1~0.offset_461, ~n2~0=v_~n2~0_456, ~q1_back~0=v_~q1_back~0_776, ~n1~0=v_~n1~0_442, ~q2~0.offset=v_~q2~0.offset_462, ~q1~0.base=v_~q1~0.base_461, #memory_int=|v_#memory_int_803|, ~q2_front~0=v_~q2_front~0_698, ~q2~0.base=v_~q2~0.base_462, ~N~0=v_~N~0_466, ~q2_back~0=v_~q2_back~0_752} OutVars{~j~0=v_~j~0_704, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_352|, ~q1~0.offset=v_~q1~0.offset_461, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_346|, ~n2~0=v_~n2~0_456, ~n1~0=v_~n1~0_442, ~q2~0.offset=v_~q2~0.offset_462, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_539|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_337|, ~q2_front~0=v_~q2_front~0_697, ~N~0=v_~N~0_466, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_337|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_346|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_539|, ~q1_back~0=v_~q1_back~0_775, ~q1~0.base=v_~q1~0.base_461, #memory_int=|v_#memory_int_803|, ~q2~0.base=v_~q2~0.base_462, ~q2_back~0=v_~q2_back~0_752} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:48:00,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [948] L65-1-->L52: Formula: (let ((.cse0 (select |v_#memory_int_805| v_~q1~0.base_463))) (let ((.cse1 (* v_~q1_back~0_780 4)) (.cse2 (+ (select .cse0 (+ (* v_~q1_front~0_696 4) v_~q1~0.offset_463)) 1)) (.cse4 (select |v_#memory_int_805| v_~q2~0.base_464)) (.cse5 (* 4 v_~q2_back~0_756))) (and (< v_~j~0_707 v_~N~0_468) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_543| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_543|) (= (+ (select .cse0 (+ v_~q1~0.offset_463 (- 4) (* v_~q1_front~0_695 4))) 1) v_~i~0_613) (not (= (ite (= v_~j~0_707 (select .cse0 (+ .cse1 v_~q1~0.offset_463))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_543| 0)) (< .cse2 v_~N~0_468) (< v_~i~0_613 v_~N~0_468) (= (ite (= v_~j~0_706 (select .cse0 (+ .cse1 v_~q1~0.offset_463 4))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_543|) (= (+ 2 v_~q1_back~0_780) v_~q1_back~0_779) (not (= (ite (and (<= 0 v_~q1_front~0_696) (< v_~q1_front~0_696 v_~n1~0_444) (< v_~q1_front~0_696 v_~q1_back~0_779)) 1 0) 0)) (not (= (ite (let ((.cse3 (+ v_~q1_back~0_780 1))) (and (< .cse3 v_~n1~0_444) (<= 0 .cse3))) 1 0) 0)) (= (+ 2 v_~q1_front~0_696) v_~q1_front~0_695) (= v_~q2_front~0_701 (+ v_~q2_front~0_702 1)) (= v_~j~0_706 (+ (select .cse4 (+ v_~q2~0.offset_464 (* v_~q2_front~0_702 4))) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_543| (ite (= (select .cse4 (+ v_~q2~0.offset_464 .cse5 4)) v_~i~0_613) 1 0)) (not (= (ite (and (< v_~q2_front~0_702 v_~n2~0_458) (<= 0 v_~q2_front~0_702) (< v_~q2_front~0_702 v_~q2_back~0_756)) 1 0) 0)) (not (= (ite (let ((.cse6 (+ v_~q2_back~0_756 1))) (and (< .cse6 v_~n2~0_458) (<= 0 .cse6))) 1 0) 0)) (< v_~j~0_706 v_~N~0_468) (not (= (ite (and (<= 1 v_~q1_front~0_695) (< v_~q1_front~0_695 (+ v_~n1~0_444 1)) (< v_~q1_front~0_695 (+ v_~q1_back~0_779 1))) 1 0) 0)) (= (+ 2 v_~q2_back~0_756) v_~q2_back~0_754) (not (= (ite (= .cse2 (select .cse4 (+ v_~q2~0.offset_464 .cse5))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_543| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_543|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_543| 0))))) InVars {~j~0=v_~j~0_707, ~q1~0.offset=v_~q1~0.offset_463, ~n2~0=v_~n2~0_458, ~q1_front~0=v_~q1_front~0_696, ~q2~0.offset=v_~q2~0.offset_464, ~n1~0=v_~n1~0_444, ~q2_front~0=v_~q2_front~0_702, ~N~0=v_~N~0_468, ~q1_back~0=v_~q1_back~0_780, ~q1~0.base=v_~q1~0.base_463, #memory_int=|v_#memory_int_805|, ~q2~0.base=v_~q2~0.base_464, ~q2_back~0=v_~q2_back~0_756} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_302|, ~j~0=v_~j~0_706, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_354|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_348|, ~q1_front~0=v_~q1_front~0_695, ~q2~0.offset=v_~q2~0.offset_464, ~n1~0=v_~n1~0_444, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_543|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_348|, ~q1_back~0=v_~q1_back~0_779, ~q1~0.base=v_~q1~0.base_463, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_543|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_352|, ~q2~0.base=v_~q2~0.base_464, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_346|, ~q2_back~0=v_~q2_back~0_754, ~q1~0.offset=v_~q1~0.offset_463, ~n2~0=v_~n2~0_458, ~i~0=v_~i~0_613, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_346|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_339|, ~q2_front~0=v_~q2_front~0_701, ~N~0=v_~N~0_468, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_339|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_543|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_543|, #memory_int=|v_#memory_int_805|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_302|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-06 05:48:01,033 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:48:01,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2269 [2022-12-06 05:48:01,045 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 289 transitions, 9228 flow [2022-12-06 05:48:01,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:01,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:01,046 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:01,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 05:48:01,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 05:48:01,252 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash -900429502, now seen corresponding path program 1 times [2022-12-06 05:48:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:01,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83040985] [2022-12-06 05:48:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:01,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:02,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:02,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83040985] [2022-12-06 05:48:02,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83040985] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:02,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791887287] [2022-12-06 05:48:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:02,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:02,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:02,064 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:48:02,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 05:48:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:02,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 05:48:02,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:02,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:48:02,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:48:02,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:48:02,278 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:48:02,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-06 05:48:02,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-12-06 05:48:02,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:48:02,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 05:48:02,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:48:02,414 INFO L321 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-12-06 05:48:02,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 34 [2022-12-06 05:48:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:02,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:05,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791887287] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:05,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:05,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:48:05,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129264695] [2022-12-06 05:48:05,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:05,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:48:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:05,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:48:05,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:48:05,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 05:48:05,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 289 transitions, 9228 flow. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:05,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:05,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 05:48:05,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:08,592 INFO L130 PetriNetUnfolder]: 1082/2123 cut-off events. [2022-12-06 05:48:08,592 INFO L131 PetriNetUnfolder]: For 72495/72495 co-relation queries the response was YES. [2022-12-06 05:48:08,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27078 conditions, 2123 events. 1082/2123 cut-off events. For 72495/72495 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13606 event pairs, 62 based on Foata normal form. 8/2127 useless extension candidates. Maximal degree in co-relation 26925. Up to 1048 conditions per place. [2022-12-06 05:48:08,614 INFO L137 encePairwiseOnDemand]: 9/60 looper letters, 96 selfloop transitions, 244 changer transitions 16/356 dead transitions. [2022-12-06 05:48:08,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 356 transitions, 10643 flow [2022-12-06 05:48:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 05:48:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 05:48:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 161 transitions. [2022-12-06 05:48:08,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1032051282051282 [2022-12-06 05:48:08,617 INFO L175 Difference]: Start difference. First operand has 219 places, 289 transitions, 9228 flow. Second operand 26 states and 161 transitions. [2022-12-06 05:48:08,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 356 transitions, 10643 flow [2022-12-06 05:48:08,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 356 transitions, 10219 flow, removed 18 selfloop flow, removed 17 redundant places. [2022-12-06 05:48:09,006 INFO L231 Difference]: Finished difference. Result has 228 places, 289 transitions, 9257 flow [2022-12-06 05:48:09,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=8647, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=9257, PETRI_PLACES=228, PETRI_TRANSITIONS=289} [2022-12-06 05:48:09,008 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 206 predicate places. [2022-12-06 05:48:09,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:09,008 INFO L89 Accepts]: Start accepts. Operand has 228 places, 289 transitions, 9257 flow [2022-12-06 05:48:09,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:09,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:09,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 289 transitions, 9257 flow [2022-12-06 05:48:09,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 289 transitions, 9257 flow [2022-12-06 05:48:09,168 INFO L130 PetriNetUnfolder]: 419/1114 cut-off events. [2022-12-06 05:48:09,168 INFO L131 PetriNetUnfolder]: For 34365/34425 co-relation queries the response was YES. [2022-12-06 05:48:09,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13436 conditions, 1114 events. 419/1114 cut-off events. For 34365/34425 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8203 event pairs, 123 based on Foata normal form. 7/1021 useless extension candidates. Maximal degree in co-relation 13280. Up to 414 conditions per place. [2022-12-06 05:48:09,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 289 transitions, 9257 flow [2022-12-06 05:48:09,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-06 05:48:09,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:48:09,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 311 [2022-12-06 05:48:09,319 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 288 transitions, 9236 flow [2022-12-06 05:48:09,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:09,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:09,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:09,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 05:48:09,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 05:48:09,525 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:09,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:09,526 INFO L85 PathProgramCache]: Analyzing trace with hash -817312612, now seen corresponding path program 2 times [2022-12-06 05:48:09,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:09,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062196623] [2022-12-06 05:48:09,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:09,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:10,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:10,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062196623] [2022-12-06 05:48:10,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062196623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:10,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100294160] [2022-12-06 05:48:10,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:48:10,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:10,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:10,117 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:48:10,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 05:48:10,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:48:10,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:48:10,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 05:48:10,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:10,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:48:10,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:48:10,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:48:10,368 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:48:10,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-06 05:48:10,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-12-06 05:48:10,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 05:48:10,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:48:10,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:10,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 31 [2022-12-06 05:48:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:10,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:11,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100294160] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:11,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:11,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:48:11,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60047403] [2022-12-06 05:48:11,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:11,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:48:11,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:11,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:48:11,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:48:11,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 05:48:11,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 288 transitions, 9236 flow. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:11,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:11,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 05:48:11,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:13,517 INFO L130 PetriNetUnfolder]: 1054/2058 cut-off events. [2022-12-06 05:48:13,517 INFO L131 PetriNetUnfolder]: For 68607/68607 co-relation queries the response was YES. [2022-12-06 05:48:13,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26687 conditions, 2058 events. 1054/2058 cut-off events. For 68607/68607 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 12983 event pairs, 77 based on Foata normal form. 2/2056 useless extension candidates. Maximal degree in co-relation 26524. Up to 1116 conditions per place. [2022-12-06 05:48:13,535 INFO L137 encePairwiseOnDemand]: 9/59 looper letters, 71 selfloop transitions, 245 changer transitions 13/329 dead transitions. [2022-12-06 05:48:13,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 329 transitions, 10259 flow [2022-12-06 05:48:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 05:48:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 05:48:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 130 transitions. [2022-12-06 05:48:13,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11016949152542373 [2022-12-06 05:48:13,541 INFO L175 Difference]: Start difference. First operand has 225 places, 288 transitions, 9236 flow. Second operand 20 states and 130 transitions. [2022-12-06 05:48:13,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 329 transitions, 10259 flow [2022-12-06 05:48:13,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 329 transitions, 9802 flow, removed 56 selfloop flow, removed 18 redundant places. [2022-12-06 05:48:13,805 INFO L231 Difference]: Finished difference. Result has 230 places, 290 transitions, 9298 flow [2022-12-06 05:48:13,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=8793, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=9298, PETRI_PLACES=230, PETRI_TRANSITIONS=290} [2022-12-06 05:48:13,805 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 208 predicate places. [2022-12-06 05:48:13,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:13,805 INFO L89 Accepts]: Start accepts. Operand has 230 places, 290 transitions, 9298 flow [2022-12-06 05:48:13,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:13,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:13,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 290 transitions, 9298 flow [2022-12-06 05:48:13,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 290 transitions, 9298 flow [2022-12-06 05:48:13,977 INFO L130 PetriNetUnfolder]: 416/1084 cut-off events. [2022-12-06 05:48:13,977 INFO L131 PetriNetUnfolder]: For 36716/36730 co-relation queries the response was YES. [2022-12-06 05:48:13,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13535 conditions, 1084 events. 416/1084 cut-off events. For 36716/36730 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7848 event pairs, 102 based on Foata normal form. 4/990 useless extension candidates. Maximal degree in co-relation 13388. Up to 415 conditions per place. [2022-12-06 05:48:13,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 290 transitions, 9298 flow [2022-12-06 05:48:13,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-06 05:48:13,996 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:13,996 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,138 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [904] L70-->L47-1: Formula: (and (= v_~q1_front~0_552 (+ v_~q1_front~0_553 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_454| 0)) (= (+ (select (select |v_#memory_int_719| v_~q1~0.base_401) (+ (* v_~q1_front~0_553 4) v_~q1~0.offset_401)) 1) v_~i~0_518) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_454| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_454|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_454| (ite (and (< v_~q2_front~0_574 v_~q2_back~0_605) (< v_~q2_front~0_574 v_~n2~0_390) (<= 0 v_~q2_front~0_574)) 1 0)) (= v_~j~0_586 (+ (select (select |v_#memory_int_719| v_~q2~0.base_395) (+ (* v_~q2_front~0_574 4) v_~q2~0.offset_395)) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_427| (ite (and (<= 0 v_~q1_front~0_553) (< v_~q1_front~0_553 v_~n1~0_382) (< v_~q1_front~0_553 v_~q1_back~0_655)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_427| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_427| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_427|) (= (+ v_~q2_front~0_574 1) v_~q2_front~0_573)) InVars {~q1~0.offset=v_~q1~0.offset_401, ~q1_front~0=v_~q1_front~0_553, ~n2~0=v_~n2~0_390, ~q1_back~0=v_~q1_back~0_655, ~n1~0=v_~n1~0_382, ~q2~0.offset=v_~q2~0.offset_395, ~q1~0.base=v_~q1~0.base_401, #memory_int=|v_#memory_int_719|, ~q2_front~0=v_~q2_front~0_574, ~q2~0.base=v_~q2~0.base_395, ~q2_back~0=v_~q2_back~0_605} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_279|, ~j~0=v_~j~0_586, ~q1~0.offset=v_~q1~0.offset_401, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_273|, ~q1_front~0=v_~q1_front~0_552, ~n2~0=v_~n2~0_390, ~i~0=v_~i~0_518, ~n1~0=v_~n1~0_382, ~q2~0.offset=v_~q2~0.offset_395, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_261|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_454|, ~q2_front~0=v_~q2_front~0_573, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_273|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_454|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_427|, ~q1_back~0=v_~q1_back~0_655, ~q1~0.base=v_~q1~0.base_401, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_267|, #memory_int=|v_#memory_int_719|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_427|, ~q2~0.base=v_~q2~0.base_395, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_261|, ~q2_back~0=v_~q2_back~0_605} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:48:14,370 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,370 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,370 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,370 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,370 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,370 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,371 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,371 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,631 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [899] L70-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_707| v_~q1~0.base_391))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_436| 0)) (= (ite (and (< v_~q1_front~0_540 v_~q1_back~0_634) (<= 0 v_~q1_front~0_540) (< v_~q1_front~0_540 v_~n1~0_372)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_414|) (< v_~j~0_568 v_~N~0_390) (= (+ v_~q2_front~0_557 1) v_~q2_front~0_556) (= v_~j~0_568 (+ (select (select |v_#memory_int_707| v_~q2~0.base_385) (+ v_~q2~0.offset_385 (* v_~q2_front~0_557 4))) 1)) (= v_~q1_back~0_634 (+ v_~q1_back~0_635 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_436| (ite (= v_~j~0_568 (select .cse0 (+ (* v_~q1_back~0_635 4) v_~q1~0.offset_391))) 1 0)) (= v_~q1_front~0_539 (+ v_~q1_front~0_540 1)) (not (= (ite (and (<= 0 v_~q2_front~0_557) (< v_~q2_front~0_557 v_~q2_back~0_590) (< v_~q2_front~0_557 v_~n2~0_380)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_436| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_436|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_414| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_414|) (not (= (ite (and (< v_~q1_back~0_635 v_~n1~0_372) (<= 0 v_~q1_back~0_635)) 1 0) 0)) (= (+ (select .cse0 (+ (* v_~q1_front~0_540 4) v_~q1~0.offset_391)) 1) v_~i~0_509) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_414| 0)))) InVars {~q1~0.offset=v_~q1~0.offset_391, ~q1_front~0=v_~q1_front~0_540, ~n2~0=v_~n2~0_380, ~q1_back~0=v_~q1_back~0_635, ~n1~0=v_~n1~0_372, ~q2~0.offset=v_~q2~0.offset_385, ~q1~0.base=v_~q1~0.base_391, #memory_int=|v_#memory_int_707|, ~q2_front~0=v_~q2_front~0_557, ~q2~0.base=v_~q2~0.base_385, ~N~0=v_~N~0_390, ~q2_back~0=v_~q2_back~0_590} OutVars{~j~0=v_~j~0_568, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_269|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_263|, ~q1_front~0=v_~q1_front~0_539, ~n1~0=v_~n1~0_372, ~q2~0.offset=v_~q2~0.offset_385, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_436|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_263|, ~q1_back~0=v_~q1_back~0_634, ~q1~0.base=v_~q1~0.base_391, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_259|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_414|, ~q2~0.base=v_~q2~0.base_385, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_253|, ~q2_back~0=v_~q2_back~0_590, ~q1~0.offset=v_~q1~0.offset_391, ~n2~0=v_~n2~0_380, ~i~0=v_~i~0_509, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_253|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_263|, ~q2_front~0=v_~q2_front~0_556, ~N~0=v_~N~0_390, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_263|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_436|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_414|, #memory_int=|v_#memory_int_707|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:48:14,631 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,631 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,631 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,631 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,631 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,631 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,632 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:14,632 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:48:15,163 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [954] L52-->L47-1: Formula: (let ((.cse1 (select |v_#memory_int_821| v_~q1~0.base_473))) (let ((.cse0 (+ (select .cse1 (+ v_~q1~0.offset_473 (* v_~q1_front~0_719 4))) 1))) (and (not (= (ite (= (select (select |v_#memory_int_821| v_~q2~0.base_474) (+ v_~q2~0.offset_474 (* 4 v_~q2_back~0_784))) .cse0) 1 0) 0)) (< .cse0 v_~N~0_478) (not (= (ite (and (< v_~q1_front~0_719 v_~q1_back~0_801) (<= 0 v_~q1_front~0_719) (< v_~q1_front~0_719 v_~n1~0_454)) 1 0) 0)) (= (+ v_~q2_back~0_784 1) v_~q2_back~0_783) (= v_~i~0_629 (+ (select .cse1 (+ (* v_~q1_front~0_717 4) v_~q1~0.offset_473 (- 4))) 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_565| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565| (ite (and (<= 1 v_~q1_front~0_717) (< v_~q1_front~0_717 (+ v_~q1_back~0_801 1)) (< v_~q1_front~0_717 (+ v_~n1~0_454 1))) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_565|) (= (+ 2 v_~q1_front~0_719) v_~q1_front~0_717) (not (= (ite (and (< v_~q2_back~0_784 v_~n2~0_468) (<= 0 v_~q2_back~0_784)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_473, ~q1_front~0=v_~q1_front~0_719, ~n2~0=v_~n2~0_468, ~q1_back~0=v_~q1_back~0_801, ~n1~0=v_~n1~0_454, ~q2~0.offset=v_~q2~0.offset_474, ~q1~0.base=v_~q1~0.base_473, #memory_int=|v_#memory_int_821|, ~q2~0.base=v_~q2~0.base_474, ~N~0=v_~N~0_478, ~q2_back~0=v_~q2_back~0_784} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_320|, ~q1~0.offset=v_~q1~0.offset_473, ~q1_front~0=v_~q1_front~0_717, ~n2~0=v_~n2~0_468, ~i~0=v_~i~0_629, ~n1~0=v_~n1~0_454, ~q2~0.offset=v_~q2~0.offset_474, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_360|, ~N~0=v_~N~0_478, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565|, ~q1_back~0=v_~q1_back~0_801, ~q1~0.base=v_~q1~0.base_473, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_366|, #memory_int=|v_#memory_int_821|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_565|, ~q2~0.base=v_~q2~0.base_474, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_360|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_320|, ~q2_back~0=v_~q2_back~0_783} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:48:15,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [926] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_770| v_~q2~0.base_432)) (.cse1 (* v_~q2_front~0_637 4))) (let ((.cse3 (select |v_#memory_int_770| v_~q1~0.base_431)) (.cse4 (* v_~q1_back~0_714 4)) (.cse6 (+ (select .cse0 (+ v_~q2~0.offset_432 .cse1)) 1))) (and (not (= (ite (and (<= 0 v_~q2_back~0_683) (< v_~q2_back~0_683 v_~n2~0_426)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_486| 0)) (not (= (ite (and (<= 0 v_~q2_front~0_637) (< v_~q2_front~0_637 v_~n2~0_426) (< v_~q2_front~0_637 v_~q2_back~0_683)) 1 0) 0)) (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_683) v_~q2~0.offset_432)) v_~i~0_568) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_486|) (= v_~j~0_645 (+ (select .cse0 (+ v_~q2~0.offset_432 .cse1 4)) 1)) (= (+ 2 v_~q1_back~0_714) v_~q1_back~0_713) (not (= (ite (and (<= 0 v_~q1_back~0_714) (< v_~q1_back~0_714 v_~n1~0_412)) 1 0) 0)) (not (= (ite (let ((.cse2 (+ v_~q1_back~0_714 1))) (and (<= 0 .cse2) (< .cse2 v_~n1~0_412))) 1 0) 0)) (= (+ v_~q2_back~0_683 1) v_~q2_back~0_682) (< v_~i~0_568 v_~N~0_436) (not (= (ite (= v_~j~0_647 (select .cse3 (+ .cse4 v_~q1~0.offset_431))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_501| (ite (let ((.cse5 (+ v_~q2_front~0_637 1))) (and (< .cse5 v_~n2~0_426) (<= 0 .cse5) (< .cse5 v_~q2_back~0_682))) 1 0)) (= (+ (select .cse3 (+ v_~q1~0.offset_431 (* v_~q1_front~0_622 4))) 1) v_~i~0_568) (not (= (ite (and (< v_~q1_front~0_622 v_~n1~0_412) (<= 0 v_~q1_front~0_622) (< v_~q1_front~0_622 v_~q1_back~0_713)) 1 0) 0)) (not (= (ite (= .cse6 (select .cse3 (+ .cse4 v_~q1~0.offset_431 4))) 1 0) 0)) (< .cse6 v_~N~0_436) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_486| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_486|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_501| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_501|) (= v_~q2_front~0_635 (+ 2 v_~q2_front~0_637)) (= v_~q1_front~0_621 (+ v_~q1_front~0_622 1)) (< v_~j~0_647 v_~N~0_436)))) InVars {~j~0=v_~j~0_647, ~q1~0.offset=v_~q1~0.offset_431, ~n2~0=v_~n2~0_426, ~q1_front~0=v_~q1_front~0_622, ~q2~0.offset=v_~q2~0.offset_432, ~n1~0=v_~n1~0_412, ~q2_front~0=v_~q2_front~0_637, ~N~0=v_~N~0_436, ~q1_back~0=v_~q1_back~0_714, ~q1~0.base=v_~q1~0.base_431, #memory_int=|v_#memory_int_770|, ~q2~0.base=v_~q2~0.base_432, ~q2_back~0=v_~q2_back~0_683} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_263|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_318|, ~j~0=v_~j~0_645, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_312|, ~q1_front~0=v_~q1_front~0_621, ~q2~0.offset=v_~q2~0.offset_432, ~n1~0=v_~n1~0_412, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_501|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_312|, ~q1_back~0=v_~q1_back~0_713, ~q1~0.base=v_~q1~0.base_431, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_486|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_308|, ~q2~0.base=v_~q2~0.base_432, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_302|, ~q2_back~0=v_~q2_back~0_682, ~q1~0.offset=v_~q1~0.offset_431, ~n2~0=v_~n2~0_426, ~i~0=v_~i~0_568, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_302|, ~q2_front~0=v_~q2_front~0_635, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_305|, ~N~0=v_~N~0_436, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_305|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_501|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_486|, #memory_int=|v_#memory_int_770|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_263|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:48:15,321 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,321 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,321 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,321 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,321 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,321 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,321 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,321 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,322 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,322 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,322 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,322 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,811 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,812 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,812 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,812 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,812 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,812 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,812 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,812 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,812 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,812 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,812 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:15,812 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,314 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,315 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,315 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,315 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,315 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,315 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,315 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,315 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,315 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,315 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,315 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:16,315 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:19,293 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-06 05:48:19,370 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:48:19,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5566 [2022-12-06 05:48:19,371 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 289 transitions, 9464 flow [2022-12-06 05:48:19,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:19,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:19,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:19,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 05:48:19,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 05:48:19,577 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:19,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:19,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1264693923, now seen corresponding path program 1 times [2022-12-06 05:48:19,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:19,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506192352] [2022-12-06 05:48:19,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:19,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:20,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:20,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506192352] [2022-12-06 05:48:20,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506192352] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:20,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159448723] [2022-12-06 05:48:20,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:20,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:20,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:20,323 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:48:20,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 05:48:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:20,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 05:48:20,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:20,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:48:20,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:48:20,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:20,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2022-12-06 05:48:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:20,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:21,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:21,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 396 [2022-12-06 05:48:21,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:21,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-06 05:48:21,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:21,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-06 05:50:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:47,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159448723] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:50:47,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:50:47,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 05:50:47,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103992442] [2022-12-06 05:50:47,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:50:47,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:50:47,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:47,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:50:47,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-12-06 05:50:47,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 05:50:47,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 289 transitions, 9464 flow. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:47,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:47,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 05:50:47,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:50,069 INFO L130 PetriNetUnfolder]: 1088/2126 cut-off events. [2022-12-06 05:50:50,069 INFO L131 PetriNetUnfolder]: For 79483/79483 co-relation queries the response was YES. [2022-12-06 05:50:50,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28335 conditions, 2126 events. 1088/2126 cut-off events. For 79483/79483 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 13625 event pairs, 69 based on Foata normal form. 2/2124 useless extension candidates. Maximal degree in co-relation 28165. Up to 1135 conditions per place. [2022-12-06 05:50:50,086 INFO L137 encePairwiseOnDemand]: 13/66 looper letters, 64 selfloop transitions, 259 changer transitions 31/354 dead transitions. [2022-12-06 05:50:50,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 354 transitions, 11436 flow [2022-12-06 05:50:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:50:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:50:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 131 transitions. [2022-12-06 05:50:50,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11675579322638147 [2022-12-06 05:50:50,087 INFO L175 Difference]: Start difference. First operand has 224 places, 289 transitions, 9464 flow. Second operand 17 states and 131 transitions. [2022-12-06 05:50:50,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 354 transitions, 11436 flow [2022-12-06 05:50:50,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 354 transitions, 10888 flow, removed 78 selfloop flow, removed 16 redundant places. [2022-12-06 05:50:50,344 INFO L231 Difference]: Finished difference. Result has 231 places, 308 transitions, 10277 flow [2022-12-06 05:50:50,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=8971, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10277, PETRI_PLACES=231, PETRI_TRANSITIONS=308} [2022-12-06 05:50:50,344 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 209 predicate places. [2022-12-06 05:50:50,344 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:50,344 INFO L89 Accepts]: Start accepts. Operand has 231 places, 308 transitions, 10277 flow [2022-12-06 05:50:50,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:50,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:50,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 308 transitions, 10277 flow [2022-12-06 05:50:50,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 308 transitions, 10277 flow [2022-12-06 05:50:50,489 INFO L130 PetriNetUnfolder]: 423/1109 cut-off events. [2022-12-06 05:50:50,489 INFO L131 PetriNetUnfolder]: For 39634/39650 co-relation queries the response was YES. [2022-12-06 05:50:50,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14142 conditions, 1109 events. 423/1109 cut-off events. For 39634/39650 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8070 event pairs, 102 based on Foata normal form. 4/1015 useless extension candidates. Maximal degree in co-relation 14063. Up to 416 conditions per place. [2022-12-06 05:50:50,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 308 transitions, 10277 flow [2022-12-06 05:50:50,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 592 [2022-12-06 05:50:50,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [970] L47-1-->L70: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_601| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_601|) (= (ite (= (select (select |v_#memory_int_847| v_~q2~0.base_496) (+ v_~q2~0.offset_496 (* 4 v_~q2_back~0_826))) v_~i~0_667) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_601|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_579| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_579| (ite (= v_~j~0_758 (select (select |v_#memory_int_847| v_~q1~0.base_495) (+ v_~q1~0.offset_495 (* v_~q1_back~0_840 4)))) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_579| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_579|) (= (+ v_~q1_back~0_840 1) v_~q1_back~0_839) (not (= (ite (and (<= 0 v_~q1_back~0_840) (< v_~q1_back~0_840 v_~n1~0_476)) 1 0) 0)) (< v_~j~0_758 v_~N~0_500) (< v_~i~0_667 v_~N~0_500) (not (= (ite (and (<= 0 v_~q2_back~0_826) (< v_~q2_back~0_826 v_~n2~0_488)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_601| 0)) (= (+ v_~q2_back~0_826 1) v_~q2_back~0_825)) InVars {~j~0=v_~j~0_758, ~q1~0.offset=v_~q1~0.offset_495, ~n2~0=v_~n2~0_488, ~q1_back~0=v_~q1_back~0_840, ~i~0=v_~i~0_667, ~n1~0=v_~n1~0_476, ~q2~0.offset=v_~q2~0.offset_496, ~q1~0.base=v_~q1~0.base_495, #memory_int=|v_#memory_int_847|, ~q2~0.base=v_~q2~0.base_496, ~N~0=v_~N~0_500, ~q2_back~0=v_~q2_back~0_826} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_342|, ~j~0=v_~j~0_758, ~q1~0.offset=v_~q1~0.offset_495, ~n2~0=v_~n2~0_488, ~i~0=v_~i~0_667, ~n1~0=v_~n1~0_476, ~q2~0.offset=v_~q2~0.offset_496, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_579|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_367|, ~N~0=v_~N~0_500, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_367|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_579|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_601|, ~q1_back~0=v_~q1_back~0_839, ~q1~0.base=v_~q1~0.base_495, #memory_int=|v_#memory_int_847|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_601|, ~q2~0.base=v_~q2~0.base_496, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_342|, ~q2_back~0=v_~q2_back~0_825} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [720] L52-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_267| v_~q2~0.base_105))) (and (= (+ v_~q1_front~0_157 1) v_~q1_front~0_156) (not (= (ite (and (<= 0 v_~q2_back~0_169) (< v_~q2_back~0_169 v_~n2~0_118)) 1 0) 0)) (= v_~i~0_159 (+ (select (select |v_#memory_int_267| v_~q1~0.base_121) (+ (* v_~q1_front~0_157 4) v_~q1~0.offset_121)) 1)) (< v_~i~0_159 v_~N~0_106) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (not (= (ite (and (<= 0 v_~q1_front~0_157) (< v_~q1_front~0_157 v_~n1~0_110) (< v_~q1_front~0_157 v_~q1_back~0_151)) 1 0) 0)) (= (ite (and (<= 0 v_~q2_front~0_136) (< v_~q2_front~0_136 v_~q2_back~0_168) (< v_~q2_front~0_136 v_~n2~0_118)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|) (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_169) v_~q2~0.offset_105)) v_~i~0_159) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| 0)) (= (+ v_~q2_front~0_136 1) v_~q2_front~0_135) (= (+ v_~q2_back~0_169 1) v_~q2_back~0_168) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|) (= v_~j~0_141 (+ (select .cse0 (+ (* v_~q2_front~0_136 4) v_~q2~0.offset_105)) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_121, ~n2~0=v_~n2~0_118, ~q1_front~0=v_~q1_front~0_157, ~q1_back~0=v_~q1_back~0_151, ~q2~0.offset=v_~q2~0.offset_105, ~n1~0=v_~n1~0_110, ~q1~0.base=v_~q1~0.base_121, #memory_int=|v_#memory_int_267|, ~q2_front~0=v_~q2_front~0_136, ~q2~0.base=v_~q2~0.base_105, ~N~0=v_~N~0_106, ~q2_back~0=v_~q2_back~0_169} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_41|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_44|, ~j~0=v_~j~0_141, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_38|, ~q1_front~0=v_~q1_front~0_156, ~q2~0.offset=v_~q2~0.offset_105, ~n1~0=v_~n1~0_110, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_38|, ~q1_back~0=v_~q1_back~0_151, ~q1~0.base=v_~q1~0.base_121, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_57|, ~q2~0.base=v_~q2~0.base_105, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_51|, ~q2_back~0=v_~q2_back~0_168, ~q1~0.offset=v_~q1~0.offset_121, ~n2~0=v_~n2~0_118, ~i~0=v_~i~0_159, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_51|, ~q2_front~0=v_~q2_front~0_135, ~N~0=v_~N~0_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, #memory_int=|v_#memory_int_267|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:50:50,528 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:50,528 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:50,528 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:50,528 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:50,528 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:50,528 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:50,528 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:50,528 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:51,238 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [970] L47-1-->L70: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_601| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_601|) (= (ite (= (select (select |v_#memory_int_847| v_~q2~0.base_496) (+ v_~q2~0.offset_496 (* 4 v_~q2_back~0_826))) v_~i~0_667) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_601|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_579| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_579| (ite (= v_~j~0_758 (select (select |v_#memory_int_847| v_~q1~0.base_495) (+ v_~q1~0.offset_495 (* v_~q1_back~0_840 4)))) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_579| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_579|) (= (+ v_~q1_back~0_840 1) v_~q1_back~0_839) (not (= (ite (and (<= 0 v_~q1_back~0_840) (< v_~q1_back~0_840 v_~n1~0_476)) 1 0) 0)) (< v_~j~0_758 v_~N~0_500) (< v_~i~0_667 v_~N~0_500) (not (= (ite (and (<= 0 v_~q2_back~0_826) (< v_~q2_back~0_826 v_~n2~0_488)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_601| 0)) (= (+ v_~q2_back~0_826 1) v_~q2_back~0_825)) InVars {~j~0=v_~j~0_758, ~q1~0.offset=v_~q1~0.offset_495, ~n2~0=v_~n2~0_488, ~q1_back~0=v_~q1_back~0_840, ~i~0=v_~i~0_667, ~n1~0=v_~n1~0_476, ~q2~0.offset=v_~q2~0.offset_496, ~q1~0.base=v_~q1~0.base_495, #memory_int=|v_#memory_int_847|, ~q2~0.base=v_~q2~0.base_496, ~N~0=v_~N~0_500, ~q2_back~0=v_~q2_back~0_826} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_342|, ~j~0=v_~j~0_758, ~q1~0.offset=v_~q1~0.offset_495, ~n2~0=v_~n2~0_488, ~i~0=v_~i~0_667, ~n1~0=v_~n1~0_476, ~q2~0.offset=v_~q2~0.offset_496, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_579|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_367|, ~N~0=v_~N~0_500, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_367|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_579|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_601|, ~q1_back~0=v_~q1_back~0_839, ~q1~0.base=v_~q1~0.base_495, #memory_int=|v_#memory_int_847|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_601|, ~q2~0.base=v_~q2~0.base_496, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_342|, ~q2_back~0=v_~q2_back~0_825} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [723] L52-->L65-1: Formula: (and (= (ite (and (<= 0 v_~q1_front~0_167) (< v_~q1_front~0_167 v_~n1~0_114) (< v_~q1_front~0_167 v_~q1_back~0_155)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| 0)) (= v_~q1_front~0_166 (+ v_~q1_front~0_167 1)) (= v_~q2_front~0_139 (+ v_~q2_front~0_140 1)) (= (+ (select (select |v_#memory_int_271| v_~q1~0.base_125) (+ (* v_~q1_front~0_167 4) v_~q1~0.offset_125)) 1) v_~i~0_165) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (= v_~j~0_143 (+ (select (select |v_#memory_int_271| v_~q2~0.base_109) (+ v_~q2~0.offset_109 (* v_~q2_front~0_140 4))) 1)) (= (ite (and (< v_~q2_front~0_140 v_~n2~0_122) (< v_~q2_front~0_140 v_~q2_back~0_176) (<= 0 v_~q2_front~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|)) InVars {~q1~0.offset=v_~q1~0.offset_125, ~n2~0=v_~n2~0_122, ~q1_front~0=v_~q1_front~0_167, ~q1_back~0=v_~q1_back~0_155, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_114, ~q1~0.base=v_~q1~0.base_125, #memory_int=|v_#memory_int_271|, ~q2_front~0=v_~q2_front~0_140, ~q2~0.base=v_~q2~0.base_109, ~q2_back~0=v_~q2_back~0_176} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_46|, ~j~0=v_~j~0_143, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_40|, ~q1~0.offset=v_~q1~0.offset_125, ~n2~0=v_~n2~0_122, ~q1_front~0=v_~q1_front~0_166, ~i~0=v_~i~0_165, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_114, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|, ~q2_front~0=v_~q2_front~0_139, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_40|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|, ~q1_back~0=v_~q1_back~0_155, ~q1~0.base=v_~q1~0.base_125, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_63|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91|, ~q2~0.base=v_~q2~0.base_109, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_57|, ~q2_back~0=v_~q2_back~0_176} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:50:51,456 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:51,456 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:51,456 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:51,456 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:51,456 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:51,456 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:51,457 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:51,457 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:51,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:50:51,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1399 [2022-12-06 05:50:51,743 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 307 transitions, 10263 flow [2022-12-06 05:50:51,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:51,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:51,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:51,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 05:50:51,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:51,959 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:50:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:51,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1216914336, now seen corresponding path program 1 times [2022-12-06 05:50:51,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:51,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150542402] [2022-12-06 05:50:51,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:51,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:52,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:52,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150542402] [2022-12-06 05:50:52,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150542402] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:50:52,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269988644] [2022-12-06 05:50:52,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:52,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:52,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:50:52,392 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:50:52,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 05:50:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:52,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 05:50:52,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:50:52,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:50:52,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:50:52,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:50:52,589 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:50:52,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-06 05:50:52,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-12-06 05:50:52,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 05:50:52,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:50:52,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:50:52,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 31 [2022-12-06 05:50:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:52,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:50:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:53,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269988644] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:50:53,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:50:53,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:50:53,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29743628] [2022-12-06 05:50:53,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:50:53,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:50:53,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:53,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:50:53,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:50:53,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 05:50:53,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 307 transitions, 10263 flow. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:53,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:53,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 05:50:53,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:55,100 INFO L130 PetriNetUnfolder]: 1126/2175 cut-off events. [2022-12-06 05:50:55,100 INFO L131 PetriNetUnfolder]: For 86966/86966 co-relation queries the response was YES. [2022-12-06 05:50:55,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29614 conditions, 2175 events. 1126/2175 cut-off events. For 86966/86966 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13833 event pairs, 122 based on Foata normal form. 3/2174 useless extension candidates. Maximal degree in co-relation 29532. Up to 1384 conditions per place. [2022-12-06 05:50:55,119 INFO L137 encePairwiseOnDemand]: 14/65 looper letters, 127 selfloop transitions, 232 changer transitions 15/374 dead transitions. [2022-12-06 05:50:55,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 374 transitions, 12482 flow [2022-12-06 05:50:55,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:50:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:50:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 130 transitions. [2022-12-06 05:50:55,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15384615384615385 [2022-12-06 05:50:55,120 INFO L175 Difference]: Start difference. First operand has 215 places, 307 transitions, 10263 flow. Second operand 13 states and 130 transitions. [2022-12-06 05:50:55,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 374 transitions, 12482 flow [2022-12-06 05:50:55,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 374 transitions, 12135 flow, removed 44 selfloop flow, removed 12 redundant places. [2022-12-06 05:50:55,393 INFO L231 Difference]: Finished difference. Result has 220 places, 335 transitions, 11692 flow [2022-12-06 05:50:55,394 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=9924, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11692, PETRI_PLACES=220, PETRI_TRANSITIONS=335} [2022-12-06 05:50:55,394 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 198 predicate places. [2022-12-06 05:50:55,394 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:55,394 INFO L89 Accepts]: Start accepts. Operand has 220 places, 335 transitions, 11692 flow [2022-12-06 05:50:55,395 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:55,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:55,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 335 transitions, 11692 flow [2022-12-06 05:50:55,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 335 transitions, 11692 flow [2022-12-06 05:50:55,555 INFO L130 PetriNetUnfolder]: 434/1129 cut-off events. [2022-12-06 05:50:55,555 INFO L131 PetriNetUnfolder]: For 40402/40416 co-relation queries the response was YES. [2022-12-06 05:50:55,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14736 conditions, 1129 events. 434/1129 cut-off events. For 40402/40416 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8273 event pairs, 114 based on Foata normal form. 3/1031 useless extension candidates. Maximal degree in co-relation 14591. Up to 432 conditions per place. [2022-12-06 05:50:55,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 335 transitions, 11692 flow [2022-12-06 05:50:55,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 05:50:55,571 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:50:55,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:50:55,572 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 335 transitions, 11692 flow [2022-12-06 05:50:55,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:55,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:55,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:55,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 05:50:55,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:55,778 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:50:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:55,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1729884514, now seen corresponding path program 1 times [2022-12-06 05:50:55,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:55,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745644301] [2022-12-06 05:50:55,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:55,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:57,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:57,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745644301] [2022-12-06 05:50:57,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745644301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:50:57,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308694732] [2022-12-06 05:50:57,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:57,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:57,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:50:57,312 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:50:57,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 05:50:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:57,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 05:50:57,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:50:57,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:50:57,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:50:57,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:50:57,506 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:50:57,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-06 05:50:57,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-12-06 05:50:57,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 05:50:57,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:50:57,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:50:57,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 31 [2022-12-06 05:50:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:57,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:50:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:57,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308694732] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:50:57,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:50:57,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 05:50:57,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964590319] [2022-12-06 05:50:57,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:50:57,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:50:57,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:57,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:50:57,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:50:57,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 05:50:57,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 335 transitions, 11692 flow. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:57,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:57,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 05:50:57,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:51:00,531 INFO L130 PetriNetUnfolder]: 1114/2151 cut-off events. [2022-12-06 05:51:00,531 INFO L131 PetriNetUnfolder]: For 82182/82182 co-relation queries the response was YES. [2022-12-06 05:51:00,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29530 conditions, 2151 events. 1114/2151 cut-off events. For 82182/82182 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13702 event pairs, 58 based on Foata normal form. 13/2160 useless extension candidates. Maximal degree in co-relation 29368. Up to 1124 conditions per place. [2022-12-06 05:51:00,550 INFO L137 encePairwiseOnDemand]: 8/63 looper letters, 81 selfloop transitions, 288 changer transitions 13/382 dead transitions. [2022-12-06 05:51:00,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 382 transitions, 12861 flow [2022-12-06 05:51:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 05:51:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 05:51:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 150 transitions. [2022-12-06 05:51:00,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11337868480725624 [2022-12-06 05:51:00,551 INFO L175 Difference]: Start difference. First operand has 217 places, 335 transitions, 11692 flow. Second operand 21 states and 150 transitions. [2022-12-06 05:51:00,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 382 transitions, 12861 flow [2022-12-06 05:51:00,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 382 transitions, 12801 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-06 05:51:00,880 INFO L231 Difference]: Finished difference. Result has 235 places, 336 transitions, 12275 flow [2022-12-06 05:51:00,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=11638, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12275, PETRI_PLACES=235, PETRI_TRANSITIONS=336} [2022-12-06 05:51:00,880 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 213 predicate places. [2022-12-06 05:51:00,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:51:00,880 INFO L89 Accepts]: Start accepts. Operand has 235 places, 336 transitions, 12275 flow [2022-12-06 05:51:00,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:51:00,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:51:00,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 336 transitions, 12275 flow [2022-12-06 05:51:00,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 336 transitions, 12275 flow [2022-12-06 05:51:01,100 INFO L130 PetriNetUnfolder]: 429/1116 cut-off events. [2022-12-06 05:51:01,100 INFO L131 PetriNetUnfolder]: For 46100/46115 co-relation queries the response was YES. [2022-12-06 05:51:01,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15540 conditions, 1116 events. 429/1116 cut-off events. For 46100/46115 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8100 event pairs, 104 based on Foata normal form. 4/1025 useless extension candidates. Maximal degree in co-relation 15392. Up to 427 conditions per place. [2022-12-06 05:51:01,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 336 transitions, 12275 flow [2022-12-06 05:51:01,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-06 05:51:01,122 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:51:01,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 05:51:01,122 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 336 transitions, 12275 flow [2022-12-06 05:51:01,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:01,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:51:01,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:51:01,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 05:51:01,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-06 05:51:01,329 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:51:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:51:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1813001404, now seen corresponding path program 2 times [2022-12-06 05:51:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:51:01,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882284827] [2022-12-06 05:51:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:51:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:51:02,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882284827] [2022-12-06 05:51:02,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882284827] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:51:02,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956795221] [2022-12-06 05:51:02,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:51:02,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:51:02,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:51:02,148 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:51:02,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 05:51:02,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:51:02,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:51:02,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 05:51:02,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:51:02,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:51:02,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:51:02,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:51:02,396 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:51:02,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-06 05:51:02,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:51:02,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 05:51:02,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-12-06 05:51:02,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:51:02,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:51:02,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 31 [2022-12-06 05:51:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:02,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:51:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:02,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956795221] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:51:02,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:51:02,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:51:02,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497968879] [2022-12-06 05:51:02,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:51:02,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:51:02,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:51:02,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:51:02,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:51:02,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 05:51:02,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 336 transitions, 12275 flow. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:02,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:51:02,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 05:51:02,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:51:05,339 INFO L130 PetriNetUnfolder]: 1106/2123 cut-off events. [2022-12-06 05:51:05,339 INFO L131 PetriNetUnfolder]: For 93141/93141 co-relation queries the response was YES. [2022-12-06 05:51:05,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30989 conditions, 2123 events. 1106/2123 cut-off events. For 93141/93141 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13405 event pairs, 54 based on Foata normal form. 1/2120 useless extension candidates. Maximal degree in co-relation 30830. Up to 1124 conditions per place. [2022-12-06 05:51:05,360 INFO L137 encePairwiseOnDemand]: 8/63 looper letters, 77 selfloop transitions, 291 changer transitions 9/377 dead transitions. [2022-12-06 05:51:05,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 377 transitions, 13418 flow [2022-12-06 05:51:05,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 05:51:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 05:51:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 142 transitions. [2022-12-06 05:51:05,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1126984126984127 [2022-12-06 05:51:05,361 INFO L175 Difference]: Start difference. First operand has 232 places, 336 transitions, 12275 flow. Second operand 20 states and 142 transitions. [2022-12-06 05:51:05,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 377 transitions, 13418 flow [2022-12-06 05:51:05,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 377 transitions, 13184 flow, removed 20 selfloop flow, removed 11 redundant places. [2022-12-06 05:51:05,712 INFO L231 Difference]: Finished difference. Result has 242 places, 339 transitions, 12762 flow [2022-12-06 05:51:05,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=12058, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=12762, PETRI_PLACES=242, PETRI_TRANSITIONS=339} [2022-12-06 05:51:05,712 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 220 predicate places. [2022-12-06 05:51:05,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:51:05,712 INFO L89 Accepts]: Start accepts. Operand has 242 places, 339 transitions, 12762 flow [2022-12-06 05:51:05,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:51:05,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:51:05,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 242 places, 339 transitions, 12762 flow [2022-12-06 05:51:05,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 339 transitions, 12762 flow [2022-12-06 05:51:05,869 INFO L130 PetriNetUnfolder]: 427/1105 cut-off events. [2022-12-06 05:51:05,869 INFO L131 PetriNetUnfolder]: For 48642/48654 co-relation queries the response was YES. [2022-12-06 05:51:05,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16103 conditions, 1105 events. 427/1105 cut-off events. For 48642/48654 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8013 event pairs, 94 based on Foata normal form. 5/1015 useless extension candidates. Maximal degree in co-relation 15959. Up to 425 conditions per place. [2022-12-06 05:51:05,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 339 transitions, 12762 flow [2022-12-06 05:51:05,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 652 [2022-12-06 05:51:05,883 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:05,883 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:06,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (not (< v_~j~0_In_6 v_~N~0_In_3))) InVars {~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, ~j~0=v_~j~0_In_6, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [941] L47-1-->L47-1: Formula: (and (= v_~i~0_600 (+ (select (select |v_#memory_int_794| v_~q1~0.base_455) (+ v_~q1~0.offset_455 (* v_~q1_front~0_678 4))) 1)) (= (+ v_~q2_back~0_737 1) v_~q2_back~0_736) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_528| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_528| (ite (and (< v_~q1_front~0_678 v_~n1~0_436) (< v_~q1_front~0_678 v_~q1_back~0_763) (<= 0 v_~q1_front~0_678)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_528| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_528|) (= (+ v_~q1_front~0_678 1) v_~q1_front~0_677) (not (= 0 (ite (and (< v_~q2_back~0_737 v_~n2~0_450) (<= 0 v_~q2_back~0_737)) 1 0))) (not (= (ite (= (select (select |v_#memory_int_794| v_~q2~0.base_456) (+ v_~q2~0.offset_456 (* 4 v_~q2_back~0_737))) v_~i~0_601) 1 0) 0)) (< v_~i~0_601 v_~N~0_460)) InVars {~q1~0.offset=v_~q1~0.offset_455, ~q1_front~0=v_~q1_front~0_678, ~n2~0=v_~n2~0_450, ~q1_back~0=v_~q1_back~0_763, ~i~0=v_~i~0_601, ~n1~0=v_~n1~0_436, ~q2~0.offset=v_~q2~0.offset_456, ~q1~0.base=v_~q1~0.base_455, #memory_int=|v_#memory_int_794|, ~q2~0.base=v_~q2~0.base_456, ~N~0=v_~N~0_460, ~q2_back~0=v_~q2_back~0_737} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_293|, ~q1~0.offset=v_~q1~0.offset_455, ~q1_front~0=v_~q1_front~0_677, ~n2~0=v_~n2~0_450, ~i~0=v_~i~0_600, ~n1~0=v_~n1~0_436, ~q2~0.offset=v_~q2~0.offset_456, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_334|, ~N~0=v_~N~0_460, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_528|, ~q1_back~0=v_~q1_back~0_763, ~q1~0.base=v_~q1~0.base_455, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_340|, #memory_int=|v_#memory_int_794|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_528|, ~q2~0.base=v_~q2~0.base_456, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_334|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_293|, ~q2_back~0=v_~q2_back~0_736} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:51:06,974 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:06,974 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:06,974 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:06,974 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:06,974 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:06,974 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:07,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [964] L65-1-->L47-1: Formula: (let ((.cse8 (select |v_#memory_int_835| v_~q2~0.base_486)) (.cse9 (* v_~q2_front~0_738 4)) (.cse3 (select |v_#memory_int_835| v_~q1~0.base_487)) (.cse5 (* v_~q1_front~0_749 4))) (let ((.cse4 (* v_~q1_back~0_826 4)) (.cse1 (+ (select .cse3 (+ v_~q1~0.offset_487 .cse5)) 1)) (.cse7 (+ (select .cse8 (+ v_~q2~0.offset_486 .cse9)) 1))) (and (= (+ 2 v_~q1_front~0_749) v_~q1_front~0_747) (= (+ 2 v_~q1_back~0_826) v_~q1_back~0_825) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_589| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_589|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_573| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_573|) (not (= (ite (and (< v_~q1_front~0_749 v_~q1_back~0_825) (<= 0 v_~q1_front~0_749) (< v_~q1_front~0_749 v_~n1~0_468)) 1 0) 0)) (= v_~q2_front~0_737 (+ 2 v_~q2_front~0_738)) (= (+ v_~q2_back~0_810 1) v_~q2_back~0_809) (not (= (ite (and (<= 0 v_~q2_front~0_738) (< v_~q2_front~0_738 v_~q2_back~0_810) (< v_~q2_front~0_738 v_~n2~0_480)) 1 0) 0)) (= (ite (let ((.cse0 (+ v_~q1_front~0_749 1))) (and (<= 0 .cse0) (< .cse0 v_~n1~0_468) (< .cse0 v_~q1_back~0_825))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_589|) (< .cse1 v_~N~0_492) (not (= 0 (ite (let ((.cse2 (+ v_~q1_back~0_826 1))) (and (<= 0 .cse2) (< .cse2 v_~n1~0_468))) 1 0))) (not (= (ite (= v_~j~0_745 (select .cse3 (+ v_~q1~0.offset_487 .cse4))) 1 0) 0)) (= (+ (select .cse3 (+ v_~q1~0.offset_487 4 .cse5)) 1) v_~i~0_653) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_573| (ite (let ((.cse6 (+ v_~q2_front~0_738 1))) (and (< .cse6 v_~n2~0_480) (< .cse6 v_~q2_back~0_809) (<= 0 .cse6))) 1 0)) (not (= (ite (= .cse7 (select .cse3 (+ v_~q1~0.offset_487 4 .cse4))) 1 0) 0)) (not (= (ite (= (select .cse8 (+ v_~q2~0.offset_486 (* 4 v_~q2_back~0_810))) .cse1) 1 0) 0)) (< .cse7 v_~N~0_492) (not (= (ite (and (<= 0 v_~q2_back~0_810) (< v_~q2_back~0_810 v_~n2~0_480)) 1 0) 0)) (= v_~j~0_744 (+ (select .cse8 (+ v_~q2~0.offset_486 .cse9 4)) 1)) (< v_~j~0_745 v_~N~0_492) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_589| 0))))) InVars {~j~0=v_~j~0_745, ~q1~0.offset=v_~q1~0.offset_487, ~q1_front~0=v_~q1_front~0_749, ~n2~0=v_~n2~0_480, ~n1~0=v_~n1~0_468, ~q2~0.offset=v_~q2~0.offset_486, ~q2_front~0=v_~q2_front~0_738, ~N~0=v_~N~0_492, ~q1_back~0=v_~q1_back~0_826, ~q1~0.base=v_~q1~0.base_487, #memory_int=|v_#memory_int_835|, ~q2~0.base=v_~q2~0.base_486, ~q2_back~0=v_~q2_back~0_810} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_334|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_376|, ~j~0=v_~j~0_744, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_370|, ~q1_front~0=v_~q1_front~0_747, ~n1~0=v_~n1~0_468, ~q2~0.offset=v_~q2~0.offset_486, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_573|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_370|, ~q1_back~0=v_~q1_back~0_825, ~q1~0.base=v_~q1~0.base_487, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_382|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_589|, ~q2~0.base=v_~q2~0.base_486, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_376|, ~q2_back~0=v_~q2_back~0_809, ~q1~0.offset=v_~q1~0.offset_487, ~n2~0=v_~n2~0_480, ~i~0=v_~i~0_653, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_376|, ~q2_front~0=v_~q2_front~0_737, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_361|, ~N~0=v_~N~0_492, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_361|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_573|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_589|, #memory_int=|v_#memory_int_835|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_334|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [979] L65-1-->L47-1: Formula: (and (< v_~i~0_694 v_~N~0_512) (= (+ v_~q1_front~0_795 1) v_~q1_front~0_794) (= |v_thread2Thread1of1ForFork1_#res#1.offset_123| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_635| 0)) (= (+ v_~q2_back~0_864 1) v_~q2_back~0_863) (not (< v_~j~0_785 v_~N~0_512)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_635| (ite (and (< v_~q1_front~0_795 v_~n1~0_488) (<= 0 v_~q1_front~0_795) (< v_~q1_front~0_795 v_~q1_back~0_869)) 1 0)) (= (+ (select (select |v_#memory_int_870| v_~q1~0.base_507) (+ (* v_~q1_front~0_795 4) v_~q1~0.offset_507)) 1) v_~i~0_693) (= |v_thread2Thread1of1ForFork1_#res#1.base_123| 0) (not (= (ite (and (<= 0 v_~q2_back~0_864) (< v_~q2_back~0_864 v_~n2~0_500)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_635| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_635|) (not (= (ite (= v_~i~0_694 (select (select |v_#memory_int_870| v_~q2~0.base_508) (+ (* 4 v_~q2_back~0_864) v_~q2~0.offset_508))) 1 0) 0))) InVars {~j~0=v_~j~0_785, ~q1~0.offset=v_~q1~0.offset_507, ~q1_front~0=v_~q1_front~0_795, ~n2~0=v_~n2~0_500, ~i~0=v_~i~0_694, ~n1~0=v_~n1~0_488, ~q2~0.offset=v_~q2~0.offset_508, ~N~0=v_~N~0_512, ~q1_back~0=v_~q1_back~0_869, ~q1~0.base=v_~q1~0.base_507, #memory_int=|v_#memory_int_870|, ~q2~0.base=v_~q2~0.base_508, ~q2_back~0=v_~q2_back~0_864} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_369|, ~j~0=v_~j~0_785, ~q1~0.offset=v_~q1~0.offset_507, ~q1_front~0=v_~q1_front~0_794, ~n2~0=v_~n2~0_500, ~i~0=v_~i~0_693, ~n1~0=v_~n1~0_488, ~q2~0.offset=v_~q2~0.offset_508, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_408|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_123|, ~N~0=v_~N~0_512, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_635|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_123|, ~q1_back~0=v_~q1_back~0_869, ~q1~0.base=v_~q1~0.base_507, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_414|, #memory_int=|v_#memory_int_870|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_635|, ~q2~0.base=v_~q2~0.base_508, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_408|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_369|, ~q2_back~0=v_~q2_back~0_863} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:51:07,231 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:07,231 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:08,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [964] L65-1-->L47-1: Formula: (let ((.cse8 (select |v_#memory_int_835| v_~q2~0.base_486)) (.cse9 (* v_~q2_front~0_738 4)) (.cse3 (select |v_#memory_int_835| v_~q1~0.base_487)) (.cse5 (* v_~q1_front~0_749 4))) (let ((.cse4 (* v_~q1_back~0_826 4)) (.cse1 (+ (select .cse3 (+ v_~q1~0.offset_487 .cse5)) 1)) (.cse7 (+ (select .cse8 (+ v_~q2~0.offset_486 .cse9)) 1))) (and (= (+ 2 v_~q1_front~0_749) v_~q1_front~0_747) (= (+ 2 v_~q1_back~0_826) v_~q1_back~0_825) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_589| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_589|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_573| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_573|) (not (= (ite (and (< v_~q1_front~0_749 v_~q1_back~0_825) (<= 0 v_~q1_front~0_749) (< v_~q1_front~0_749 v_~n1~0_468)) 1 0) 0)) (= v_~q2_front~0_737 (+ 2 v_~q2_front~0_738)) (= (+ v_~q2_back~0_810 1) v_~q2_back~0_809) (not (= (ite (and (<= 0 v_~q2_front~0_738) (< v_~q2_front~0_738 v_~q2_back~0_810) (< v_~q2_front~0_738 v_~n2~0_480)) 1 0) 0)) (= (ite (let ((.cse0 (+ v_~q1_front~0_749 1))) (and (<= 0 .cse0) (< .cse0 v_~n1~0_468) (< .cse0 v_~q1_back~0_825))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_589|) (< .cse1 v_~N~0_492) (not (= 0 (ite (let ((.cse2 (+ v_~q1_back~0_826 1))) (and (<= 0 .cse2) (< .cse2 v_~n1~0_468))) 1 0))) (not (= (ite (= v_~j~0_745 (select .cse3 (+ v_~q1~0.offset_487 .cse4))) 1 0) 0)) (= (+ (select .cse3 (+ v_~q1~0.offset_487 4 .cse5)) 1) v_~i~0_653) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_573| (ite (let ((.cse6 (+ v_~q2_front~0_738 1))) (and (< .cse6 v_~n2~0_480) (< .cse6 v_~q2_back~0_809) (<= 0 .cse6))) 1 0)) (not (= (ite (= .cse7 (select .cse3 (+ v_~q1~0.offset_487 4 .cse4))) 1 0) 0)) (not (= (ite (= (select .cse8 (+ v_~q2~0.offset_486 (* 4 v_~q2_back~0_810))) .cse1) 1 0) 0)) (< .cse7 v_~N~0_492) (not (= (ite (and (<= 0 v_~q2_back~0_810) (< v_~q2_back~0_810 v_~n2~0_480)) 1 0) 0)) (= v_~j~0_744 (+ (select .cse8 (+ v_~q2~0.offset_486 .cse9 4)) 1)) (< v_~j~0_745 v_~N~0_492) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_589| 0))))) InVars {~j~0=v_~j~0_745, ~q1~0.offset=v_~q1~0.offset_487, ~q1_front~0=v_~q1_front~0_749, ~n2~0=v_~n2~0_480, ~n1~0=v_~n1~0_468, ~q2~0.offset=v_~q2~0.offset_486, ~q2_front~0=v_~q2_front~0_738, ~N~0=v_~N~0_492, ~q1_back~0=v_~q1_back~0_826, ~q1~0.base=v_~q1~0.base_487, #memory_int=|v_#memory_int_835|, ~q2~0.base=v_~q2~0.base_486, ~q2_back~0=v_~q2_back~0_810} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_334|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_376|, ~j~0=v_~j~0_744, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_370|, ~q1_front~0=v_~q1_front~0_747, ~n1~0=v_~n1~0_468, ~q2~0.offset=v_~q2~0.offset_486, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_573|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_370|, ~q1_back~0=v_~q1_back~0_825, ~q1~0.base=v_~q1~0.base_487, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_382|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_589|, ~q2~0.base=v_~q2~0.base_486, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_376|, ~q2_back~0=v_~q2_back~0_809, ~q1~0.offset=v_~q1~0.offset_487, ~n2~0=v_~n2~0_480, ~i~0=v_~i~0_653, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_376|, ~q2_front~0=v_~q2_front~0_737, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_361|, ~N~0=v_~N~0_492, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_361|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_573|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_589|, #memory_int=|v_#memory_int_835|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_334|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [981] L65-1-->L47-1: Formula: (let ((.cse2 (select |v_#memory_int_872| v_~q1~0.base_509))) (let ((.cse1 (+ 1 (select .cse2 (+ (* v_~q1_front~0_800 4) v_~q1~0.offset_509)))) (.cse0 (select |v_#memory_int_872| v_~q2~0.base_510))) (and (< v_~i~0_699 v_~N~0_514) (= (+ 2 v_~q1_front~0_800) v_~q1_front~0_798) (not (< v_~j~0_787 v_~N~0_514)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_637| 0)) (not (= (ite (and (< v_~q2_back~0_867 (+ v_~n2~0_502 1)) (<= 1 v_~q2_back~0_867)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_125| 0) (not (= (ite (and (<= 0 v_~q1_front~0_800) (< v_~q1_front~0_800 v_~n1~0_490) (< v_~q1_front~0_800 v_~q1_back~0_871)) 1 0) 0)) (not (= (ite (and (<= 0 v_~q2_back~0_869) (< v_~q2_back~0_869 v_~n2~0_502)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_867) v_~q2~0.offset_510 (- 4))) .cse1) 1 0) 0)) (< .cse1 v_~N~0_514) (= |v_thread2Thread1of1ForFork1_#res#1.base_125| 0) (= (+ (select .cse2 (+ v_~q1~0.offset_509 (- 4) (* v_~q1_front~0_798 4))) 1) v_~i~0_697) (= (+ 2 v_~q2_back~0_869) v_~q2_back~0_867) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_637| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_637|) (not (= (ite (= v_~i~0_699 (select .cse0 (+ v_~q2~0.offset_510 (* 4 v_~q2_back~0_869)))) 1 0) 0)) (= (ite (and (< v_~q1_front~0_798 (+ v_~q1_back~0_871 1)) (< v_~q1_front~0_798 (+ v_~n1~0_490 1)) (<= 1 v_~q1_front~0_798)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_637|)))) InVars {~j~0=v_~j~0_787, ~q1~0.offset=v_~q1~0.offset_509, ~q1_front~0=v_~q1_front~0_800, ~n2~0=v_~n2~0_502, ~i~0=v_~i~0_699, ~n1~0=v_~n1~0_490, ~q2~0.offset=v_~q2~0.offset_510, ~N~0=v_~N~0_514, ~q1_back~0=v_~q1_back~0_871, ~q1~0.base=v_~q1~0.base_509, #memory_int=|v_#memory_int_872|, ~q2~0.base=v_~q2~0.base_510, ~q2_back~0=v_~q2_back~0_869} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_371|, ~j~0=v_~j~0_787, ~q1~0.offset=v_~q1~0.offset_509, ~q1_front~0=v_~q1_front~0_798, ~n2~0=v_~n2~0_502, ~i~0=v_~i~0_697, ~n1~0=v_~n1~0_490, ~q2~0.offset=v_~q2~0.offset_510, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_410|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_125|, ~N~0=v_~N~0_514, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_637|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_125|, ~q1_back~0=v_~q1_back~0_871, ~q1~0.base=v_~q1~0.base_509, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_416|, #memory_int=|v_#memory_int_872|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_637|, ~q2~0.base=v_~q2~0.base_510, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_410|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_371|, ~q2_back~0=v_~q2_back~0_867} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-06 05:51:08,206 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:08,207 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:09,460 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:51:09,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3749 [2022-12-06 05:51:09,461 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 338 transitions, 12856 flow [2022-12-06 05:51:09,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:09,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:51:09,461 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:51:09,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 05:51:09,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:51:09,661 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:51:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:51:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1703609903, now seen corresponding path program 1 times [2022-12-06 05:51:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:51:09,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669595309] [2022-12-06 05:51:09,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:09,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:51:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:51:09,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669595309] [2022-12-06 05:51:09,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669595309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:51:09,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:51:09,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:51:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121702992] [2022-12-06 05:51:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:51:09,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:51:09,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:51:09,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:51:09,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:51:09,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 05:51:09,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 338 transitions, 12856 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:09,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:51:09,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 05:51:09,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:51:10,350 INFO L130 PetriNetUnfolder]: 1353/2561 cut-off events. [2022-12-06 05:51:10,350 INFO L131 PetriNetUnfolder]: For 123456/123456 co-relation queries the response was YES. [2022-12-06 05:51:10,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39024 conditions, 2561 events. 1353/2561 cut-off events. For 123456/123456 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16164 event pairs, 508 based on Foata normal form. 6/2563 useless extension candidates. Maximal degree in co-relation 38840. Up to 1738 conditions per place. [2022-12-06 05:51:10,373 INFO L137 encePairwiseOnDemand]: 46/64 looper letters, 389 selfloop transitions, 17 changer transitions 0/406 dead transitions. [2022-12-06 05:51:10,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 406 transitions, 15814 flow [2022-12-06 05:51:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:51:10,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:51:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-06 05:51:10,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2022-12-06 05:51:10,373 INFO L175 Difference]: Start difference. First operand has 238 places, 338 transitions, 12856 flow. Second operand 4 states and 86 transitions. [2022-12-06 05:51:10,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 406 transitions, 15814 flow [2022-12-06 05:51:10,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 406 transitions, 14838 flow, removed 10 selfloop flow, removed 20 redundant places. [2022-12-06 05:51:10,782 INFO L231 Difference]: Finished difference. Result has 217 places, 333 transitions, 11828 flow [2022-12-06 05:51:10,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=11794, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=11828, PETRI_PLACES=217, PETRI_TRANSITIONS=333} [2022-12-06 05:51:10,783 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 195 predicate places. [2022-12-06 05:51:10,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:51:10,783 INFO L89 Accepts]: Start accepts. Operand has 217 places, 333 transitions, 11828 flow [2022-12-06 05:51:10,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:51:10,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:51:10,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 333 transitions, 11828 flow [2022-12-06 05:51:10,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 333 transitions, 11828 flow [2022-12-06 05:51:10,961 INFO L130 PetriNetUnfolder]: 523/1329 cut-off events. [2022-12-06 05:51:10,961 INFO L131 PetriNetUnfolder]: For 49836/49852 co-relation queries the response was YES. [2022-12-06 05:51:10,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18087 conditions, 1329 events. 523/1329 cut-off events. For 49836/49852 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9785 event pairs, 119 based on Foata normal form. 8/1219 useless extension candidates. Maximal degree in co-relation 17388. Up to 510 conditions per place. [2022-12-06 05:51:10,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 333 transitions, 11828 flow [2022-12-06 05:51:10,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-06 05:51:10,978 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:51:10,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:51:10,979 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 333 transitions, 11828 flow [2022-12-06 05:51:10,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:10,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:51:10,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:51:10,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 05:51:10,979 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:51:10,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:51:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1874060970, now seen corresponding path program 1 times [2022-12-06 05:51:10,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:51:10,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936996762] [2022-12-06 05:51:10,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:10,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:51:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:11,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:51:11,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936996762] [2022-12-06 05:51:11,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936996762] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:51:11,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138388273] [2022-12-06 05:51:11,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:11,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:51:11,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:51:11,880 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:51:11,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 05:51:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:12,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 05:51:12,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:51:12,133 INFO L321 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2022-12-06 05:51:12,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2022-12-06 05:51:12,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 05:51:12,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:51:12,202 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 05:51:12,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-06 05:51:12,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-06 05:51:12,333 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 05:51:12,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 20 [2022-12-06 05:51:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:51:12,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:51:12,585 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (* c_~q1_back~0 4)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (* c_~q1_front~0 4)) (.cse5 (+ c_~i~0 1))) (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_2752 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2752))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 (+ .cse1 ~q1~0.offset)))) (< (select .cse0 (+ .cse2 ~q1~0.offset)) c_~i~0) (< (select (select .cse3 c_~q2~0.base) .cse4) .cse5))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_2752 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2752))) (let ((.cse6 (select .cse7 ~q1~0.base))) (or (not (= c_~j~0 (select .cse6 (+ .cse1 ~q1~0.offset)))) (< (select (select .cse7 c_~q2~0.base) .cse4) c_~i~0) (< (select .cse6 (+ .cse2 ~q1~0.offset)) .cse5))))))) (not (< c_~q2_back~0 c_~n2~0)) (not (<= 0 c_~q2_back~0)) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) is different from false [2022-12-06 05:51:12,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:51:12,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 129 [2022-12-06 05:51:12,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:51:12,819 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 690 treesize of output 850 [2022-12-06 05:51:12,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:51:12,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 618 treesize of output 762 [2022-12-06 05:51:12,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:51:12,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 548 [2022-12-06 05:51:13,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:51:13,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 507 treesize of output 492 Received shutdown request... [2022-12-06 05:56:20,436 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 05:56:20,438 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 05:56:20,444 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:56:20,444 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:56:20,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 05:56:20,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:56:20,644 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 19ms.. [2022-12-06 05:56:20,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 05:56:20,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 05:56:20,646 INFO L458 BasicCegarLoop]: Path program histogram: [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:56:20,648 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:56:20,648 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:56:20,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:56:20 BasicIcfg [2022-12-06 05:56:20,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:56:20,650 INFO L158 Benchmark]: Toolchain (without parser) took 830038.38ms. Allocated memory was 183.5MB in the beginning and 1.0GB in the end (delta: 832.6MB). Free memory was 159.6MB in the beginning and 639.2MB in the end (delta: -479.5MB). Peak memory consumption was 662.8MB. Max. memory is 8.0GB. [2022-12-06 05:56:20,651 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:56:20,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.42ms. Allocated memory is still 183.5MB. Free memory was 159.6MB in the beginning and 147.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:56:20,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.81ms. Allocated memory is still 183.5MB. Free memory was 147.0MB in the beginning and 144.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:56:20,651 INFO L158 Benchmark]: Boogie Preprocessor took 22.21ms. Allocated memory is still 183.5MB. Free memory was 144.9MB in the beginning and 142.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:56:20,652 INFO L158 Benchmark]: RCFGBuilder took 646.20ms. Allocated memory is still 183.5MB. Free memory was 142.8MB in the beginning and 115.1MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 05:56:20,652 INFO L158 Benchmark]: TraceAbstraction took 829153.27ms. Allocated memory was 183.5MB in the beginning and 1.0GB in the end (delta: 832.6MB). Free memory was 114.5MB in the beginning and 639.2MB in the end (delta: -524.6MB). Peak memory consumption was 617.8MB. Max. memory is 8.0GB. [2022-12-06 05:56:20,653 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 183.5MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.42ms. Allocated memory is still 183.5MB. Free memory was 159.6MB in the beginning and 147.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.81ms. Allocated memory is still 183.5MB. Free memory was 147.0MB in the beginning and 144.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.21ms. Allocated memory is still 183.5MB. Free memory was 144.9MB in the beginning and 142.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 646.20ms. Allocated memory is still 183.5MB. Free memory was 142.8MB in the beginning and 115.1MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 829153.27ms. Allocated memory was 183.5MB in the beginning and 1.0GB in the end (delta: 832.6MB). Free memory was 114.5MB in the beginning and 639.2MB in the end (delta: -524.6MB). Peak memory consumption was 617.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 147 PlacesBefore, 22 PlacesAfterwards, 153 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 106 TrivialYvCompositions, 19 ConcurrentYvCompositions, 9 ChoiceCompositions, 134 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 301, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 294, independent: 286, independent conditional: 0, independent unconditional: 286, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 294, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 294, unknown conditional: 0, unknown unconditional: 294] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 469, Positive conditional cache size: 0, Positive unconditional cache size: 469, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 21 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 32 PlacesBefore, 31 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 36 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.5s, 76 PlacesBefore, 70 PlacesAfterwards, 108 TransitionsBefore, 102 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 13, independent conditional: 8, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 20, Positive conditional cache size: 10, Positive unconditional cache size: 10, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.5s, 103 PlacesBefore, 97 PlacesAfterwards, 230 TransitionsBefore, 224 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 10 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 56, independent conditional: 49, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 49, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 11, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 42, independent conditional: 38, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 11, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 40, Positive conditional cache size: 21, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 191 TransitionsBefore, 191 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 40, Positive conditional cache size: 21, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 418 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 40, Positive conditional cache size: 21, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 40, Positive conditional cache size: 21, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 81 PlacesBefore, 81 PlacesAfterwards, 148 TransitionsBefore, 148 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 44, Positive conditional cache size: 25, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 107 PlacesBefore, 103 PlacesAfterwards, 175 TransitionsBefore, 171 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 47, Positive conditional cache size: 28, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 109 PlacesBefore, 109 PlacesAfterwards, 178 TransitionsBefore, 177 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 9, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 9, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 54, Positive conditional cache size: 31, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 54, Positive conditional cache size: 31, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 108 PlacesBefore, 106 PlacesAfterwards, 175 TransitionsBefore, 173 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 60, Positive conditional cache size: 32, Positive unconditional cache size: 28, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 117 PlacesBefore, 114 PlacesAfterwards, 182 TransitionsBefore, 179 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 25, independent conditional: 22, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 22, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 19, independent conditional: 18, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 77, Positive conditional cache size: 36, Positive unconditional cache size: 41, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 99 PlacesBefore, 97 PlacesAfterwards, 167 TransitionsBefore, 165 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 77, Positive conditional cache size: 36, Positive unconditional cache size: 41, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 252 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): 83, Positive cache size: 77, Positive conditional cache size: 36, Positive unconditional cache size: 41, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 103 PlacesBefore, 102 PlacesAfterwards, 136 TransitionsBefore, 135 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 81, Positive conditional cache size: 36, Positive unconditional cache size: 45, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 240 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): 87, Positive cache size: 81, Positive conditional cache size: 36, Positive unconditional cache size: 45, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.8s, 106 PlacesBefore, 103 PlacesAfterwards, 165 TransitionsBefore, 161 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 8, independent: 6, independent conditional: 6, 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): 94, Positive cache size: 88, Positive conditional cache size: 38, Positive unconditional cache size: 50, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 113 PlacesBefore, 113 PlacesAfterwards, 180 TransitionsBefore, 180 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 94, Positive conditional cache size: 39, Positive unconditional cache size: 55, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 133 PlacesBefore, 132 PlacesAfterwards, 219 TransitionsBefore, 218 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 100, Positive conditional cache size: 45, Positive unconditional cache size: 55, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 131 PlacesBefore, 131 PlacesAfterwards, 213 TransitionsBefore, 213 TransitionsAfterwards, 354 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): 106, Positive cache size: 100, Positive conditional cache size: 45, Positive unconditional cache size: 55, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 153 PlacesBefore, 153 PlacesAfterwards, 243 TransitionsBefore, 243 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 104, Positive conditional cache size: 45, Positive unconditional cache size: 59, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 160 PlacesBefore, 157 PlacesAfterwards, 251 TransitionsBefore, 248 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 107, Positive conditional cache size: 46, Positive unconditional cache size: 61, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 150 PlacesBefore, 150 PlacesAfterwards, 256 TransitionsBefore, 256 TransitionsAfterwards, 436 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): 113, Positive cache size: 107, Positive conditional cache size: 46, Positive unconditional cache size: 61, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 171 PlacesBefore, 170 PlacesAfterwards, 277 TransitionsBefore, 276 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 108, Positive conditional cache size: 46, Positive unconditional cache size: 62, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 183 PlacesBefore, 181 PlacesAfterwards, 301 TransitionsBefore, 299 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 109, Positive conditional cache size: 47, Positive unconditional cache size: 62, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 161 PlacesBefore, 158 PlacesAfterwards, 212 TransitionsBefore, 209 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 113, Positive conditional cache size: 47, Positive unconditional cache size: 66, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 177 PlacesBefore, 173 PlacesAfterwards, 232 TransitionsBefore, 230 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 4, independent conditional: 4, 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): 126, Positive cache size: 120, Positive conditional cache size: 47, Positive unconditional cache size: 73, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 192 PlacesBefore, 189 PlacesAfterwards, 268 TransitionsBefore, 265 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 122, Positive conditional cache size: 49, Positive unconditional cache size: 73, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 215 PlacesBefore, 212 PlacesAfterwards, 321 TransitionsBefore, 318 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 124, Positive conditional cache size: 51, Positive unconditional cache size: 73, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 221 PlacesBefore, 220 PlacesAfterwards, 328 TransitionsBefore, 327 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 128, Positive conditional cache size: 55, Positive unconditional cache size: 73, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 207 PlacesBefore, 207 PlacesAfterwards, 294 TransitionsBefore, 295 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 132, Positive conditional cache size: 59, Positive unconditional cache size: 73, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 219 PlacesBefore, 219 PlacesAfterwards, 290 TransitionsBefore, 289 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 139, Positive conditional cache size: 63, Positive unconditional cache size: 76, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 226 PlacesBefore, 225 PlacesAfterwards, 289 TransitionsBefore, 288 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 141, Positive conditional cache size: 65, Positive unconditional cache size: 76, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 225 PlacesBefore, 224 PlacesAfterwards, 290 TransitionsBefore, 289 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 9, independent conditional: 7, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 144, Positive conditional cache size: 68, Positive unconditional cache size: 76, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 216 PlacesBefore, 215 PlacesAfterwards, 308 TransitionsBefore, 307 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 145, Positive conditional cache size: 69, Positive unconditional cache size: 76, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 217 PlacesBefore, 217 PlacesAfterwards, 335 TransitionsBefore, 335 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 145, Positive conditional cache size: 69, Positive unconditional cache size: 76, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 232 PlacesBefore, 232 PlacesAfterwards, 336 TransitionsBefore, 336 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 145, Positive conditional cache size: 69, Positive unconditional cache size: 76, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 240 PlacesBefore, 238 PlacesAfterwards, 339 TransitionsBefore, 338 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 148, Positive conditional cache size: 72, Positive unconditional cache size: 76, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 217 PlacesBefore, 217 PlacesAfterwards, 333 TransitionsBefore, 333 TransitionsAfterwards, 642 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): 154, Positive cache size: 148, Positive conditional cache size: 72, Positive unconditional cache size: 76, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 19ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 19ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 19ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 171 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 829.0s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 110.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 212 mSolverCounterUnknown, 4281 SdHoareTripleChecker+Valid, 30.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4281 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 27.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 336 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21780 IncrementalHoareTripleChecker+Invalid, 24739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2411 mSolverCounterUnsat, 0 mSDtfsCounter, 21780 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1320 GetRequests, 432 SyntacticMatches, 41 SemanticMatches, 847 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4444 ImplicationChecksByTransitivity, 79.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12856occurred in iteration=44, InterpolantAutomatonStates: 608, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 301.3s InterpolantComputationTime, 990 NumberOfCodeBlocks, 990 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 1249 ConstructedInterpolants, 92 QuantifiedInterpolants, 51374 SizeOfPredicates, 575 NumberOfNonLiveVariables, 7451 ConjunctsInSsa, 1257 ConjunctsInUnsatCore, 104 InterpolantComputations, 17 PerfectInterpolantSequences, 29/167 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