/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:35:00,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:35:00,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:35:00,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:35:00,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:35:00,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:35:00,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:35:00,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:35:00,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:35:00,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:35:00,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:35:00,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:35:00,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:35:00,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:35:00,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:35:00,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:35:00,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:35:00,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:35:00,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:35:00,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:35:00,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:35:00,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:35:00,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:35:00,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:35:00,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:35:00,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:35:00,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:35:00,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:35:00,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:35:00,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:35:00,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:35:00,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:35:00,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:35:00,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:35:00,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:35:00,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:35:00,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:35:00,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:35:00,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:35:00,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:35:00,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:35:00,772 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:35:00,815 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:35:00,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:35:00,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:35:00,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:35:00,817 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:35:00,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:35:00,817 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:35:00,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:35:00,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:35:00,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:35:00,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:35:00,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:35:00,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:35:00,818 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:35:00,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:35:00,818 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:35:00,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:35:00,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:35:00,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:35:00,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:35:00,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:35:00,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:35:00,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:35:00,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:35:00,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:35:00,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:35:00,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:35:00,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:35:00,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:35:01,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:35:01,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:35:01,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:35:01,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:35:01,264 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:35:01,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-12-06 05:35:02,318 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:35:02,495 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:35:02,497 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-12-06 05:35:02,502 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2abf4aadb/1f71b0e8f05d471f942e474da6bfe7b0/FLAG070f2d2b0 [2022-12-06 05:35:02,516 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2abf4aadb/1f71b0e8f05d471f942e474da6bfe7b0 [2022-12-06 05:35:02,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:35:02,519 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:35:02,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:35:02,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:35:02,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:35:02,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5142d585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02, skipping insertion in model container [2022-12-06 05:35:02,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:35:02,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:35:02,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:02,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:02,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:02,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:02,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:02,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:02,688 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.wvr.c[2553,2566] [2022-12-06 05:35:02,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:35:02,706 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:35:02,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:02,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:02,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:02,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:02,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:02,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:02,734 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.wvr.c[2553,2566] [2022-12-06 05:35:02,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:35:02,764 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:35:02,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02 WrapperNode [2022-12-06 05:35:02,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:35:02,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:35:02,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:35:02,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:35:02,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,815 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-12-06 05:35:02,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:35:02,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:35:02,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:35:02,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:35:02,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,850 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:35:02,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:35:02,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:35:02,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:35:02,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (1/1) ... [2022-12-06 05:35:02,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:35:02,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:02,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:35:02,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:35:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:35:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:35:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:35:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:35:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:35:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:35:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:35:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:35:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:35:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:35:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:35:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:35:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:35:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:35:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:35:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:35:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:35:02,952 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:35:03,153 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:35:03,155 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:35:03,359 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:35:03,417 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:35:03,417 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:35:03,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:35:03 BoogieIcfgContainer [2022-12-06 05:35:03,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:35:03,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:35:03,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:35:03,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:35:03,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:35:02" (1/3) ... [2022-12-06 05:35:03,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4080790c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:35:03, skipping insertion in model container [2022-12-06 05:35:03,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:02" (2/3) ... [2022-12-06 05:35:03,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4080790c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:35:03, skipping insertion in model container [2022-12-06 05:35:03,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:35:03" (3/3) ... [2022-12-06 05:35:03,424 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2022-12-06 05:35:03,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:35:03,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:35:03,437 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:35:03,513 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:35:03,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 05:35:03,616 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-12-06 05:35:03,617 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:35:03,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 12/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-06 05:35:03,622 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 05:35:03,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 128 transitions, 274 flow [2022-12-06 05:35:03,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:03,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-06 05:35:03,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 274 flow [2022-12-06 05:35:03,689 INFO L130 PetriNetUnfolder]: 12/128 cut-off events. [2022-12-06 05:35:03,690 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:35:03,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 12/128 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-06 05:35:03,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-06 05:35:03,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 05:35:08,289 INFO L203 LiptonReduction]: Total number of compositions: 104 [2022-12-06 05:35:08,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:35:08,315 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;@5f99d515, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:35:08,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:35:08,337 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 05:35:08,337 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:35:08,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:08,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:08,338 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 05:35:08,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:08,342 INFO L85 PathProgramCache]: Analyzing trace with hash -833214972, now seen corresponding path program 1 times [2022-12-06 05:35:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:08,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724403686] [2022-12-06 05:35:08,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:08,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724403686] [2022-12-06 05:35:08,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724403686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:08,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:08,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:35:08,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763355143] [2022-12-06 05:35:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:08,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:35:08,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:08,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:35:08,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:35:08,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 05:35:08,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:08,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:08,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 05:35:08,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:08,880 INFO L130 PetriNetUnfolder]: 265/372 cut-off events. [2022-12-06 05:35:08,881 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 05:35:08,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 372 events. 265/372 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1070 event pairs, 132 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 606. Up to 368 conditions per place. [2022-12-06 05:35:08,884 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 05:35:08,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 114 flow [2022-12-06 05:35:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:35:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:35:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 05:35:08,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 05:35:08,896 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 30 transitions. [2022-12-06 05:35:08,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 114 flow [2022-12-06 05:35:08,899 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 05:35:08,900 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-06 05:35:08,901 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 05:35:08,904 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 05:35:08,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:08,905 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:35:08,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:08,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:08,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:35:08,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:35:08,913 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 05:35:08,913 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:35:08,914 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 15 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 05:35:08,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:35:08,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 05:35:09,906 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:35:09,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1003 [2022-12-06 05:35:09,907 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-06 05:35:09,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:09,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:09,908 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 05:35:09,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:35:09,908 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 05:35:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1604053399, now seen corresponding path program 1 times [2022-12-06 05:35:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:09,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041506768] [2022-12-06 05:35:09,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:09,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:09,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041506768] [2022-12-06 05:35:09,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041506768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:09,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:09,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:35:09,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340937757] [2022-12-06 05:35:09,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:09,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:35:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:09,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:35:09,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:35:09,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 05:35:09,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:09,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:09,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 05:35:09,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:10,160 INFO L130 PetriNetUnfolder]: 622/886 cut-off events. [2022-12-06 05:35:10,161 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:35:10,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 886 events. 622/886 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3349 event pairs, 231 based on Foata normal form. 0/584 useless extension candidates. Maximal degree in co-relation 1789. Up to 346 conditions per place. [2022-12-06 05:35:10,166 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 57 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2022-12-06 05:35:10,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 65 transitions, 284 flow [2022-12-06 05:35:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:35:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:35:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-06 05:35:10,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2022-12-06 05:35:10,169 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 6 states and 77 transitions. [2022-12-06 05:35:10,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 65 transitions, 284 flow [2022-12-06 05:35:10,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 65 transitions, 272 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:35:10,170 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 92 flow [2022-12-06 05:35:10,171 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-06 05:35:10,171 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-12-06 05:35:10,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:10,171 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 92 flow [2022-12-06 05:35:10,173 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:10,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:10,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 92 flow [2022-12-06 05:35:10,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 92 flow [2022-12-06 05:35:10,177 INFO L130 PetriNetUnfolder]: 7/49 cut-off events. [2022-12-06 05:35:10,177 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:35:10,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 49 events. 7/49 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 101 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 6 conditions per place. [2022-12-06 05:35:10,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 28 transitions, 92 flow [2022-12-06 05:35:10,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 05:35:10,247 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:35:10,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 05:35:10,249 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 81 flow [2022-12-06 05:35:10,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:10,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:10,249 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 05:35:10,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:35:10,249 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 05:35:10,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash 107427638, now seen corresponding path program 1 times [2022-12-06 05:35:10,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:10,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658471921] [2022-12-06 05:35:10,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:10,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:10,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658471921] [2022-12-06 05:35:10,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658471921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:10,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:10,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:35:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250315116] [2022-12-06 05:35:10,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:10,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:35:10,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:35:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:35:10,327 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 05:35:10,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 81 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:10,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:10,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 05:35:10,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:10,468 INFO L130 PetriNetUnfolder]: 535/808 cut-off events. [2022-12-06 05:35:10,468 INFO L131 PetriNetUnfolder]: For 326/376 co-relation queries the response was YES. [2022-12-06 05:35:10,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 808 events. 535/808 cut-off events. For 326/376 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2865 event pairs, 158 based on Foata normal form. 50/656 useless extension candidates. Maximal degree in co-relation 1228. Up to 386 conditions per place. [2022-12-06 05:35:10,471 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 53 selfloop transitions, 10 changer transitions 3/66 dead transitions. [2022-12-06 05:35:10,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 66 transitions, 335 flow [2022-12-06 05:35:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:35:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:35:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-06 05:35:10,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41714285714285715 [2022-12-06 05:35:10,472 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 81 flow. Second operand 7 states and 73 transitions. [2022-12-06 05:35:10,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 66 transitions, 335 flow [2022-12-06 05:35:10,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 66 transitions, 310 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:35:10,474 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 116 flow [2022-12-06 05:35:10,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-12-06 05:35:10,475 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2022-12-06 05:35:10,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:10,475 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 116 flow [2022-12-06 05:35:10,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:10,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:10,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 116 flow [2022-12-06 05:35:10,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 116 flow [2022-12-06 05:35:10,480 INFO L130 PetriNetUnfolder]: 11/50 cut-off events. [2022-12-06 05:35:10,480 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 05:35:10,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 50 events. 11/50 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 88. Up to 12 conditions per place. [2022-12-06 05:35:10,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 116 flow [2022-12-06 05:35:10,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 05:35:11,681 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:35:11,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1207 [2022-12-06 05:35:11,682 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 112 flow [2022-12-06 05:35:11,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:11,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:11,683 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 05:35:11,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:35:11,683 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 05:35:11,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:11,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1764033824, now seen corresponding path program 1 times [2022-12-06 05:35:11,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:11,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315751448] [2022-12-06 05:35:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:11,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:12,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:12,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315751448] [2022-12-06 05:35:12,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315751448] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:12,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072720026] [2022-12-06 05:35:12,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:12,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:12,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:12,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:35:12,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:35:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:12,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 05:35:12,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:12,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:35:12,646 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 05:35:12,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:35:12,744 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 05:35:12,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:12,798 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 05:35:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:13,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:15,193 WARN L837 $PredicateComparison]: unable to prove that (and (or (= c_~max1~0 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_114 (Array Int Int))) (or (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_114) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (forall ((~M~0 Int) (v_ArrVal_114 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_114) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse0) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse0)) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-12-06 05:35:17,263 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_114) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (or (= c_~max1~0 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (or (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_114) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-12-06 05:35:17,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:17,305 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 265 treesize of output 261 [2022-12-06 05:35:17,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 194 [2022-12-06 05:35:17,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 188 [2022-12-06 05:35:17,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 164 [2022-12-06 05:35:17,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 152 [2022-12-06 05:35:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:17,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072720026] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:17,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:17,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2022-12-06 05:35:17,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015089598] [2022-12-06 05:35:17,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:17,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:35:17,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:17,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:35:17,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=181, Unknown=2, NotChecked=58, Total=306 [2022-12-06 05:35:17,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 05:35:17,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 112 flow. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:17,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:17,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 05:35:17,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:18,317 INFO L130 PetriNetUnfolder]: 641/966 cut-off events. [2022-12-06 05:35:18,317 INFO L131 PetriNetUnfolder]: For 640/687 co-relation queries the response was YES. [2022-12-06 05:35:18,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 966 events. 641/966 cut-off events. For 640/687 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3890 event pairs, 32 based on Foata normal form. 48/874 useless extension candidates. Maximal degree in co-relation 1148. Up to 647 conditions per place. [2022-12-06 05:35:18,322 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 66 selfloop transitions, 22 changer transitions 3/93 dead transitions. [2022-12-06 05:35:18,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 93 transitions, 521 flow [2022-12-06 05:35:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:35:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:35:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-06 05:35:18,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2022-12-06 05:35:18,325 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 112 flow. Second operand 7 states and 87 transitions. [2022-12-06 05:35:18,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 93 transitions, 521 flow [2022-12-06 05:35:18,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 93 transitions, 480 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-12-06 05:35:18,329 INFO L231 Difference]: Finished difference. Result has 39 places, 48 transitions, 256 flow [2022-12-06 05:35:18,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=39, PETRI_TRANSITIONS=48} [2022-12-06 05:35:18,331 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-06 05:35:18,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:18,331 INFO L89 Accepts]: Start accepts. Operand has 39 places, 48 transitions, 256 flow [2022-12-06 05:35:18,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:18,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:18,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 48 transitions, 256 flow [2022-12-06 05:35:18,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 48 transitions, 256 flow [2022-12-06 05:35:18,340 INFO L130 PetriNetUnfolder]: 45/126 cut-off events. [2022-12-06 05:35:18,340 INFO L131 PetriNetUnfolder]: For 67/71 co-relation queries the response was YES. [2022-12-06 05:35:18,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 126 events. 45/126 cut-off events. For 67/71 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 450 event pairs, 0 based on Foata normal form. 4/127 useless extension candidates. Maximal degree in co-relation 275. Up to 46 conditions per place. [2022-12-06 05:35:18,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 48 transitions, 256 flow [2022-12-06 05:35:18,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-06 05:35:18,348 WARN L322 ript$VariableManager]: TermVariable LBE235 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:18,348 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:18,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork2_#res.base_Out_4| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_3 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_4|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_4|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [494] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (let ((.cse0 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse1 (< v_~max2~0_92 .cse0))) (or (and (= v_~max2~0_91 .cse0) .cse1) (and (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse1) (= v_~max2~0_92 v_~max2~0_91))))) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_61, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_36|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_92, #memory_int=|v_#memory_int_116|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_19|, ~A~0.base=v_~A~0.base_61, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_19|, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_35|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_91, #memory_int=|v_#memory_int_116|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0] [2022-12-06 05:35:18,665 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork2_#res.base_Out_4| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_3 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_4|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_4|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [550] $Ultimate##0-->L46-4: Formula: (and (< 0 v_~N~0_87) (let ((.cse1 (select (select |v_#memory_int_176| v_~A~0.base_93) v_~A~0.offset_93))) (let ((.cse0 (< v_~max1~0_67 .cse1))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_19| |v_thread1Thread1of1ForFork0_#t~mem3_20|) (= v_~max1~0_67 v_~max1~0_66)) (and (= v_~max1~0_66 .cse1) .cse0)))) (= v_thread1Thread1of1ForFork0_~i~0_33 1)) InVars {~max1~0=v_~max1~0_67, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_20|, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} OutVars{~max1~0=v_~max1~0_66, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_11|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_19|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:35:18,867 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork2_#res.base_Out_4| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_3 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_4|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_4|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [504] L46-4-->L46-4: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~i~0_30 1) v_thread1Thread1of1ForFork0_~i~0_29) (< v_thread1Thread1of1ForFork0_~i~0_30 v_~N~0_45) (let ((.cse1 (select (select |v_#memory_int_126| v_~A~0.base_69) (+ (* v_thread1Thread1of1ForFork0_~i~0_30 4) v_~A~0.offset_69)))) (let ((.cse0 (< v_~max1~0_41 .cse1))) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem3_16| |v_thread1Thread1of1ForFork0_#t~mem3_15|) (not .cse0) (= v_~max1~0_41 v_~max1~0_40)) (and .cse0 (= v_~max1~0_40 .cse1)))))) InVars {~max1~0=v_~max1~0_41, ~A~0.base=v_~A~0.base_69, ~A~0.offset=v_~A~0.offset_69, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_16|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_30, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_45} OutVars{~max1~0=v_~max1~0_40, ~A~0.base=v_~A~0.base_69, ~A~0.offset=v_~A~0.offset_69, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_9|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_15|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_29, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:35:18,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork2_#res.base_Out_4| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_3 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_4|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_4|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [494] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (let ((.cse0 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse1 (< v_~max2~0_92 .cse0))) (or (and (= v_~max2~0_91 .cse0) .cse1) (and (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse1) (= v_~max2~0_92 v_~max2~0_91))))) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_61, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_36|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_92, #memory_int=|v_#memory_int_116|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_19|, ~A~0.base=v_~A~0.base_61, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_19|, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_35|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_91, #memory_int=|v_#memory_int_116|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0] [2022-12-06 05:35:19,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork2_#res.base_Out_4| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_3 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_4|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_4|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [494] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (let ((.cse0 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse1 (< v_~max2~0_92 .cse0))) (or (and (= v_~max2~0_91 .cse0) .cse1) (and (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse1) (= v_~max2~0_92 v_~max2~0_91))))) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_61, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_36|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_92, #memory_int=|v_#memory_int_116|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_19|, ~A~0.base=v_~A~0.base_61, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_19|, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_35|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_91, #memory_int=|v_#memory_int_116|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0] [2022-12-06 05:35:19,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork2_#res.base_Out_4| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_3 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_4|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_4|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [504] L46-4-->L46-4: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~i~0_30 1) v_thread1Thread1of1ForFork0_~i~0_29) (< v_thread1Thread1of1ForFork0_~i~0_30 v_~N~0_45) (let ((.cse1 (select (select |v_#memory_int_126| v_~A~0.base_69) (+ (* v_thread1Thread1of1ForFork0_~i~0_30 4) v_~A~0.offset_69)))) (let ((.cse0 (< v_~max1~0_41 .cse1))) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem3_16| |v_thread1Thread1of1ForFork0_#t~mem3_15|) (not .cse0) (= v_~max1~0_41 v_~max1~0_40)) (and .cse0 (= v_~max1~0_40 .cse1)))))) InVars {~max1~0=v_~max1~0_41, ~A~0.base=v_~A~0.base_69, ~A~0.offset=v_~A~0.offset_69, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_16|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_30, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_45} OutVars{~max1~0=v_~max1~0_40, ~A~0.base=v_~A~0.base_69, ~A~0.offset=v_~A~0.offset_69, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_9|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_15|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_29, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:35:19,361 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:35:19,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1031 [2022-12-06 05:35:19,362 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 288 flow [2022-12-06 05:35:19,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:19,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:19,362 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 05:35:19,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:35:19,562 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 05:35:19,563 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 05:35:19,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash 590579866, now seen corresponding path program 2 times [2022-12-06 05:35:19,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:19,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052784695] [2022-12-06 05:35:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:19,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:19,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052784695] [2022-12-06 05:35:19,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052784695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:19,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546384911] [2022-12-06 05:35:19,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:35:19,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:19,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:19,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:35:19,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:35:20,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:35:20,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:35:20,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 05:35:20,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:20,262 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-06 05:35:20,263 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 75 treesize of output 65 [2022-12-06 05:35:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:20,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:20,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:20,422 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 75 treesize of output 49 [2022-12-06 05:35:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:20,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546384911] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:20,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:20,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 14 [2022-12-06 05:35:20,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381018866] [2022-12-06 05:35:20,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:20,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:35:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:20,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:35:20,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:35:20,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:35:20,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 288 flow. Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:20,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:20,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:35:20,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:21,012 INFO L130 PetriNetUnfolder]: 871/1308 cut-off events. [2022-12-06 05:35:21,013 INFO L131 PetriNetUnfolder]: For 2604/2604 co-relation queries the response was YES. [2022-12-06 05:35:21,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 1308 events. 871/1308 cut-off events. For 2604/2604 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5079 event pairs, 216 based on Foata normal form. 8/1296 useless extension candidates. Maximal degree in co-relation 4327. Up to 1043 conditions per place. [2022-12-06 05:35:21,022 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 71 selfloop transitions, 32 changer transitions 3/106 dead transitions. [2022-12-06 05:35:21,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 106 transitions, 767 flow [2022-12-06 05:35:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:35:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:35:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-12-06 05:35:21,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3524904214559387 [2022-12-06 05:35:21,024 INFO L175 Difference]: Start difference. First operand has 38 places, 47 transitions, 288 flow. Second operand 9 states and 92 transitions. [2022-12-06 05:35:21,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 106 transitions, 767 flow [2022-12-06 05:35:21,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 106 transitions, 747 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-06 05:35:21,032 INFO L231 Difference]: Finished difference. Result has 51 places, 72 transitions, 574 flow [2022-12-06 05:35:21,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=574, PETRI_PLACES=51, PETRI_TRANSITIONS=72} [2022-12-06 05:35:21,033 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2022-12-06 05:35:21,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:21,033 INFO L89 Accepts]: Start accepts. Operand has 51 places, 72 transitions, 574 flow [2022-12-06 05:35:21,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:21,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:21,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 72 transitions, 574 flow [2022-12-06 05:35:21,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 72 transitions, 574 flow [2022-12-06 05:35:21,057 INFO L130 PetriNetUnfolder]: 69/200 cut-off events. [2022-12-06 05:35:21,057 INFO L131 PetriNetUnfolder]: For 323/330 co-relation queries the response was YES. [2022-12-06 05:35:21,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 200 events. 69/200 cut-off events. For 323/330 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 894 event pairs, 1 based on Foata normal form. 1/192 useless extension candidates. Maximal degree in co-relation 545. Up to 64 conditions per place. [2022-12-06 05:35:21,060 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 72 transitions, 574 flow [2022-12-06 05:35:21,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 512 [2022-12-06 05:35:21,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] and [553] $Ultimate##0-->L46-4: Formula: (let ((.cse2 (select |v_#memory_int_206| v_~A~0.base_110))) (and (let ((.cse1 (select .cse2 v_~A~0.offset_110))) (let ((.cse0 (< v_~max1~0_96 .cse1))) (or (and .cse0 (= .cse1 v_~max1~0_95)) (and (= v_~max1~0_96 v_~max1~0_95) (= |v_thread1Thread1of1ForFork0_#t~mem3_46| |v_thread1Thread1of1ForFork0_#t~mem3_45|) (not .cse0))))) (= 2 v_thread1Thread1of1ForFork0_~i~0_52) (let ((.cse4 (select .cse2 (+ (* v_thread1Thread1of1ForFork0_~i~0_52 4) v_~A~0.offset_110 (- 4))))) (let ((.cse3 (< v_~max1~0_95 .cse4))) (or (and (not .cse3) (= v_~max1~0_95 v_~max1~0_94) (= |v_thread1Thread1of1ForFork0_#t~mem3_45| |v_thread1Thread1of1ForFork0_#t~mem3_44|)) (and (= v_~max1~0_94 .cse4) .cse3)))) (< v_thread1Thread1of1ForFork0_~i~0_52 (+ v_~N~0_103 1)))) InVars {~max1~0=v_~max1~0_96, ~A~0.base=v_~A~0.base_110, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_46|, #memory_int=|v_#memory_int_206|, ~N~0=v_~N~0_103} OutVars{~max1~0=v_~max1~0_94, ~A~0.base=v_~A~0.base_110, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_24|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_44|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_32|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_52, #memory_int=|v_#memory_int_206|, ~N~0=v_~N~0_103} AuxVars[v_~max1~0_95, |v_thread1Thread1of1ForFork0_#t~mem3_45|] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:35:21,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] and [550] $Ultimate##0-->L46-4: Formula: (and (< 0 v_~N~0_87) (let ((.cse1 (select (select |v_#memory_int_176| v_~A~0.base_93) v_~A~0.offset_93))) (let ((.cse0 (< v_~max1~0_67 .cse1))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_19| |v_thread1Thread1of1ForFork0_#t~mem3_20|) (= v_~max1~0_67 v_~max1~0_66)) (and (= v_~max1~0_66 .cse1) .cse0)))) (= v_thread1Thread1of1ForFork0_~i~0_33 1)) InVars {~max1~0=v_~max1~0_67, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_20|, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} OutVars{~max1~0=v_~max1~0_66, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_11|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_19|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:35:21,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [553] $Ultimate##0-->L46-4: Formula: (let ((.cse2 (select |v_#memory_int_206| v_~A~0.base_110))) (and (let ((.cse1 (select .cse2 v_~A~0.offset_110))) (let ((.cse0 (< v_~max1~0_96 .cse1))) (or (and .cse0 (= .cse1 v_~max1~0_95)) (and (= v_~max1~0_96 v_~max1~0_95) (= |v_thread1Thread1of1ForFork0_#t~mem3_46| |v_thread1Thread1of1ForFork0_#t~mem3_45|) (not .cse0))))) (= 2 v_thread1Thread1of1ForFork0_~i~0_52) (let ((.cse4 (select .cse2 (+ (* v_thread1Thread1of1ForFork0_~i~0_52 4) v_~A~0.offset_110 (- 4))))) (let ((.cse3 (< v_~max1~0_95 .cse4))) (or (and (not .cse3) (= v_~max1~0_95 v_~max1~0_94) (= |v_thread1Thread1of1ForFork0_#t~mem3_45| |v_thread1Thread1of1ForFork0_#t~mem3_44|)) (and (= v_~max1~0_94 .cse4) .cse3)))) (< v_thread1Thread1of1ForFork0_~i~0_52 (+ v_~N~0_103 1)))) InVars {~max1~0=v_~max1~0_96, ~A~0.base=v_~A~0.base_110, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_46|, #memory_int=|v_#memory_int_206|, ~N~0=v_~N~0_103} OutVars{~max1~0=v_~max1~0_94, ~A~0.base=v_~A~0.base_110, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_24|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_44|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_32|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_52, #memory_int=|v_#memory_int_206|, ~N~0=v_~N~0_103} AuxVars[v_~max1~0_95, |v_thread1Thread1of1ForFork0_#t~mem3_45|] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:35:21,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [550] $Ultimate##0-->L46-4: Formula: (and (< 0 v_~N~0_87) (let ((.cse1 (select (select |v_#memory_int_176| v_~A~0.base_93) v_~A~0.offset_93))) (let ((.cse0 (< v_~max1~0_67 .cse1))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_19| |v_thread1Thread1of1ForFork0_#t~mem3_20|) (= v_~max1~0_67 v_~max1~0_66)) (and (= v_~max1~0_66 .cse1) .cse0)))) (= v_thread1Thread1of1ForFork0_~i~0_33 1)) InVars {~max1~0=v_~max1~0_67, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_20|, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} OutVars{~max1~0=v_~max1~0_66, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_11|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_19|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:35:21,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] [2022-12-06 05:35:21,559 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:35:21,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 527 [2022-12-06 05:35:21,560 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 71 transitions, 603 flow [2022-12-06 05:35:21,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:21,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:21,561 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 05:35:21,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 05:35:21,761 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 05:35:21,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1307525543, now seen corresponding path program 1 times [2022-12-06 05:35:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:21,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551759780] [2022-12-06 05:35:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:35:21,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:21,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551759780] [2022-12-06 05:35:21,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551759780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:21,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:21,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:35:21,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573828748] [2022-12-06 05:35:21,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:21,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:35:21,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:21,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:35:21,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:35:21,817 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:35:21,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 71 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:21,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:21,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:35:21,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:21,910 INFO L130 PetriNetUnfolder]: 639/967 cut-off events. [2022-12-06 05:35:21,910 INFO L131 PetriNetUnfolder]: For 3890/3972 co-relation queries the response was YES. [2022-12-06 05:35:21,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3932 conditions, 967 events. 639/967 cut-off events. For 3890/3972 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3921 event pairs, 264 based on Foata normal form. 80/1028 useless extension candidates. Maximal degree in co-relation 2960. Up to 949 conditions per place. [2022-12-06 05:35:21,915 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 54 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2022-12-06 05:35:21,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 617 flow [2022-12-06 05:35:21,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:35:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:35:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 05:35:21,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2022-12-06 05:35:21,917 INFO L175 Difference]: Start difference. First operand has 50 places, 71 transitions, 603 flow. Second operand 3 states and 39 transitions. [2022-12-06 05:35:21,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 617 flow [2022-12-06 05:35:21,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 588 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 05:35:21,921 INFO L231 Difference]: Finished difference. Result has 50 places, 61 transitions, 480 flow [2022-12-06 05:35:21,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=50, PETRI_TRANSITIONS=61} [2022-12-06 05:35:21,922 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2022-12-06 05:35:21,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:21,922 INFO L89 Accepts]: Start accepts. Operand has 50 places, 61 transitions, 480 flow [2022-12-06 05:35:21,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:21,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:21,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 61 transitions, 480 flow [2022-12-06 05:35:21,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 61 transitions, 480 flow [2022-12-06 05:35:21,933 INFO L130 PetriNetUnfolder]: 55/156 cut-off events. [2022-12-06 05:35:21,933 INFO L131 PetriNetUnfolder]: For 320/329 co-relation queries the response was YES. [2022-12-06 05:35:21,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 156 events. 55/156 cut-off events. For 320/329 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 614 event pairs, 0 based on Foata normal form. 5/159 useless extension candidates. Maximal degree in co-relation 479. Up to 50 conditions per place. [2022-12-06 05:35:21,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 61 transitions, 480 flow [2022-12-06 05:35:21,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 05:35:21,934 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:21,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:35:21,935 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 61 transitions, 480 flow [2022-12-06 05:35:21,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:21,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:21,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:21,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:35:21,935 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:21,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:21,936 INFO L85 PathProgramCache]: Analyzing trace with hash 533309898, now seen corresponding path program 1 times [2022-12-06 05:35:21,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:21,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460062742] [2022-12-06 05:35:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:35:21,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:21,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460062742] [2022-12-06 05:35:21,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460062742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:21,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:21,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:35:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503212852] [2022-12-06 05:35:21,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:21,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:35:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:21,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:35:21,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:35:21,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 05:35:21,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 61 transitions, 480 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 05:35:21,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:21,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 05:35:21,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:22,071 INFO L130 PetriNetUnfolder]: 553/878 cut-off events. [2022-12-06 05:35:22,071 INFO L131 PetriNetUnfolder]: For 3382/3456 co-relation queries the response was YES. [2022-12-06 05:35:22,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 878 events. 553/878 cut-off events. For 3382/3456 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3785 event pairs, 156 based on Foata normal form. 136/1001 useless extension candidates. Maximal degree in co-relation 3401. Up to 750 conditions per place. [2022-12-06 05:35:22,076 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 51 selfloop transitions, 9 changer transitions 1/67 dead transitions. [2022-12-06 05:35:22,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 629 flow [2022-12-06 05:35:22,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:35:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:35:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 05:35:22,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2022-12-06 05:35:22,077 INFO L175 Difference]: Start difference. First operand has 50 places, 61 transitions, 480 flow. Second operand 4 states and 49 transitions. [2022-12-06 05:35:22,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 629 flow [2022-12-06 05:35:22,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 628 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:35:22,081 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 443 flow [2022-12-06 05:35:22,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=443, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2022-12-06 05:35:22,082 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2022-12-06 05:35:22,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:22,082 INFO L89 Accepts]: Start accepts. Operand has 52 places, 55 transitions, 443 flow [2022-12-06 05:35:22,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:22,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:22,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 55 transitions, 443 flow [2022-12-06 05:35:22,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 443 flow [2022-12-06 05:35:22,091 INFO L130 PetriNetUnfolder]: 37/133 cut-off events. [2022-12-06 05:35:22,091 INFO L131 PetriNetUnfolder]: For 308/318 co-relation queries the response was YES. [2022-12-06 05:35:22,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 133 events. 37/133 cut-off events. For 308/318 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 546 event pairs, 0 based on Foata normal form. 6/137 useless extension candidates. Maximal degree in co-relation 408. Up to 33 conditions per place. [2022-12-06 05:35:22,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 55 transitions, 443 flow [2022-12-06 05:35:22,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 05:35:22,615 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:35:22,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 565 [2022-12-06 05:35:22,647 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 493 flow [2022-12-06 05:35:22,647 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 05:35:22,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:22,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:22,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:35:22,648 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:22,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1894231828, now seen corresponding path program 1 times [2022-12-06 05:35:22,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:22,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754797735] [2022-12-06 05:35:22,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:22,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:22,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:22,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754797735] [2022-12-06 05:35:22,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754797735] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:22,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353991146] [2022-12-06 05:35:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:22,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:22,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:22,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:35:22,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:35:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:22,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:35:22,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:22,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:22,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353991146] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:22,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:35:22,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2022-12-06 05:35:22,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453202270] [2022-12-06 05:35:22,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:22,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:35:22,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:22,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:35:22,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:35:22,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:35:22,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 59 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:22,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:22,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:35:22,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:23,104 INFO L130 PetriNetUnfolder]: 906/1423 cut-off events. [2022-12-06 05:35:23,105 INFO L131 PetriNetUnfolder]: For 4618/4618 co-relation queries the response was YES. [2022-12-06 05:35:23,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5434 conditions, 1423 events. 906/1423 cut-off events. For 4618/4618 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6507 event pairs, 57 based on Foata normal form. 80/1463 useless extension candidates. Maximal degree in co-relation 5413. Up to 724 conditions per place. [2022-12-06 05:35:23,112 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 86 selfloop transitions, 27 changer transitions 13/126 dead transitions. [2022-12-06 05:35:23,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 126 transitions, 1237 flow [2022-12-06 05:35:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:35:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:35:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-06 05:35:23,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35064935064935066 [2022-12-06 05:35:23,113 INFO L175 Difference]: Start difference. First operand has 53 places, 59 transitions, 493 flow. Second operand 7 states and 81 transitions. [2022-12-06 05:35:23,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 126 transitions, 1237 flow [2022-12-06 05:35:23,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 126 transitions, 1205 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:35:23,123 INFO L231 Difference]: Finished difference. Result has 60 places, 70 transitions, 689 flow [2022-12-06 05:35:23,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=689, PETRI_PLACES=60, PETRI_TRANSITIONS=70} [2022-12-06 05:35:23,125 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2022-12-06 05:35:23,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:23,125 INFO L89 Accepts]: Start accepts. Operand has 60 places, 70 transitions, 689 flow [2022-12-06 05:35:23,127 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:23,127 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:23,127 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 70 transitions, 689 flow [2022-12-06 05:35:23,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 70 transitions, 689 flow [2022-12-06 05:35:23,143 INFO L130 PetriNetUnfolder]: 97/274 cut-off events. [2022-12-06 05:35:23,144 INFO L131 PetriNetUnfolder]: For 1091/1139 co-relation queries the response was YES. [2022-12-06 05:35:23,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 274 events. 97/274 cut-off events. For 1091/1139 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1516 event pairs, 0 based on Foata normal form. 9/272 useless extension candidates. Maximal degree in co-relation 1033. Up to 86 conditions per place. [2022-12-06 05:35:23,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 70 transitions, 689 flow [2022-12-06 05:35:23,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-06 05:35:23,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] and [405] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] [2022-12-06 05:35:23,478 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L70-4-->thread1EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork2_~i~2_70 v_~N~0_137)) (= |v_thread3Thread1of1ForFork2_#res.offset_31| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (< 0 v_~N~0_137) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0) (= v_thread1Thread1of1ForFork0_~i~0_84 1) (not (< v_thread1Thread1of1ForFork0_~i~0_84 v_~N~0_137)) (let ((.cse1 (select (select |v_#memory_int_246| v_~A~0.base_144) v_~A~0.offset_144))) (let ((.cse0 (< v_~max1~0_158 .cse1))) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem3_107| |v_thread1Thread1of1ForFork0_#t~mem3_106|) (= v_~max1~0_158 v_~max1~0_157) (not .cse0)) (and (= v_~max1~0_157 .cse1) .cse0)))) (= |v_thread3Thread1of1ForFork2_#res.base_31| 0)) InVars {~max1~0=v_~max1~0_158, ~A~0.base=v_~A~0.base_144, ~A~0.offset=v_~A~0.offset_144, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_107|, #memory_int=|v_#memory_int_246|, ~N~0=v_~N~0_137, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_70} OutVars{~A~0.base=v_~A~0.base_144, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_31|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~N~0=v_~N~0_137, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_31|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_70, ~max1~0=v_~max1~0_157, ~A~0.offset=v_~A~0.offset_144, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_52|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_106|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_60|, #memory_int=|v_#memory_int_246|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base] and [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] [2022-12-06 05:35:23,588 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [566] L70-4-->thread1EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_29| 0) (let ((.cse0 (select (select |v_#memory_int_244| v_~A~0.base_142) v_~A~0.offset_142))) (let ((.cse1 (< v_~max1~0_154 .cse0))) (or (and (= .cse0 v_~max1~0_153) .cse1) (and (not .cse1) (= v_~max1~0_154 v_~max1~0_153) (= |v_thread1Thread1of1ForFork0_#t~mem3_103| |v_thread1Thread1of1ForFork0_#t~mem3_102|))))) (< 0 v_~N~0_135) (= |v_thread1Thread1of1ForFork0_#res.offset_17| 0) (= v_thread1Thread1of1ForFork0_~i~0_82 1) (not (< v_thread1Thread1of1ForFork0_~i~0_82 v_~N~0_135)) (not (< v_thread3Thread1of1ForFork2_~i~2_68 v_~N~0_135)) (= |v_thread3Thread1of1ForFork2_#res.offset_29| 0) (= |v_thread1Thread1of1ForFork0_#res.base_17| 0)) InVars {~max1~0=v_~max1~0_154, ~A~0.base=v_~A~0.base_142, ~A~0.offset=v_~A~0.offset_142, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_103|, #memory_int=|v_#memory_int_244|, ~N~0=v_~N~0_135, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_68} OutVars{~A~0.base=v_~A~0.base_142, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_82, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_29|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_17|, ~N~0=v_~N~0_135, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_29|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_68, ~max1~0=v_~max1~0_153, ~A~0.offset=v_~A~0.offset_142, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_50|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_102|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_58|, #memory_int=|v_#memory_int_244|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base] and [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] [2022-12-06 05:35:23,706 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork2_#res.base_Out_4| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_3 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_4|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_4|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_3} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] [2022-12-06 05:35:23,739 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:35:23,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 615 [2022-12-06 05:35:23,740 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 71 transitions, 736 flow [2022-12-06 05:35:23,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:23,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:23,740 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:23,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:35:23,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:23,941 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1780979465, now seen corresponding path program 1 times [2022-12-06 05:35:23,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:23,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070267628] [2022-12-06 05:35:23,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:24,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070267628] [2022-12-06 05:35:24,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070267628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:24,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:24,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:35:24,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998281341] [2022-12-06 05:35:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:24,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:35:24,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:24,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:35:24,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:35:24,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 05:35:24,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 71 transitions, 736 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:24,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:24,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 05:35:24,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:24,265 INFO L130 PetriNetUnfolder]: 628/1035 cut-off events. [2022-12-06 05:35:24,265 INFO L131 PetriNetUnfolder]: For 6086/6152 co-relation queries the response was YES. [2022-12-06 05:35:24,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4940 conditions, 1035 events. 628/1035 cut-off events. For 6086/6152 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4777 event pairs, 158 based on Foata normal form. 86/1096 useless extension candidates. Maximal degree in co-relation 4916. Up to 578 conditions per place. [2022-12-06 05:35:24,270 INFO L137 encePairwiseOnDemand]: 29/38 looper letters, 70 selfloop transitions, 9 changer transitions 5/87 dead transitions. [2022-12-06 05:35:24,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 1020 flow [2022-12-06 05:35:24,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:35:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:35:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 05:35:24,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-06 05:35:24,271 INFO L175 Difference]: Start difference. First operand has 58 places, 71 transitions, 736 flow. Second operand 4 states and 56 transitions. [2022-12-06 05:35:24,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 1020 flow [2022-12-06 05:35:24,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 999 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:35:24,277 INFO L231 Difference]: Finished difference. Result has 61 places, 71 transitions, 770 flow [2022-12-06 05:35:24,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=770, PETRI_PLACES=61, PETRI_TRANSITIONS=71} [2022-12-06 05:35:24,278 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2022-12-06 05:35:24,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:24,278 INFO L89 Accepts]: Start accepts. Operand has 61 places, 71 transitions, 770 flow [2022-12-06 05:35:24,280 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:24,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:24,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 71 transitions, 770 flow [2022-12-06 05:35:24,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 71 transitions, 770 flow [2022-12-06 05:35:24,293 INFO L130 PetriNetUnfolder]: 71/201 cut-off events. [2022-12-06 05:35:24,293 INFO L131 PetriNetUnfolder]: For 1071/1087 co-relation queries the response was YES. [2022-12-06 05:35:24,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 201 events. 71/201 cut-off events. For 1071/1087 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 920 event pairs, 0 based on Foata normal form. 7/201 useless extension candidates. Maximal degree in co-relation 829. Up to 66 conditions per place. [2022-12-06 05:35:24,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 71 transitions, 770 flow [2022-12-06 05:35:24,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 05:35:24,295 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:24,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:35:24,297 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 71 transitions, 770 flow [2022-12-06 05:35:24,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:24,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:24,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:24,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:35:24,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:24,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1000610890, now seen corresponding path program 1 times [2022-12-06 05:35:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:24,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992658637] [2022-12-06 05:35:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:24,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:24,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992658637] [2022-12-06 05:35:24,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992658637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:24,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:24,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:35:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494558410] [2022-12-06 05:35:24,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:24,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:35:24,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:24,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:35:24,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:35:24,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:35:24,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 71 transitions, 770 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:24,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:24,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:35:24,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:24,433 INFO L130 PetriNetUnfolder]: 280/503 cut-off events. [2022-12-06 05:35:24,434 INFO L131 PetriNetUnfolder]: For 3175/3175 co-relation queries the response was YES. [2022-12-06 05:35:24,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2293 conditions, 503 events. 280/503 cut-off events. For 3175/3175 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2089 event pairs, 46 based on Foata normal form. 58/559 useless extension candidates. Maximal degree in co-relation 2267. Up to 441 conditions per place. [2022-12-06 05:35:24,436 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 46 selfloop transitions, 8 changer transitions 6/60 dead transitions. [2022-12-06 05:35:24,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 651 flow [2022-12-06 05:35:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:35:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:35:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 05:35:24,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 05:35:24,437 INFO L175 Difference]: Start difference. First operand has 60 places, 71 transitions, 770 flow. Second operand 4 states and 42 transitions. [2022-12-06 05:35:24,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 651 flow [2022-12-06 05:35:24,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 620 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 05:35:24,443 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 401 flow [2022-12-06 05:35:24,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=401, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2022-12-06 05:35:24,444 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2022-12-06 05:35:24,444 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:24,444 INFO L89 Accepts]: Start accepts. Operand has 59 places, 47 transitions, 401 flow [2022-12-06 05:35:24,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:24,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:24,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 47 transitions, 401 flow [2022-12-06 05:35:24,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 47 transitions, 401 flow [2022-12-06 05:35:24,452 INFO L130 PetriNetUnfolder]: 30/108 cut-off events. [2022-12-06 05:35:24,452 INFO L131 PetriNetUnfolder]: For 349/359 co-relation queries the response was YES. [2022-12-06 05:35:24,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 108 events. 30/108 cut-off events. For 349/359 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 400 event pairs, 0 based on Foata normal form. 3/108 useless extension candidates. Maximal degree in co-relation 394. Up to 30 conditions per place. [2022-12-06 05:35:24,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 47 transitions, 401 flow [2022-12-06 05:35:24,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 05:35:24,456 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:24,456 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:24,628 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:24,629 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:24,767 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:24,768 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:24,904 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:24,904 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:25,025 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [574] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_33| 0) (= v_thread1Thread1of1ForFork0_~i~0_98 1) (< 0 v_~N~0_149) (let ((.cse1 (select (select |v_#memory_int_260| v_~A~0.base_156) v_~A~0.offset_156))) (let ((.cse0 (< v_~max1~0_183 .cse1))) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem3_133| |v_thread1Thread1of1ForFork0_#t~mem3_132|) (not .cse0) (= v_~max1~0_183 v_~max1~0_182)) (and (= .cse1 v_~max1~0_182) .cse0)))) (= |v_thread1Thread1of1ForFork0_#res.base_33| 0) (not (< v_thread1Thread1of1ForFork0_~i~0_98 v_~N~0_149))) InVars {~max1~0=v_~max1~0_183, ~A~0.base=v_~A~0.base_156, ~A~0.offset=v_~A~0.offset_156, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_133|, #memory_int=|v_#memory_int_260|, ~N~0=v_~N~0_149} OutVars{~max1~0=v_~max1~0_182, ~A~0.base=v_~A~0.base_156, ~A~0.offset=v_~A~0.offset_156, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_66|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_33|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_132|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_74|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_98, #memory_int=|v_#memory_int_260|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_33|, ~N~0=v_~N~0_149} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#res.offset] and [477] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_94| v_~A~0.base_55) (+ v_~A~0.offset_55 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (let ((.cse0 (< v_~max2~0_80 .cse1))) (or (and (not .cse0) (= v_~max2~0_80 v_~max2~0_79) (= |v_thread3Thread1of1ForFork2_#t~mem9_32| |v_thread3Thread1of1ForFork2_#t~mem9_31|)) (and (= v_~max2~0_79 .cse1) .cse0)))) (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (< v_thread3Thread1of1ForFork2_~i~2_34 v_~N~0_33)) InVars {~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, ~max2~0=v_~max2~0_80, #memory_int=|v_#memory_int_94|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_32|, ~N~0=v_~N~0_33, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_34} OutVars{~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, ~max2~0=v_~max2~0_79, #memory_int=|v_#memory_int_94|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_17|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_19|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_31|, ~N~0=v_~N~0_33, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2] [2022-12-06 05:35:25,136 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:35:25,137 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 693 [2022-12-06 05:35:25,137 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 403 flow [2022-12-06 05:35:25,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:25,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:25,137 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:25,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:35:25,138 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:25,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash 596747782, now seen corresponding path program 1 times [2022-12-06 05:35:25,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:25,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212235871] [2022-12-06 05:35:25,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:25,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:25,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:25,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212235871] [2022-12-06 05:35:25,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212235871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:25,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:25,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:35:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256794325] [2022-12-06 05:35:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:25,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:35:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:35:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:35:25,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 05:35:25,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 403 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:25,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:25,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 05:35:25,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:25,344 INFO L130 PetriNetUnfolder]: 74/172 cut-off events. [2022-12-06 05:35:25,344 INFO L131 PetriNetUnfolder]: For 713/721 co-relation queries the response was YES. [2022-12-06 05:35:25,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 172 events. 74/172 cut-off events. For 713/721 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 655 event pairs, 18 based on Foata normal form. 58/227 useless extension candidates. Maximal degree in co-relation 698. Up to 68 conditions per place. [2022-12-06 05:35:25,345 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 0 selfloop transitions, 0 changer transitions 44/44 dead transitions. [2022-12-06 05:35:25,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 44 transitions, 359 flow [2022-12-06 05:35:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:35:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:35:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 05:35:25,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-06 05:35:25,346 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 403 flow. Second operand 5 states and 44 transitions. [2022-12-06 05:35:25,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 44 transitions, 359 flow [2022-12-06 05:35:25,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 312 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-12-06 05:35:25,347 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2022-12-06 05:35:25,347 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2022-12-06 05:35:25,348 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2022-12-06 05:35:25,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:25,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 0 transitions, 0 flow [2022-12-06 05:35:25,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 05:35:25,348 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 05:35:25,348 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:35:25,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 05:35:25,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 05:35:25,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 05:35:25,348 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:25,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 05:35:25,350 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 05:35:25,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:25,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:35:25,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:35:25,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:35:25,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:35:25,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:35:25,354 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:25,355 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:35:25,356 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:35:25,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:35:25 BasicIcfg [2022-12-06 05:35:25,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:35:25,359 INFO L158 Benchmark]: Toolchain (without parser) took 22840.29ms. Allocated memory was 201.3MB in the beginning and 514.9MB in the end (delta: 313.5MB). Free memory was 177.1MB in the beginning and 256.2MB in the end (delta: -79.1MB). Peak memory consumption was 233.9MB. Max. memory is 8.0GB. [2022-12-06 05:35:25,359 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 177.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:35:25,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.01ms. Allocated memory is still 201.3MB. Free memory was 177.1MB in the beginning and 164.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:35:25,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.80ms. Allocated memory is still 201.3MB. Free memory was 164.5MB in the beginning and 163.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:35:25,360 INFO L158 Benchmark]: Boogie Preprocessor took 56.13ms. Allocated memory is still 201.3MB. Free memory was 163.0MB in the beginning and 161.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:35:25,360 INFO L158 Benchmark]: RCFGBuilder took 544.95ms. Allocated memory is still 201.3MB. Free memory was 161.4MB in the beginning and 140.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 05:35:25,360 INFO L158 Benchmark]: TraceAbstraction took 21938.09ms. Allocated memory was 201.3MB in the beginning and 514.9MB in the end (delta: 313.5MB). Free memory was 139.9MB in the beginning and 256.2MB in the end (delta: -116.3MB). Peak memory consumption was 197.2MB. Max. memory is 8.0GB. [2022-12-06 05:35:25,361 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 177.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.01ms. Allocated memory is still 201.3MB. Free memory was 177.1MB in the beginning and 164.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.80ms. Allocated memory is still 201.3MB. Free memory was 164.5MB in the beginning and 163.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.13ms. Allocated memory is still 201.3MB. Free memory was 163.0MB in the beginning and 161.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 544.95ms. Allocated memory is still 201.3MB. Free memory was 161.4MB in the beginning and 140.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 21938.09ms. Allocated memory was 201.3MB in the beginning and 514.9MB in the end (delta: 313.5MB). Free memory was 139.9MB in the beginning and 256.2MB in the end (delta: -116.3MB). Peak memory consumption was 197.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 126 PlacesBefore, 30 PlacesAfterwards, 128 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 66 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 104 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 706, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 712, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 712, unknown conditional: 0, unknown unconditional: 712] , Statistics on independence cache: Total cache size (in pairs): 1132, Positive cache size: 1126, Positive conditional cache size: 0, Positive unconditional cache size: 1126, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 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, 32 PlacesBefore, 31 PlacesAfterwards, 28 TransitionsBefore, 26 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 28, independent conditional: 10, independent unconditional: 18, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 10, independent unconditional: 18, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 10, independent unconditional: 18, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 29, unknown conditional: 11, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 28, Positive conditional cache size: 10, Positive unconditional cache size: 18, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 36 PlacesBefore, 34 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 238 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): 29, Positive cache size: 28, Positive conditional cache size: 10, Positive unconditional cache size: 18, Negative cache size: 1, Negative conditional cache size: 1, 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: 1.0s, 39 PlacesBefore, 38 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 58, independent conditional: 58, 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: 58, independent: 58, independent conditional: 30, 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: 58, independent: 58, independent conditional: 30, 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: 58, independent: 58, independent conditional: 30, 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: 17, independent: 17, independent conditional: 10, 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: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 41, independent conditional: 20, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 10, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 48, Positive conditional cache size: 23, Positive unconditional cache size: 25, Negative cache size: 1, Negative conditional cache size: 1, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 51 PlacesBefore, 50 PlacesAfterwards, 72 TransitionsBefore, 71 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 61, Positive conditional cache size: 34, Positive unconditional cache size: 27, Negative cache size: 1, Negative conditional cache size: 1, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 414 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): 62, Positive cache size: 61, Positive conditional cache size: 34, Positive unconditional cache size: 27, Negative cache size: 1, Negative conditional cache size: 1, 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.5s, 52 PlacesBefore, 53 PlacesAfterwards, 55 TransitionsBefore, 59 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 150, independent conditional: 150, 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: 150, independent: 150, independent conditional: 100, independent unconditional: 50, 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: 150, independent: 150, independent conditional: 100, independent unconditional: 50, 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: 150, independent: 150, independent conditional: 100, independent unconditional: 50, 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: 19, independent: 19, independent conditional: 10, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 150, independent: 131, independent conditional: 90, independent unconditional: 41, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 10, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 80, Positive conditional cache size: 44, Positive unconditional cache size: 36, Negative cache size: 1, Negative conditional cache size: 1, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 59 PlacesBefore, 58 PlacesAfterwards, 70 TransitionsBefore, 71 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 129, independent conditional: 129, 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: 129, independent: 129, independent conditional: 108, independent unconditional: 21, 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: 129, independent: 129, independent conditional: 99, independent unconditional: 30, 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: 129, independent: 129, independent conditional: 99, independent unconditional: 30, 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: 5, independent unconditional: 6, 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: 129, independent: 118, independent conditional: 94, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 96, Positive conditional cache size: 51, Positive unconditional cache size: 45, Negative cache size: 1, Negative conditional cache size: 1, 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, 60 PlacesBefore, 60 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 96, Positive conditional cache size: 51, Positive unconditional cache size: 45, Negative cache size: 1, Negative conditional cache size: 1, 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.7s, 59 PlacesBefore, 58 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 38, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 38, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 169, Positive conditional cache size: 120, Positive unconditional cache size: 49, Negative cache size: 1, Negative conditional cache size: 1, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 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): 170, Positive cache size: 169, Positive conditional cache size: 120, Positive unconditional cache size: 49, Negative cache size: 1, Negative conditional cache size: 1, 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 - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 160 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.8s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 548 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 548 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 133 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1353 IncrementalHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 15 mSDtfsCounter, 1353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 309 ConstructedInterpolants, 7 QuantifiedInterpolants, 2840 SizeOfPredicates, 43 NumberOfNonLiveVariables, 610 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 8/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 05:35:25,415 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...