/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:41:53,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:41:53,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:41:53,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:41:53,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:41:53,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:41:53,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:41:53,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:41:53,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:41:53,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:41:53,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:41:53,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:41:53,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:41:53,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:41:53,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:41:53,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:41:53,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:41:53,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:41:53,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:41:53,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:41:53,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:41:53,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:41:53,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:41:53,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:41:53,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:41:53,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:41:53,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:41:53,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:41:53,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:41:53,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:41:53,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:41:53,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:41:53,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:41:53,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:41:53,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:41:53,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:41:53,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:41:53,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:41:53,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:41:53,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:41:53,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:41:53,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:41:53,628 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:41:53,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:41:53,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:41:53,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:41:53,630 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:41:53,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:41:53,631 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:41:53,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:41:53,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:41:53,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:41:53,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:41:53,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:41:53,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:41:53,632 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:41:53,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:41:53,633 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:41:53,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:41:53,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:41:53,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:41:53,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:41:53,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:41:53,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:41:53,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:41:53,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:41:53,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:41:53,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:41:53,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:41:53,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:41:53,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:41:53,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:41:53,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:41:53,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:41:53,977 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:41:53,979 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:41:53,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-12-06 07:41:55,084 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:41:55,302 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:41:55,303 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-12-06 07:41:55,310 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8f6cbda/35c4e44d9aed44cd86e758ae44ebd9f8/FLAG8fb2e0763 [2022-12-06 07:41:55,326 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8f6cbda/35c4e44d9aed44cd86e758ae44ebd9f8 [2022-12-06 07:41:55,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:41:55,329 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:41:55,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:41:55,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:41:55,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:41:55,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc48b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55, skipping insertion in model container [2022-12-06 07:41:55,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:41:55,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:41:55,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:55,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:55,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:55,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:55,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:55,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:55,552 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-more-max-array-hom.wvr.c[2586,2599] [2022-12-06 07:41:55,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:41:55,572 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:41:55,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:55,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:55,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:55,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:55,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:55,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:55,613 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-more-max-array-hom.wvr.c[2586,2599] [2022-12-06 07:41:55,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:41:55,635 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:41:55,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55 WrapperNode [2022-12-06 07:41:55,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:41:55,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:41:55,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:41:55,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:41:55,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,687 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-12-06 07:41:55,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:41:55,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:41:55,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:41:55,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:41:55,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,721 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:41:55,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:41:55,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:41:55,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:41:55,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (1/1) ... [2022-12-06 07:41:55,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:41:55,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:41:55,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:41:55,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:41:55,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:41:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:41:55,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:41:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:41:55,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:41:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:41:55,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:41:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:41:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:41:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:41:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:41:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:41:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:41:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:41:55,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:41:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:41:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:41:55,808 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:41:55,911 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:41:55,912 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:41:56,122 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:41:56,239 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:41:56,240 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:41:56,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:41:56 BoogieIcfgContainer [2022-12-06 07:41:56,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:41:56,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:41:56,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:41:56,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:41:56,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:41:55" (1/3) ... [2022-12-06 07:41:56,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd50b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:41:56, skipping insertion in model container [2022-12-06 07:41:56,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:55" (2/3) ... [2022-12-06 07:41:56,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd50b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:41:56, skipping insertion in model container [2022-12-06 07:41:56,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:41:56" (3/3) ... [2022-12-06 07:41:56,257 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-12-06 07:41:56,274 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:41:56,274 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:41:56,275 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:41:56,398 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:41:56,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 142 transitions, 308 flow [2022-12-06 07:41:56,542 INFO L130 PetriNetUnfolder]: 12/139 cut-off events. [2022-12-06 07:41:56,542 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:41:56,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 12/139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-12-06 07:41:56,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 142 transitions, 308 flow [2022-12-06 07:41:56,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 129 transitions, 276 flow [2022-12-06 07:41:56,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:56,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-06 07:41:56,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 276 flow [2022-12-06 07:41:56,637 INFO L130 PetriNetUnfolder]: 12/129 cut-off events. [2022-12-06 07:41:56,638 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:41:56,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 12/129 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-12-06 07:41:56,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-06 07:41:56,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 07:42:01,748 INFO L203 LiptonReduction]: Total number of compositions: 105 [2022-12-06 07:42:01,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:42:01,768 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;@402da218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:42:01,768 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:42:01,773 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 07:42:01,773 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:42:01,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:01,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:42:01,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:42:01,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:01,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1106873309, now seen corresponding path program 1 times [2022-12-06 07:42:01,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:01,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801078109] [2022-12-06 07:42:01,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:01,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:02,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:02,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801078109] [2022-12-06 07:42:02,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801078109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:42:02,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:42:02,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:42:02,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482199944] [2022-12-06 07:42:02,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:42:02,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:42:02,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:02,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:42:02,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:42:02,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:42:02,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:42:02,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:02,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:42:02,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:02,525 INFO L130 PetriNetUnfolder]: 269/376 cut-off events. [2022-12-06 07:42:02,525 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 07:42:02,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 376 events. 269/376 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 133 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 615. Up to 373 conditions per place. [2022-12-06 07:42:02,531 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 07:42:02,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 114 flow [2022-12-06 07:42:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:42:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:42:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 07:42:02,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:42:02,543 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 30 transitions. [2022-12-06 07:42:02,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 114 flow [2022-12-06 07:42:02,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:42:02,548 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-06 07:42:02,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-06 07:42:02,553 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 07:42:02,554 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:02,555 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 07:42:02,557 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:02,557 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:02,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 07:42:02,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 07:42:02,572 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 07:42:02,572 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:42:02,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-06 07:42:02,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 07:42:02,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 07:42:03,798 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:42:03,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1246 [2022-12-06 07:42:03,800 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-06 07:42:03,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:42:03,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:03,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:42:03,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:42:03,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:42:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:03,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1795349165, now seen corresponding path program 1 times [2022-12-06 07:42:03,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:03,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738926071] [2022-12-06 07:42:03,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:03,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:03,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:03,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738926071] [2022-12-06 07:42:03,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738926071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:42:03,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:42:03,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:42:03,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831857161] [2022-12-06 07:42:03,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:42:03,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:42:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:03,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:42:03,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:42:03,883 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:42:03,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:42:03,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:03,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:42:03,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:03,964 INFO L130 PetriNetUnfolder]: 309/441 cut-off events. [2022-12-06 07:42:03,964 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:42:03,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 441 events. 309/441 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1405 event pairs, 49 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 889. Up to 335 conditions per place. [2022-12-06 07:42:03,967 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 29 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 07:42:03,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 148 flow [2022-12-06 07:42:03,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:42:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:42:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 07:42:03,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-06 07:42:03,969 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 4 states and 41 transitions. [2022-12-06 07:42:03,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 148 flow [2022-12-06 07:42:03,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 34 transitions, 140 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:42:03,970 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 68 flow [2022-12-06 07:42:03,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2022-12-06 07:42:03,971 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-06 07:42:03,971 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:03,971 INFO L89 Accepts]: Start accepts. Operand has 28 places, 25 transitions, 68 flow [2022-12-06 07:42:03,972 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:03,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:03,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 25 transitions, 68 flow [2022-12-06 07:42:03,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 68 flow [2022-12-06 07:42:03,976 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 07:42:03,976 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:42:03,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 4/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2022-12-06 07:42:03,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 25 transitions, 68 flow [2022-12-06 07:42:03,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 07:42:04,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:42:04,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:42:04,054 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 64 flow [2022-12-06 07:42:04,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:42:04,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:04,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:42:04,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:42:04,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:42:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash -257711172, now seen corresponding path program 1 times [2022-12-06 07:42:04,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:04,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540116910] [2022-12-06 07:42:04,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:04,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:04,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:04,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540116910] [2022-12-06 07:42:04,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540116910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:42:04,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:42:04,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:42:04,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601554898] [2022-12-06 07:42:04,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:42:04,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:42:04,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:04,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:42:04,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:42:04,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:42:04,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:42:04,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:04,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:42:04,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:04,332 INFO L130 PetriNetUnfolder]: 464/682 cut-off events. [2022-12-06 07:42:04,332 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-12-06 07:42:04,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 682 events. 464/682 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2193 event pairs, 138 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 1114. Up to 325 conditions per place. [2022-12-06 07:42:04,338 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 54 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2022-12-06 07:42:04,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 64 transitions, 304 flow [2022-12-06 07:42:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:42:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:42:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-06 07:42:04,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-06 07:42:04,341 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 64 flow. Second operand 7 states and 66 transitions. [2022-12-06 07:42:04,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 64 transitions, 304 flow [2022-12-06 07:42:04,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 64 transitions, 270 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 07:42:04,344 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 110 flow [2022-12-06 07:42:04,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-06 07:42:04,345 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 07:42:04,346 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:04,346 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 110 flow [2022-12-06 07:42:04,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:04,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:04,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 110 flow [2022-12-06 07:42:04,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 110 flow [2022-12-06 07:42:04,356 INFO L130 PetriNetUnfolder]: 13/58 cut-off events. [2022-12-06 07:42:04,357 INFO L131 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2022-12-06 07:42:04,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 58 events. 13/58 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 72. Up to 12 conditions per place. [2022-12-06 07:42:04,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 110 flow [2022-12-06 07:42:04,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 07:42:04,359 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:42:04,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:42:04,360 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 110 flow [2022-12-06 07:42:04,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:42:04,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:04,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:42:04,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:42:04,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:42:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 185042541, now seen corresponding path program 1 times [2022-12-06 07:42:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:04,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805100871] [2022-12-06 07:42:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:05,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:05,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805100871] [2022-12-06 07:42:05,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805100871] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:42:05,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971392696] [2022-12-06 07:42:05,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:05,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:05,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:42:05,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:42:05,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:42:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:05,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 07:42:05,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:42:05,427 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 07:42:05,502 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 07:42:05,564 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 07:42:05,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:42:05,714 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 35 treesize of output 33 [2022-12-06 07:42:05,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:42:05,827 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 64 treesize of output 44 [2022-12-06 07:42:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:06,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:42:07,055 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~max1~0 c_~max2~0))) (and (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse0)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse0) (< (+ ~M~0 1) c_~N~0)))) .cse1) (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse2)) (= c_~max1~0 .cse2) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0) (<= .cse2 c_~max2~0)))) (or (and (or .cse1 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) is different from false [2022-12-06 07:42:12,344 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (<= c_~max3~0 c_~max2~0)) (.cse1 (< c_~max2~0 c_~max3~0)) (.cse0 (= c_~max1~0 c_~max2~0))) (and (or (and (or .cse0 .cse1) (or (= c_~max1~0 c_~max3~0) .cse2)) (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (or (< c_~max3~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse5 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= .cse5 c_~max3~0) (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse5)) (< (+ ~M~0 1) c_~N~0))))) .cse2) (or .cse1 (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse7 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= .cse7 c_~max2~0) (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse7)) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse10 (select (select .cse9 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse8)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse8) (< (+ ~M~0 1) c_~N~0)))) (= .cse10 c_~max2~0) (not (< c_~max1~0 .cse10)))))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse11)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse11) (< c_~max1~0 (select (select .cse12 c_~A~0.base) c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) .cse0) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse13 c_~max2~0) (= c_~max1~0 .cse13) (not (< c_~max3~0 .cse13)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse14 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse15 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse15 .cse16) (<= .cse16 c_~max2~0) (not (< c_~max3~0 .cse16)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse15)))))))) is different from false [2022-12-06 07:42:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:13,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971392696] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:42:13,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:42:13,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2022-12-06 07:42:13,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641054423] [2022-12-06 07:42:13,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:42:13,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 07:42:13,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:13,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 07:42:13,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=325, Unknown=2, NotChecked=78, Total=506 [2022-12-06 07:42:13,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 07:42:13,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 110 flow. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:42:13,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:13,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 07:42:13,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:14,314 INFO L130 PetriNetUnfolder]: 711/1092 cut-off events. [2022-12-06 07:42:14,314 INFO L131 PetriNetUnfolder]: For 669/697 co-relation queries the response was YES. [2022-12-06 07:42:14,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3043 conditions, 1092 events. 711/1092 cut-off events. For 669/697 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4260 event pairs, 74 based on Foata normal form. 29/985 useless extension candidates. Maximal degree in co-relation 1365. Up to 658 conditions per place. [2022-12-06 07:42:14,320 INFO L137 encePairwiseOnDemand]: 8/24 looper letters, 77 selfloop transitions, 40 changer transitions 3/122 dead transitions. [2022-12-06 07:42:14,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 122 transitions, 660 flow [2022-12-06 07:42:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:42:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:42:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-12-06 07:42:14,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-06 07:42:14,322 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 110 flow. Second operand 10 states and 115 transitions. [2022-12-06 07:42:14,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 122 transitions, 660 flow [2022-12-06 07:42:14,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 122 transitions, 636 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 07:42:14,327 INFO L231 Difference]: Finished difference. Result has 45 places, 68 transitions, 400 flow [2022-12-06 07:42:14,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=400, PETRI_PLACES=45, PETRI_TRANSITIONS=68} [2022-12-06 07:42:14,328 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2022-12-06 07:42:14,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:14,328 INFO L89 Accepts]: Start accepts. Operand has 45 places, 68 transitions, 400 flow [2022-12-06 07:42:14,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:14,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:14,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 68 transitions, 400 flow [2022-12-06 07:42:14,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 68 transitions, 400 flow [2022-12-06 07:42:14,367 INFO L130 PetriNetUnfolder]: 233/496 cut-off events. [2022-12-06 07:42:14,367 INFO L131 PetriNetUnfolder]: For 338/346 co-relation queries the response was YES. [2022-12-06 07:42:14,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 496 events. 233/496 cut-off events. For 338/346 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2438 event pairs, 70 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 1177. Up to 234 conditions per place. [2022-12-06 07:42:14,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 68 transitions, 400 flow [2022-12-06 07:42:14,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 07:42:14,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [539] L46-4-->L46-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_140| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread1Thread1of1ForFork1_~i~0_30 4))))) (let ((.cse0 (< v_~max1~0_57 .cse1))) (or (and .cse0 (= v_~max1~0_56 .cse1)) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~max1~0_57 v_~max1~0_56))))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~max1~0=v_~max1~0_57, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_24|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_30, ~N~0=v_~N~0_51} OutVars{~max1~0=v_~max1~0_56, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_13|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:42:14,512 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 07:42:17,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [539] L46-4-->L46-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_140| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread1Thread1of1ForFork1_~i~0_30 4))))) (let ((.cse0 (< v_~max1~0_57 .cse1))) (or (and .cse0 (= v_~max1~0_56 .cse1)) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~max1~0_57 v_~max1~0_56))))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~max1~0=v_~max1~0_57, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_24|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_30, ~N~0=v_~N~0_51} OutVars{~max1~0=v_~max1~0_56, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_13|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:42:17,308 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 07:42:17,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73} OutVars{~max1~0=v_~max1~0_70, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:42:17,507 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 07:42:17,619 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:42:17,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3292 [2022-12-06 07:42:17,620 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 67 transitions, 439 flow [2022-12-06 07:42:17,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:42:17,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:17,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:42:17,631 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 07:42:17,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:17,827 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:42:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1595953813, now seen corresponding path program 1 times [2022-12-06 07:42:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:17,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809569082] [2022-12-06 07:42:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:17,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:18,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:18,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809569082] [2022-12-06 07:42:18,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809569082] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:42:18,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279108324] [2022-12-06 07:42:18,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:18,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:18,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:42:18,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:42:18,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:42:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:18,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 07:42:18,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:42:18,896 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 07:42:18,900 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 07:42:18,936 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 07:42:18,987 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 07:42:19,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:42:19,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 89 [2022-12-06 07:42:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:19,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:42:21,260 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (= c_~max1~0 c_~max2~0)) (.cse2 (< c_~max2~0 c_~max3~0))) (and (or (forall ((~M~0 Int) (v_ArrVal_166 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_166) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (< 0 ~M~0) (< c_~max3~0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4)))) (< ~M~0 0) (= .cse0 c_~max2~0))))) .cse2) (forall ((~M~0 Int) (v_ArrVal_165 (Array Int Int))) (or (< 0 ~M~0) (forall ((v_ArrVal_166 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_166) c_~A~0.base))) (let ((.cse3 (select .cse4 c_~A~0.offset))) (or (not (< c_~max1~0 .cse3)) (< c_~max3~0 (select .cse4 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse3 c_~max3~0))))) (< ~M~0 0))) (forall ((v_ArrVal_166 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_166) c_~A~0.base))) (let ((.cse5 (select .cse7 c_~A~0.offset))) (or (not (< c_~max1~0 .cse5)) (forall ((~M~0 Int)) (let ((.cse6 (select .cse7 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse6)) (< 0 ~M~0) (< c_~max2~0 .cse6) (< ~M~0 0)))) (= .cse5 c_~max2~0))))) (forall ((v_ArrVal_166 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_166) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse8 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse8)) (<= .cse8 c_~max2~0) (= c_~max1~0 .cse8) (< 0 ~M~0) (< ~M~0 0)))) (< c_~max1~0 (select .cse9 c_~A~0.offset))))) (or (forall ((~M~0 Int) (v_ArrVal_166 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_166) c_~A~0.base))) (let ((.cse10 (select .cse11 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse10)) (< 0 ~M~0) (< c_~max2~0 .cse10) (< ~M~0 0) (< c_~max1~0 (select .cse11 c_~A~0.offset)))))) .cse12) (or (and (or .cse12 .cse2) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((~M~0 Int) (v_ArrVal_166 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_166) c_~A~0.base))) (or (< 0 ~M~0) (< c_~max3~0 (select .cse13 (+ c_~A~0.offset (* ~M~0 4)))) (< ~M~0 0) (< c_~max1~0 (select .cse13 c_~A~0.offset)))))))) is different from false [2022-12-06 07:42:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:21,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279108324] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:42:21,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:42:21,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2022-12-06 07:42:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523754432] [2022-12-06 07:42:21,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:42:21,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 07:42:21,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:21,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 07:42:21,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=403, Unknown=6, NotChecked=44, Total=600 [2022-12-06 07:42:21,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 07:42:21,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 67 transitions, 439 flow. Second operand has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:42:21,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:21,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 07:42:21,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:26,629 INFO L130 PetriNetUnfolder]: 1218/1905 cut-off events. [2022-12-06 07:42:26,629 INFO L131 PetriNetUnfolder]: For 3739/3785 co-relation queries the response was YES. [2022-12-06 07:42:26,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7181 conditions, 1905 events. 1218/1905 cut-off events. For 3739/3785 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8723 event pairs, 188 based on Foata normal form. 48/1950 useless extension candidates. Maximal degree in co-relation 6633. Up to 1040 conditions per place. [2022-12-06 07:42:26,644 INFO L137 encePairwiseOnDemand]: 12/31 looper letters, 123 selfloop transitions, 110 changer transitions 8/243 dead transitions. [2022-12-06 07:42:26,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 243 transitions, 1922 flow [2022-12-06 07:42:26,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 07:42:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 07:42:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 226 transitions. [2022-12-06 07:42:26,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27001194743130225 [2022-12-06 07:42:26,646 INFO L175 Difference]: Start difference. First operand has 44 places, 67 transitions, 439 flow. Second operand 27 states and 226 transitions. [2022-12-06 07:42:26,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 243 transitions, 1922 flow [2022-12-06 07:42:26,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 243 transitions, 1872 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-06 07:42:26,672 INFO L231 Difference]: Finished difference. Result has 82 places, 157 transitions, 1451 flow [2022-12-06 07:42:26,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1451, PETRI_PLACES=82, PETRI_TRANSITIONS=157} [2022-12-06 07:42:26,673 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 52 predicate places. [2022-12-06 07:42:26,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:26,673 INFO L89 Accepts]: Start accepts. Operand has 82 places, 157 transitions, 1451 flow [2022-12-06 07:42:26,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:26,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:26,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 157 transitions, 1451 flow [2022-12-06 07:42:26,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 157 transitions, 1451 flow [2022-12-06 07:42:26,768 INFO L130 PetriNetUnfolder]: 509/1064 cut-off events. [2022-12-06 07:42:26,769 INFO L131 PetriNetUnfolder]: For 3113/3131 co-relation queries the response was YES. [2022-12-06 07:42:26,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4345 conditions, 1064 events. 509/1064 cut-off events. For 3113/3131 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6246 event pairs, 83 based on Foata normal form. 11/1068 useless extension candidates. Maximal degree in co-relation 4273. Up to 417 conditions per place. [2022-12-06 07:42:26,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 157 transitions, 1451 flow [2022-12-06 07:42:26,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 746 [2022-12-06 07:42:26,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [566] L70-4-->L58-4: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_25|) (not (< v_thread3Thread1of1ForFork0_~i~2_47 v_~N~0_89)) (let ((.cse1 (select (select |v_#memory_int_197| v_~A~0.base_104) (+ v_~A~0.offset_104 (* 4 v_thread2Thread1of1ForFork2_~i~1_42))))) (let ((.cse0 (< v_~max2~0_81 .cse1))) (or (and (= |v_thread2Thread1of1ForFork2_#t~mem6_37| |v_thread2Thread1of1ForFork2_#t~mem6_36|) (not .cse0) (= v_~max2~0_81 v_~max2~0_80)) (and .cse0 (= v_~max2~0_80 .cse1))))) (< v_thread2Thread1of1ForFork2_~i~1_42 v_~M~0_61) (= (+ v_thread2Thread1of1ForFork2_~i~1_42 1) v_thread2Thread1of1ForFork2_~i~1_41) (= |v_thread3Thread1of1ForFork0_#res.offset_25| 0)) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_37|, ~A~0.base=v_~A~0.base_104, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_42, ~A~0.offset=v_~A~0.offset_104, ~M~0=v_~M~0_61, ~max2~0=v_~max2~0_81, #memory_int=|v_#memory_int_197|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, ~N~0=v_~N~0_89} OutVars{~A~0.base=v_~A~0.base_104, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_25|, ~N~0=v_~N~0_89, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_28|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_36|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, ~A~0.offset=v_~A~0.offset_104, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_20|, ~M~0=v_~M~0_61, ~max2~0=v_~max2~0_80, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_25|, #memory_int=|v_#memory_int_197|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 07:42:26,973 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 07:42:27,121 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse1 (< v_~max3~0_41 .cse0))) (or (and (= v_~max3~0_40 .cse0) .cse1) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~max3~0_41 v_~max3~0_40) (not .cse1))))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_41, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_40, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8] [2022-12-06 07:42:27,235 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 07:42:27,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [565] L70-4-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_47 1) (= |v_thread3Thread1of1ForFork0_#res.offset_23| 0) (< v_thread1Thread1of1ForFork1_~i~0_47 (+ 1 v_~N~0_87)) (let ((.cse0 (select (select |v_#memory_int_195| v_~A~0.base_102) (+ v_~A~0.offset_102 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_47 4))))) (let ((.cse1 (< v_~max1~0_89 .cse0))) (or (and (= .cse0 v_~max1~0_88) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_43| |v_thread1Thread1of1ForFork1_#t~mem3_42|) (not .cse1) (= v_~max1~0_89 v_~max1~0_88))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_23|) (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_87))) InVars {~max1~0=v_~max1~0_89, ~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_43|, #memory_int=|v_#memory_int_195|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, ~N~0=v_~N~0_87} OutVars{~max1~0=v_~max1~0_88, ~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_23|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_42|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_31|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_23|, #memory_int=|v_#memory_int_195|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_23|, ~N~0=v_~N~0_87} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 07:42:27,492 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:42:27,493 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:42:27,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [566] L70-4-->L58-4: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_25|) (not (< v_thread3Thread1of1ForFork0_~i~2_47 v_~N~0_89)) (let ((.cse1 (select (select |v_#memory_int_197| v_~A~0.base_104) (+ v_~A~0.offset_104 (* 4 v_thread2Thread1of1ForFork2_~i~1_42))))) (let ((.cse0 (< v_~max2~0_81 .cse1))) (or (and (= |v_thread2Thread1of1ForFork2_#t~mem6_37| |v_thread2Thread1of1ForFork2_#t~mem6_36|) (not .cse0) (= v_~max2~0_81 v_~max2~0_80)) (and .cse0 (= v_~max2~0_80 .cse1))))) (< v_thread2Thread1of1ForFork2_~i~1_42 v_~M~0_61) (= (+ v_thread2Thread1of1ForFork2_~i~1_42 1) v_thread2Thread1of1ForFork2_~i~1_41) (= |v_thread3Thread1of1ForFork0_#res.offset_25| 0)) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_37|, ~A~0.base=v_~A~0.base_104, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_42, ~A~0.offset=v_~A~0.offset_104, ~M~0=v_~M~0_61, ~max2~0=v_~max2~0_81, #memory_int=|v_#memory_int_197|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, ~N~0=v_~N~0_89} OutVars{~A~0.base=v_~A~0.base_104, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_25|, ~N~0=v_~N~0_89, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_28|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_36|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, ~A~0.offset=v_~A~0.offset_104, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_20|, ~M~0=v_~M~0_61, ~max2~0=v_~max2~0_80, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_25|, #memory_int=|v_#memory_int_197|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 07:42:28,060 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 07:42:28,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse1 (< v_~max3~0_41 .cse0))) (or (and (= v_~max3~0_40 .cse0) .cse1) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~max3~0_41 v_~max3~0_40) (not .cse1))))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_41, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_40, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8] [2022-12-06 07:42:28,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 07:42:28,372 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [574] L70-4-->thread1EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_37|) (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_65 v_~N~0_103)) (let ((.cse1 (select (select |v_#memory_int_214| v_~A~0.base_116) (+ (* v_thread1Thread1of1ForFork1_~i~0_65 4) v_~A~0.offset_116 (- 4))))) (let ((.cse0 (< v_~max1~0_105 .cse1))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_59| |v_thread1Thread1of1ForFork1_#t~mem3_60|) (= v_~max1~0_105 v_~max1~0_104)) (and (= .cse1 v_~max1~0_104) .cse0)))) (= v_thread1Thread1of1ForFork1_~i~0_65 1) (= |v_thread3Thread1of1ForFork0_#res.offset_37| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (< v_thread1Thread1of1ForFork1_~i~0_65 (+ v_~N~0_103 1)) (not (< v_thread1Thread1of1ForFork1_~i~0_65 v_~N~0_103))) InVars {~max1~0=v_~max1~0_105, ~A~0.base=v_~A~0.base_116, ~A~0.offset=v_~A~0.offset_116, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_60|, #memory_int=|v_#memory_int_214|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_65, ~N~0=v_~N~0_103} OutVars{~A~0.base=v_~A~0.base_116, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_65, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_37|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, ~N~0=v_~N~0_103, ~max1~0=v_~max1~0_104, ~A~0.offset=v_~A~0.offset_116, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_33|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_59|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_41|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_37|, #memory_int=|v_#memory_int_214|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork1_#res.offset] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 07:42:28,582 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73} OutVars{~max1~0=v_~max1~0_70, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [566] L70-4-->L58-4: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_25|) (not (< v_thread3Thread1of1ForFork0_~i~2_47 v_~N~0_89)) (let ((.cse1 (select (select |v_#memory_int_197| v_~A~0.base_104) (+ v_~A~0.offset_104 (* 4 v_thread2Thread1of1ForFork2_~i~1_42))))) (let ((.cse0 (< v_~max2~0_81 .cse1))) (or (and (= |v_thread2Thread1of1ForFork2_#t~mem6_37| |v_thread2Thread1of1ForFork2_#t~mem6_36|) (not .cse0) (= v_~max2~0_81 v_~max2~0_80)) (and .cse0 (= v_~max2~0_80 .cse1))))) (< v_thread2Thread1of1ForFork2_~i~1_42 v_~M~0_61) (= (+ v_thread2Thread1of1ForFork2_~i~1_42 1) v_thread2Thread1of1ForFork2_~i~1_41) (= |v_thread3Thread1of1ForFork0_#res.offset_25| 0)) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_37|, ~A~0.base=v_~A~0.base_104, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_42, ~A~0.offset=v_~A~0.offset_104, ~M~0=v_~M~0_61, ~max2~0=v_~max2~0_81, #memory_int=|v_#memory_int_197|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, ~N~0=v_~N~0_89} OutVars{~A~0.base=v_~A~0.base_104, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_25|, ~N~0=v_~N~0_89, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_28|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_36|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, ~A~0.offset=v_~A~0.offset_104, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_20|, ~M~0=v_~M~0_61, ~max2~0=v_~max2~0_80, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_25|, #memory_int=|v_#memory_int_197|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 07:42:28,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73} OutVars{~max1~0=v_~max1~0_70, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 07:42:29,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73} OutVars{~max1~0=v_~max1~0_70, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse1 (< v_~max3~0_41 .cse0))) (or (and (= v_~max3~0_40 .cse0) .cse1) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~max3~0_41 v_~max3~0_40) (not .cse1))))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_41, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_40, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8] [2022-12-06 07:42:29,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73} OutVars{~max1~0=v_~max1~0_70, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [563] L70-4-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_43 (+ v_thread1Thread1of1ForFork1_~i~0_44 1)) (let ((.cse1 (select (select |v_#memory_int_191| v_~A~0.base_98) (+ v_~A~0.offset_98 (* v_thread1Thread1of1ForFork1_~i~0_44 4))))) (let ((.cse0 (< v_~max1~0_85 .cse1))) (or (and .cse0 (= v_~max1~0_84 .cse1)) (and (not .cse0) (= v_~max1~0_85 v_~max1~0_84) (= |v_thread1Thread1of1ForFork1_#t~mem3_39| |v_thread1Thread1of1ForFork1_#t~mem3_38|))))) (= |v_thread3Thread1of1ForFork0_#res.offset_19| 0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_19|) (not (< v_thread3Thread1of1ForFork0_~i~2_41 v_~N~0_83)) (< v_thread1Thread1of1ForFork1_~i~0_44 v_~N~0_83)) InVars {~max1~0=v_~max1~0_85, ~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_39|, #memory_int=|v_#memory_int_191|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_41, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_44, ~N~0=v_~N~0_83} OutVars{~max1~0=v_~max1~0_84, ~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_21|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_38|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_29|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_19|, #memory_int=|v_#memory_int_191|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_41, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_19|, ~N~0=v_~N~0_83} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] [2022-12-06 07:42:29,659 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:42:29,660 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:42:29,887 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:42:29,887 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:42:30,200 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73} OutVars{~max1~0=v_~max1~0_70, ~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 07:42:30,339 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:42:30,339 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:42:30,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:42:30,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:30,541 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork1_#t~mem3_99 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:42:30,544 INFO L158 Benchmark]: Toolchain (without parser) took 35214.63ms. Allocated memory was 169.9MB in the beginning and 392.2MB in the end (delta: 222.3MB). Free memory was 146.6MB in the beginning and 333.2MB in the end (delta: -186.6MB). Peak memory consumption was 240.7MB. Max. memory is 8.0GB. [2022-12-06 07:42:30,544 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 169.9MB. Free memory was 146.0MB in the beginning and 146.0MB in the end (delta: 63.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:42:30,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.61ms. Allocated memory is still 169.9MB. Free memory was 146.1MB in the beginning and 133.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:42:30,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.29ms. Allocated memory is still 169.9MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:42:30,548 INFO L158 Benchmark]: Boogie Preprocessor took 48.16ms. Allocated memory is still 169.9MB. Free memory was 131.4MB in the beginning and 129.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:42:30,548 INFO L158 Benchmark]: RCFGBuilder took 504.76ms. Allocated memory is still 169.9MB. Free memory was 129.8MB in the beginning and 109.9MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 07:42:30,548 INFO L158 Benchmark]: TraceAbstraction took 34291.84ms. Allocated memory was 169.9MB in the beginning and 392.2MB in the end (delta: 222.3MB). Free memory was 109.4MB in the beginning and 333.2MB in the end (delta: -223.8MB). Peak memory consumption was 204.0MB. Max. memory is 8.0GB. [2022-12-06 07:42:30,549 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 169.9MB. Free memory was 146.0MB in the beginning and 146.0MB in the end (delta: 63.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.61ms. Allocated memory is still 169.9MB. Free memory was 146.1MB in the beginning and 133.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.29ms. Allocated memory is still 169.9MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.16ms. Allocated memory is still 169.9MB. Free memory was 131.4MB in the beginning and 129.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 504.76ms. Allocated memory is still 169.9MB. Free memory was 129.8MB in the beginning and 109.9MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 34291.84ms. Allocated memory was 169.9MB in the beginning and 392.2MB in the end (delta: 222.3MB). Free memory was 109.4MB in the beginning and 333.2MB in the end (delta: -223.8MB). Peak memory consumption was 204.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 127 PlacesBefore, 30 PlacesAfterwards, 129 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 67 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 670, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 674, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 674, unknown conditional: 0, unknown unconditional: 674] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1062, Positive conditional cache size: 0, Positive unconditional cache size: 1062, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 28 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 2, independent unconditional: 9, 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: 2, independent unconditional: 9, 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: 2, independent unconditional: 9, 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: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 2, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, 45 PlacesBefore, 44 PlacesAfterwards, 68 TransitionsBefore, 67 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, 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: 48, independent: 48, independent conditional: 20, independent unconditional: 28, 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: 48, independent: 48, independent conditional: 20, independent unconditional: 28, 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: 48, independent: 48, independent conditional: 20, independent unconditional: 28, 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: 16, independent: 16, independent conditional: 9, independent unconditional: 7, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 48, independent: 32, independent conditional: 11, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 9, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 11, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork1_#t~mem3_99 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork1_#t~mem3_99 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:42:30,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...