/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:18:58,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:18:58,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:18:58,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:18:58,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:18:58,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:18:58,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:18:58,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:18:58,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:18:58,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:18:58,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:18:58,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:18:58,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:18:58,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:18:58,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:18:58,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:18:58,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:18:58,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:18:58,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:18:58,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:18:58,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:18:58,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:18:58,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:18:58,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:18:58,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:18:58,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:18:58,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:18:58,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:18:58,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:18:58,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:18:58,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:18:58,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:18:58,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:18:58,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:18:58,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:18:58,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:18:58,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:18:58,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:18:58,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:18:58,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:18:58,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:18:58,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:18:58,678 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:18:58,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:18:58,681 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:18:58,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:18:58,681 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:18:58,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:18:58,682 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:18:58,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:18:58,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:18:58,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:18:58,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:18:58,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:18:58,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:18:58,683 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:18:58,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:18:58,684 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:18:58,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:18:58,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:18:58,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:18:58,684 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:18:58,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:18:58,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:18:58,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:18:58,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:18:58,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:18:58,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:18:58,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:18:58,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:18:58,685 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 00:18:59,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:18:59,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:18:59,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:18:59,213 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:18:59,214 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:18:59,215 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-12-06 00:19:01,006 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:19:01,268 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:19:01,269 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-12-06 00:19:01,276 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128c6d5ab/f386bd0180d74b9192a89da38eae6801/FLAG29fdf4a1b [2022-12-06 00:19:01,304 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128c6d5ab/f386bd0180d74b9192a89da38eae6801 [2022-12-06 00:19:01,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:19:01,309 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:19:01,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:19:01,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:19:01,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:19:01,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19dacc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01, skipping insertion in model container [2022-12-06 00:19:01,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:19:01,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:19:01,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:01,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:01,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:01,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:01,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:01,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:01,539 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-min-array.wvr.c[2553,2566] [2022-12-06 00:19:01,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:19:01,565 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:19:01,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:01,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:01,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:01,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:01,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:01,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:01,607 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-min-array.wvr.c[2553,2566] [2022-12-06 00:19:01,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:19:01,630 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:19:01,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01 WrapperNode [2022-12-06 00:19:01,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:19:01,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:19:01,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:19:01,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:19:01,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,684 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-12-06 00:19:01,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:19:01,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:19:01,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:19:01,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:19:01,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,716 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:19:01,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:19:01,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:19:01,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:19:01,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (1/1) ... [2022-12-06 00:19:01,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:19:01,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:01,757 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 00:19:01,770 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 00:19:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:19:01,820 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:19:01,820 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:19:01,820 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:19:01,820 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:19:01,820 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:19:01,820 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:19:01,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:19:01,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:19:01,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:19:01,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:19:01,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:19:01,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:19:01,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:19:01,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:19:01,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:19:01,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:19:01,823 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 00:19:01,968 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:19:01,970 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:19:02,554 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:19:02,678 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:19:02,679 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 00:19:02,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:19:02 BoogieIcfgContainer [2022-12-06 00:19:02,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:19:02,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:19:02,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:19:02,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:19:02,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:19:01" (1/3) ... [2022-12-06 00:19:02,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b763be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:19:02, skipping insertion in model container [2022-12-06 00:19:02,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:01" (2/3) ... [2022-12-06 00:19:02,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b763be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:19:02, skipping insertion in model container [2022-12-06 00:19:02,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:19:02" (3/3) ... [2022-12-06 00:19:02,696 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-12-06 00:19:02,713 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:19:02,713 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:19:02,713 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:19:02,813 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:19:02,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 00:19:03,010 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-12-06 00:19:03,011 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:19:03,018 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 00:19:03,018 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 00:19:03,025 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 128 transitions, 274 flow [2022-12-06 00:19:03,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:03,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-06 00:19:03,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 274 flow [2022-12-06 00:19:03,133 INFO L130 PetriNetUnfolder]: 12/128 cut-off events. [2022-12-06 00:19:03,134 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:19:03,136 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 00:19:03,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-06 00:19:03,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 00:19:09,072 INFO L203 LiptonReduction]: Total number of compositions: 104 [2022-12-06 00:19:09,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:19:09,092 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;@7a8411e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:19:09,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:19:09,098 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 00:19:09,098 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:19:09,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:09,099 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 00:19:09,099 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 00:19:09,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:09,103 INFO L85 PathProgramCache]: Analyzing trace with hash -833214972, now seen corresponding path program 1 times [2022-12-06 00:19:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:09,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668654551] [2022-12-06 00:19:09,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:09,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:09,653 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 00:19:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:09,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668654551] [2022-12-06 00:19:09,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668654551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:09,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:19:09,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:19:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209803960] [2022-12-06 00:19:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:09,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:19:09,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:09,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:19:09,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:19:09,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 00:19:09,688 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 00:19:09,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:09,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 00:19:09,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:09,789 INFO L130 PetriNetUnfolder]: 265/372 cut-off events. [2022-12-06 00:19:09,790 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 00:19:09,791 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 00:19:09,797 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 00:19:09,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 114 flow [2022-12-06 00:19:09,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:19:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:19:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 00:19:09,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 00:19:09,809 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 30 transitions. [2022-12-06 00:19:09,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 114 flow [2022-12-06 00:19:09,814 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 00:19:09,816 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-06 00:19:09,817 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 00:19:09,821 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 00:19:09,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:09,823 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 00:19:09,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:09,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:09,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 00:19:09,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 00:19:09,839 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 00:19:09,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:19:09,840 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 00:19:09,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 00:19:09,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 00:19:10,921 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:19:10,923 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1101 [2022-12-06 00:19:10,923 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-06 00:19:10,923 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 00:19:10,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:10,924 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 00:19:10,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:19:10,924 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 00:19:10,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:10,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1604053399, now seen corresponding path program 1 times [2022-12-06 00:19:10,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:10,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559449691] [2022-12-06 00:19:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:10,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:11,053 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 00:19:11,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:11,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559449691] [2022-12-06 00:19:11,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559449691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:11,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:19:11,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:19:11,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105226686] [2022-12-06 00:19:11,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:11,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:19:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:11,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:19:11,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:19:11,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 00:19:11,057 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 00:19:11,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:11,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 00:19:11,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:11,234 INFO L130 PetriNetUnfolder]: 622/886 cut-off events. [2022-12-06 00:19:11,234 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 00:19:11,238 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 00:19:11,243 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 57 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2022-12-06 00:19:11,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 65 transitions, 284 flow [2022-12-06 00:19:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:19:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:19:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-06 00:19:11,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2022-12-06 00:19:11,247 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 6 states and 77 transitions. [2022-12-06 00:19:11,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 65 transitions, 284 flow [2022-12-06 00:19:11,248 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 00:19:11,249 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 92 flow [2022-12-06 00:19:11,250 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 00:19:11,250 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-12-06 00:19:11,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:11,250 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 92 flow [2022-12-06 00:19:11,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:11,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:11,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 92 flow [2022-12-06 00:19:11,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 92 flow [2022-12-06 00:19:11,257 INFO L130 PetriNetUnfolder]: 7/49 cut-off events. [2022-12-06 00:19:11,257 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:19:11,257 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 00:19:11,258 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 28 transitions, 92 flow [2022-12-06 00:19:11,258 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 00:19:11,335 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:19:11,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 00:19:11,337 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 81 flow [2022-12-06 00:19:11,338 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 00:19:11,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:11,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 00:19:11,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:19:11,338 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 00:19:11,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash 107427638, now seen corresponding path program 1 times [2022-12-06 00:19:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:11,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201110963] [2022-12-06 00:19:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:11,461 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 00:19:11,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:11,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201110963] [2022-12-06 00:19:11,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201110963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:11,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:19:11,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:19:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623143043] [2022-12-06 00:19:11,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:11,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:19:11,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:11,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:19:11,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:19:11,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 00:19:11,467 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 00:19:11,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:11,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 00:19:11,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:11,658 INFO L130 PetriNetUnfolder]: 535/808 cut-off events. [2022-12-06 00:19:11,658 INFO L131 PetriNetUnfolder]: For 326/376 co-relation queries the response was YES. [2022-12-06 00:19:11,660 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 00:19:11,663 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 53 selfloop transitions, 10 changer transitions 3/66 dead transitions. [2022-12-06 00:19:11,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 66 transitions, 335 flow [2022-12-06 00:19:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:19:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:19:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-06 00:19:11,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41714285714285715 [2022-12-06 00:19:11,665 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 81 flow. Second operand 7 states and 73 transitions. [2022-12-06 00:19:11,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 66 transitions, 335 flow [2022-12-06 00:19:11,666 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 00:19:11,667 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 116 flow [2022-12-06 00:19:11,668 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 00:19:11,668 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2022-12-06 00:19:11,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:11,669 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 116 flow [2022-12-06 00:19:11,670 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:11,670 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:11,670 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 116 flow [2022-12-06 00:19:11,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 116 flow [2022-12-06 00:19:11,676 INFO L130 PetriNetUnfolder]: 11/50 cut-off events. [2022-12-06 00:19:11,676 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 00:19:11,676 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 00:19:11,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 116 flow [2022-12-06 00:19:11,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 00:19:12,952 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:19:12,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1285 [2022-12-06 00:19:12,953 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 112 flow [2022-12-06 00:19:12,954 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 00:19:12,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:12,954 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 00:19:12,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:19:12,954 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 00:19:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:12,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1764033824, now seen corresponding path program 1 times [2022-12-06 00:19:12,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:12,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787899692] [2022-12-06 00:19:12,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:12,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:13,830 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 00:19:13,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:13,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787899692] [2022-12-06 00:19:13,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787899692] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:19:13,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926334245] [2022-12-06 00:19:13,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:13,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:13,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:13,835 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 00:19:13,876 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 00:19:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:14,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 00:19:14,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:19:14,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:19:14,212 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 00:19:14,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:19:14,319 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 00:19:14,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:14,428 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 66 treesize of output 46 [2022-12-06 00:19:14,712 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 00:19:14,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:19:15,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:15,211 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 00:19:15,219 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 00:19:15,226 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 00:19:15,234 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 00:19:15,241 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 00:19:15,789 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 00:19:15,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926334245] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:19:15,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:19:15,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 18 [2022-12-06 00:19:15,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178607075] [2022-12-06 00:19:15,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:19:15,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:19:15,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:15,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:19:15,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=290, Unknown=12, NotChecked=0, Total=380 [2022-12-06 00:19:15,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 00:19:15,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 112 flow. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:15,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:15,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 00:19:15,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:16,394 INFO L130 PetriNetUnfolder]: 641/966 cut-off events. [2022-12-06 00:19:16,394 INFO L131 PetriNetUnfolder]: For 648/695 co-relation queries the response was YES. [2022-12-06 00:19:16,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 966 events. 641/966 cut-off events. For 648/695 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3857 event pairs, 42 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 00:19:16,401 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 66 selfloop transitions, 22 changer transitions 3/93 dead transitions. [2022-12-06 00:19:16,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 93 transitions, 521 flow [2022-12-06 00:19:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:19:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:19:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-06 00:19:16,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2022-12-06 00:19:16,403 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 112 flow. Second operand 7 states and 87 transitions. [2022-12-06 00:19:16,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 93 transitions, 521 flow [2022-12-06 00:19:16,406 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 00:19:16,407 INFO L231 Difference]: Finished difference. Result has 39 places, 48 transitions, 256 flow [2022-12-06 00:19:16,407 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 00:19:16,408 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-06 00:19:16,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:16,408 INFO L89 Accepts]: Start accepts. Operand has 39 places, 48 transitions, 256 flow [2022-12-06 00:19:16,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:16,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:16,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 48 transitions, 256 flow [2022-12-06 00:19:16,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 48 transitions, 256 flow [2022-12-06 00:19:16,421 INFO L130 PetriNetUnfolder]: 45/124 cut-off events. [2022-12-06 00:19:16,421 INFO L131 PetriNetUnfolder]: For 65/69 co-relation queries the response was YES. [2022-12-06 00:19:16,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 124 events. 45/124 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 430 event pairs, 0 based on Foata normal form. 4/125 useless extension candidates. Maximal degree in co-relation 263. Up to 46 conditions per place. [2022-12-06 00:19:16,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 48 transitions, 256 flow [2022-12-06 00:19:16,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-06 00:19:16,430 WARN L322 ript$VariableManager]: TermVariable LBE235 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:16,431 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:16,643 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 (let ((.cse1 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse0 (< .cse1 v_~min2~0_92))) (or (and (= v_~min2~0_92 v_~min2~0_91) (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse0)) (and (= v_~min2~0_91 .cse1) .cse0)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_92} 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_91} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0] [2022-12-06 00:19:16,751 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) (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 (< .cse1 v_~min1~0_41))) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem3_16| |v_thread1Thread1of1ForFork0_#t~mem3_15|) (not .cse0) (= v_~min1~0_41 v_~min1~0_40)) (and (= .cse1 v_~min1~0_40) .cse0)))) (< v_thread1Thread1of1ForFork0_~i~0_30 v_~N~0_45)) InVars {~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, ~min1~0=v_~min1~0_41} OutVars{~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, ~min1~0=v_~min1~0_40} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, ~min1~0] [2022-12-06 00:19:16,878 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 (let ((.cse1 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse0 (< .cse1 v_~min2~0_92))) (or (and (= v_~min2~0_92 v_~min2~0_91) (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse0)) (and (= v_~min2~0_91 .cse1) .cse0)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_92} 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_91} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0] [2022-12-06 00:19:17,006 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 (< .cse1 v_~min1~0_67))) (or (and .cse0 (= v_~min1~0_66 .cse1)) (and (= v_~min1~0_67 v_~min1~0_66) (= |v_thread1Thread1of1ForFork0_#t~mem3_19| |v_thread1Thread1of1ForFork0_#t~mem3_20|) (not .cse0))))) (= v_thread1Thread1of1ForFork0_~i~0_33 1)) InVars {~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, ~min1~0=v_~min1~0_67} OutVars{~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, ~min1~0=v_~min1~0_66} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, ~min1~0] [2022-12-06 00:19:17,126 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) (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 (< .cse1 v_~min1~0_41))) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem3_16| |v_thread1Thread1of1ForFork0_#t~mem3_15|) (not .cse0) (= v_~min1~0_41 v_~min1~0_40)) (and (= .cse1 v_~min1~0_40) .cse0)))) (< v_thread1Thread1of1ForFork0_~i~0_30 v_~N~0_45)) InVars {~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, ~min1~0=v_~min1~0_41} OutVars{~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, ~min1~0=v_~min1~0_40} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, ~min1~0] [2022-12-06 00:19:17,238 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 (let ((.cse1 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse0 (< .cse1 v_~min2~0_92))) (or (and (= v_~min2~0_92 v_~min2~0_91) (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse0)) (and (= v_~min2~0_91 .cse1) .cse0)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_92} 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_91} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0] [2022-12-06 00:19:17,360 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:19:17,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 953 [2022-12-06 00:19:17,361 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 48 transitions, 298 flow [2022-12-06 00:19:17,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:17,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:17,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:17,366 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 00:19:17,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 00:19:17,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 00:19:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash 590579866, now seen corresponding path program 2 times [2022-12-06 00:19:17,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:17,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669878859] [2022-12-06 00:19:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:17,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:17,960 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 00:19:17,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:17,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669878859] [2022-12-06 00:19:17,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669878859] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:19:17,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616129608] [2022-12-06 00:19:17,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:19:17,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:17,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:17,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:19:17,965 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 00:19:18,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:19:18,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:19:18,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 00:19:18,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:19:18,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:18,231 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 79 treesize of output 81 [2022-12-06 00:19:18,664 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 00:19:18,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:19:18,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:18,756 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 00:19:18,867 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 00:19:18,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616129608] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:19:18,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:19:18,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 14 [2022-12-06 00:19:18,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305887118] [2022-12-06 00:19:18,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:19:18,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:19:18,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:18,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:19:18,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:19:18,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:19:18,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 48 transitions, 298 flow. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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 00:19:18,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:18,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:19:18,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:19,574 INFO L130 PetriNetUnfolder]: 843/1297 cut-off events. [2022-12-06 00:19:19,574 INFO L131 PetriNetUnfolder]: For 2327/2327 co-relation queries the response was YES. [2022-12-06 00:19:19,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4446 conditions, 1297 events. 843/1297 cut-off events. For 2327/2327 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5259 event pairs, 122 based on Foata normal form. 2/1299 useless extension candidates. Maximal degree in co-relation 3915. Up to 754 conditions per place. [2022-12-06 00:19:19,584 INFO L137 encePairwiseOnDemand]: 13/29 looper letters, 80 selfloop transitions, 45 changer transitions 9/134 dead transitions. [2022-12-06 00:19:19,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 134 transitions, 925 flow [2022-12-06 00:19:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:19:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:19:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-12-06 00:19:19,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32360742705570295 [2022-12-06 00:19:19,595 INFO L175 Difference]: Start difference. First operand has 39 places, 48 transitions, 298 flow. Second operand 13 states and 122 transitions. [2022-12-06 00:19:19,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 134 transitions, 925 flow [2022-12-06 00:19:19,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 134 transitions, 903 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-12-06 00:19:19,605 INFO L231 Difference]: Finished difference. Result has 56 places, 76 transitions, 611 flow [2022-12-06 00:19:19,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=611, PETRI_PLACES=56, PETRI_TRANSITIONS=76} [2022-12-06 00:19:19,608 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2022-12-06 00:19:19,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:19,609 INFO L89 Accepts]: Start accepts. Operand has 56 places, 76 transitions, 611 flow [2022-12-06 00:19:19,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:19,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:19,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 76 transitions, 611 flow [2022-12-06 00:19:19,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 76 transitions, 611 flow [2022-12-06 00:19:19,630 INFO L130 PetriNetUnfolder]: 74/218 cut-off events. [2022-12-06 00:19:19,630 INFO L131 PetriNetUnfolder]: For 373/377 co-relation queries the response was YES. [2022-12-06 00:19:19,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 218 events. 74/218 cut-off events. For 373/377 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 999 event pairs, 0 based on Foata normal form. 2/216 useless extension candidates. Maximal degree in co-relation 654. Up to 68 conditions per place. [2022-12-06 00:19:19,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 76 transitions, 611 flow [2022-12-06 00:19:19,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 00:19:19,730 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 (< .cse1 v_~min1~0_67))) (or (and .cse0 (= v_~min1~0_66 .cse1)) (and (= v_~min1~0_67 v_~min1~0_66) (= |v_thread1Thread1of1ForFork0_#t~mem3_19| |v_thread1Thread1of1ForFork0_#t~mem3_20|) (not .cse0))))) (= v_thread1Thread1of1ForFork0_~i~0_33 1)) InVars {~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, ~min1~0=v_~min1~0_67} OutVars{~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, ~min1~0=v_~min1~0_66} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, ~min1~0] [2022-12-06 00:19:19,791 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 00:19:19,828 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L58-4-->L58-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse0 (< .cse1 v_~min2~0_92))) (or (and (= v_~min2~0_92 v_~min2~0_91) (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse0)) (and (= v_~min2~0_91 .cse1) .cse0)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_92} 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_91} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0] 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 (< .cse1 v_~min1~0_67))) (or (and .cse0 (= v_~min1~0_66 .cse1)) (and (= v_~min1~0_67 v_~min1~0_66) (= |v_thread1Thread1of1ForFork0_#t~mem3_19| |v_thread1Thread1of1ForFork0_#t~mem3_20|) (not .cse0))))) (= v_thread1Thread1of1ForFork0_~i~0_33 1)) InVars {~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, ~min1~0=v_~min1~0_67} OutVars{~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, ~min1~0=v_~min1~0_66} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, ~min1~0] [2022-12-06 00:19:19,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L58-4-->L58-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse0 (< .cse1 v_~min2~0_92))) (or (and (= v_~min2~0_92 v_~min2~0_91) (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse0)) (and (= v_~min2~0_91 .cse1) .cse0)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_92} 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_91} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0] and [477] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (let ((.cse0 (select (select |v_#memory_int_94| v_~A~0.base_55) (+ v_~A~0.offset_55 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (let ((.cse1 (< .cse0 v_~min2~0_80))) (or (and (= .cse0 v_~min2~0_79) .cse1) (and (= v_~min2~0_79 v_~min2~0_80) (not .cse1) (= |v_thread3Thread1of1ForFork2_#t~mem9_32| |v_thread3Thread1of1ForFork2_#t~mem9_31|))))) (< 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, #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, ~min2~0=v_~min2~0_80} OutVars{~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, #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, ~min2~0=v_~min2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min2~0] [2022-12-06 00:19:20,112 WARN L322 ript$VariableManager]: TermVariable LBE226 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:20,113 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:20,289 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 (< .cse1 v_~min1~0_67))) (or (and .cse0 (= v_~min1~0_66 .cse1)) (and (= v_~min1~0_67 v_~min1~0_66) (= |v_thread1Thread1of1ForFork0_#t~mem3_19| |v_thread1Thread1of1ForFork0_#t~mem3_20|) (not .cse0))))) (= v_thread1Thread1of1ForFork0_~i~0_33 1)) InVars {~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, ~min1~0=v_~min1~0_67} OutVars{~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, ~min1~0=v_~min1~0_66} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, ~min1~0] [2022-12-06 00:19:20,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [563] L58-4-->L46-4: Formula: (let ((.cse2 (select |v_#memory_int_226| v_~A~0.base_128))) (and (< v_thread2Thread1of1ForFork1_~i~1_56 v_~M~0_79) (= v_thread1Thread1of1ForFork0_~i~0_70 1) (= v_thread2Thread1of1ForFork1_~i~1_55 (+ v_thread2Thread1of1ForFork1_~i~1_56 1)) (let ((.cse1 (select .cse2 (+ v_~A~0.offset_128 (* v_thread2Thread1of1ForFork1_~i~1_56 4))))) (let ((.cse0 (< .cse1 v_~min2~0_148))) (or (and (= |v_thread2Thread1of1ForFork1_#t~mem6_54| |v_thread2Thread1of1ForFork1_#t~mem6_53|) (not .cse0) (= v_~min2~0_148 v_~min2~0_147)) (and (= v_~min2~0_147 .cse1) .cse0)))) (let ((.cse4 (select .cse2 v_~A~0.offset_128))) (let ((.cse3 (< .cse4 v_~min1~0_119))) (or (and (not .cse3) (= v_~min1~0_118 v_~min1~0_119) (= |v_thread1Thread1of1ForFork0_#t~mem3_69| |v_thread1Thread1of1ForFork0_#t~mem3_70|)) (and .cse3 (= v_~min1~0_118 .cse4))))) (< 0 v_~N~0_121))) InVars {~A~0.base=v_~A~0.base_128, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_56, ~A~0.offset=v_~A~0.offset_128, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_54|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_70|, ~M~0=v_~M~0_79, #memory_int=|v_#memory_int_226|, ~N~0=v_~N~0_121, ~min1~0=v_~min1~0_119, ~min2~0=v_~min2~0_148} OutVars{~A~0.base=v_~A~0.base_128, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_70, ~N~0=v_~N~0_121, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_55, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_31|, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_29|, ~A~0.offset=v_~A~0.offset_128, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_38|, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_53|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_69|, ~M~0=v_~M~0_79, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_46|, #memory_int=|v_#memory_int_226|, ~min1~0=v_~min1~0_118, ~min2~0=v_~min2~0_147} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork0_#t~mem2, thread2Thread1of1ForFork1_#t~mem6, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, ~min1~0, ~min2~0] and [494] L58-4-->L58-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse0 (< .cse1 v_~min2~0_92))) (or (and (= v_~min2~0_92 v_~min2~0_91) (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse0)) (and (= v_~min2~0_91 .cse1) .cse0)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_92} 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, #memory_int=|v_#memory_int_116|, ~min2~0=v_~min2~0_91} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0] [2022-12-06 00:19:20,429 WARN L322 ript$VariableManager]: TermVariable LBE226 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:20,429 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:20,429 WARN L322 ript$VariableManager]: TermVariable LBE235 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:20,429 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:20,713 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [563] L58-4-->L46-4: Formula: (let ((.cse2 (select |v_#memory_int_226| v_~A~0.base_128))) (and (< v_thread2Thread1of1ForFork1_~i~1_56 v_~M~0_79) (= v_thread1Thread1of1ForFork0_~i~0_70 1) (= v_thread2Thread1of1ForFork1_~i~1_55 (+ v_thread2Thread1of1ForFork1_~i~1_56 1)) (let ((.cse1 (select .cse2 (+ v_~A~0.offset_128 (* v_thread2Thread1of1ForFork1_~i~1_56 4))))) (let ((.cse0 (< .cse1 v_~min2~0_148))) (or (and (= |v_thread2Thread1of1ForFork1_#t~mem6_54| |v_thread2Thread1of1ForFork1_#t~mem6_53|) (not .cse0) (= v_~min2~0_148 v_~min2~0_147)) (and (= v_~min2~0_147 .cse1) .cse0)))) (let ((.cse4 (select .cse2 v_~A~0.offset_128))) (let ((.cse3 (< .cse4 v_~min1~0_119))) (or (and (not .cse3) (= v_~min1~0_118 v_~min1~0_119) (= |v_thread1Thread1of1ForFork0_#t~mem3_69| |v_thread1Thread1of1ForFork0_#t~mem3_70|)) (and .cse3 (= v_~min1~0_118 .cse4))))) (< 0 v_~N~0_121))) InVars {~A~0.base=v_~A~0.base_128, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_56, ~A~0.offset=v_~A~0.offset_128, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_54|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_70|, ~M~0=v_~M~0_79, #memory_int=|v_#memory_int_226|, ~N~0=v_~N~0_121, ~min1~0=v_~min1~0_119, ~min2~0=v_~min2~0_148} OutVars{~A~0.base=v_~A~0.base_128, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_70, ~N~0=v_~N~0_121, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_55, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_31|, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_29|, ~A~0.offset=v_~A~0.offset_128, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_38|, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_53|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_69|, ~M~0=v_~M~0_79, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_46|, #memory_int=|v_#memory_int_226|, ~min1~0=v_~min1~0_118, ~min2~0=v_~min2~0_147} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork0_#t~mem2, thread2Thread1of1ForFork1_#t~mem6, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, ~min1~0, ~min2~0] and [477] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (let ((.cse0 (select (select |v_#memory_int_94| v_~A~0.base_55) (+ v_~A~0.offset_55 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (let ((.cse1 (< .cse0 v_~min2~0_80))) (or (and (= .cse0 v_~min2~0_79) .cse1) (and (= v_~min2~0_79 v_~min2~0_80) (not .cse1) (= |v_thread3Thread1of1ForFork2_#t~mem9_32| |v_thread3Thread1of1ForFork2_#t~mem9_31|))))) (< 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, #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, ~min2~0=v_~min2~0_80} OutVars{~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, #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, ~min2~0=v_~min2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min2~0] [2022-12-06 00:19:20,925 WARN L322 ript$VariableManager]: TermVariable LBE226 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:20,925 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:20,925 WARN L322 ript$VariableManager]: TermVariable LBE235 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:20,925 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:21,227 WARN L322 ript$VariableManager]: TermVariable LBE235 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:21,227 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:21,434 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:19:21,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1826 [2022-12-06 00:19:21,435 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 74 transitions, 658 flow [2022-12-06 00:19:21,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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 00:19:21,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:21,435 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 00:19:21,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 00:19:21,641 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 00:19:21,642 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 00:19:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:21,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1869058695, now seen corresponding path program 1 times [2022-12-06 00:19:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:21,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829741319] [2022-12-06 00:19:21,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:21,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:21,757 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 00:19:21,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:21,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829741319] [2022-12-06 00:19:21,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829741319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:19:21,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656253651] [2022-12-06 00:19:21,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:21,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:21,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:21,761 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 00:19:21,764 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 00:19:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:21,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:19:21,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:19:21,872 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 00:19:21,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:19:21,908 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 00:19:21,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656253651] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:19:21,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:19:21,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 00:19:21,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382454989] [2022-12-06 00:19:21,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:19:21,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:19:21,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:21,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:19:21,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:19:21,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:19:21,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 74 transitions, 658 flow. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:21,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:21,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:19:21,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:22,154 INFO L130 PetriNetUnfolder]: 403/663 cut-off events. [2022-12-06 00:19:22,155 INFO L131 PetriNetUnfolder]: For 2643/2643 co-relation queries the response was YES. [2022-12-06 00:19:22,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 663 events. 403/663 cut-off events. For 2643/2643 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2520 event pairs, 28 based on Foata normal form. 96/759 useless extension candidates. Maximal degree in co-relation 2424. Up to 435 conditions per place. [2022-12-06 00:19:22,160 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 68 selfloop transitions, 12 changer transitions 2/82 dead transitions. [2022-12-06 00:19:22,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 716 flow [2022-12-06 00:19:22,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:19:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:19:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-06 00:19:22,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2863247863247863 [2022-12-06 00:19:22,161 INFO L175 Difference]: Start difference. First operand has 52 places, 74 transitions, 658 flow. Second operand 6 states and 67 transitions. [2022-12-06 00:19:22,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 716 flow [2022-12-06 00:19:22,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 624 flow, removed 37 selfloop flow, removed 5 redundant places. [2022-12-06 00:19:22,167 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 318 flow [2022-12-06 00:19:22,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-12-06 00:19:22,170 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2022-12-06 00:19:22,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:22,170 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 318 flow [2022-12-06 00:19:22,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:22,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:22,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 318 flow [2022-12-06 00:19:22,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 318 flow [2022-12-06 00:19:22,180 INFO L130 PetriNetUnfolder]: 24/99 cut-off events. [2022-12-06 00:19:22,180 INFO L131 PetriNetUnfolder]: For 159/166 co-relation queries the response was YES. [2022-12-06 00:19:22,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 99 events. 24/99 cut-off events. For 159/166 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 349 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 254. Up to 21 conditions per place. [2022-12-06 00:19:22,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 48 transitions, 318 flow [2022-12-06 00:19:22,182 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-06 00:19:22,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] $Ultimate##0-->L46-4: Formula: (and (< 0 v_~N~0_133) (let ((.cse1 (select (select |v_#memory_int_244| v_~A~0.base_141) v_~A~0.offset_142))) (let ((.cse0 (< .cse1 v_~min1~0_137))) (or (and (= v_~min1~0_137 v_~min1~0_136) (= |v_thread1Thread1of1ForFork0_#t~mem3_86| |v_thread1Thread1of1ForFork0_#t~mem3_85|) (not .cse0)) (and (= v_~min1~0_136 .cse1) .cse0)))) (= v_thread2Thread1of1ForFork1_~i~1_71 0) (= v_thread1Thread1of1ForFork0_~i~0_78 1)) InVars {~A~0.base=v_~A~0.base_141, ~A~0.offset=v_~A~0.offset_142, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_86|, #memory_int=|v_#memory_int_244|, ~N~0=v_~N~0_133, ~min1~0=v_~min1~0_137} OutVars{~A~0.base=v_~A~0.base_141, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_71, ~A~0.offset=v_~A~0.offset_142, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_46|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_85|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_54|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_78, #memory_int=|v_#memory_int_244|, ~N~0=v_~N~0_133, ~min1~0=v_~min1~0_136} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, ~min1~0] and [542] L58-4-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~i~1_In_3 v_~M~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~M~0=v_~M~0_In_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_3, ~M~0=v_~M~0_In_4, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] [2022-12-06 00:19:22,417 WARN L322 ript$VariableManager]: TermVariable LBE235 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:22,418 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:22,613 WARN L322 ript$VariableManager]: TermVariable LBE235 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:22,614 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:22,836 WARN L322 ript$VariableManager]: TermVariable LBE235 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:22,836 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:23,039 WARN L322 ript$VariableManager]: TermVariable LBE235 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:23,039 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:23,277 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:19:23,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1107 [2022-12-06 00:19:23,278 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 329 flow [2022-12-06 00:19:23,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:23,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:23,278 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 00:19:23,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 00:19:23,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:23,484 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 00:19:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1373403208, now seen corresponding path program 1 times [2022-12-06 00:19:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:23,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626025368] [2022-12-06 00:19:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:23,551 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 00:19:23,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:23,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626025368] [2022-12-06 00:19:23,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626025368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:23,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:19:23,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:19:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911598715] [2022-12-06 00:19:23,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:23,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:19:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:23,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:19:23,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:19:23,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-06 00:19:23,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:23,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:23,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-06 00:19:23,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:23,637 INFO L130 PetriNetUnfolder]: 293/487 cut-off events. [2022-12-06 00:19:23,637 INFO L131 PetriNetUnfolder]: For 1379/1396 co-relation queries the response was YES. [2022-12-06 00:19:23,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 487 events. 293/487 cut-off events. For 1379/1396 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1866 event pairs, 78 based on Foata normal form. 64/539 useless extension candidates. Maximal degree in co-relation 1800. Up to 411 conditions per place. [2022-12-06 00:19:23,640 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 37 selfloop transitions, 7 changer transitions 1/50 dead transitions. [2022-12-06 00:19:23,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 388 flow [2022-12-06 00:19:23,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:19:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:19:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 00:19:23,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 00:19:23,642 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 329 flow. Second operand 4 states and 48 transitions. [2022-12-06 00:19:23,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 388 flow [2022-12-06 00:19:23,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 371 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 00:19:23,645 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 256 flow [2022-12-06 00:19:23,645 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-12-06 00:19:23,645 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2022-12-06 00:19:23,645 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:23,645 INFO L89 Accepts]: Start accepts. Operand has 51 places, 41 transitions, 256 flow [2022-12-06 00:19:23,646 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:23,646 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:23,646 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 256 flow [2022-12-06 00:19:23,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 256 flow [2022-12-06 00:19:23,654 INFO L130 PetriNetUnfolder]: 20/87 cut-off events. [2022-12-06 00:19:23,655 INFO L131 PetriNetUnfolder]: For 154/158 co-relation queries the response was YES. [2022-12-06 00:19:23,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 87 events. 20/87 cut-off events. For 154/158 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 329 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 211. Up to 21 conditions per place. [2022-12-06 00:19:23,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 256 flow [2022-12-06 00:19:23,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 00:19:24,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] $Ultimate##0-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_96 0) (< 0 v_~N~0_143) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse1 (select (select |v_#memory_int_258| v_~A~0.base_153) v_~A~0.offset_154))) (let ((.cse0 (< .cse1 v_~min1~0_162))) (or (and .cse0 (= v_~min1~0_161 .cse1)) (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_112| |v_thread1Thread1of1ForFork0_#t~mem3_111|) (= v_~min1~0_162 v_~min1~0_161))))) (not (< v_thread2Thread1of1ForFork1_~i~1_96 v_~M~0_97)) (= v_thread1Thread1of1ForFork0_~i~0_94 1) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0)) InVars {~A~0.base=v_~A~0.base_153, ~A~0.offset=v_~A~0.offset_154, ~M~0=v_~M~0_97, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_112|, #memory_int=|v_#memory_int_258|, ~N~0=v_~N~0_143, ~min1~0=v_~min1~0_162} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, ~A~0.base=v_~A~0.base_153, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_94, ~N~0=v_~N~0_143, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_96, ~A~0.offset=v_~A~0.offset_154, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_62|, ~M~0=v_~M~0_97, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_111|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_70|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_258|, ~min1~0=v_~min1~0_161} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread2Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork0_~i~0, ~min1~0] and [543] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~i~0_In_3 v_~N~0_In_7)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_3, ~N~0=v_~N~0_In_7} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_3, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, ~N~0=v_~N~0_In_7, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-06 00:19:24,268 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:24,268 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:24,430 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:24,431 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:24,613 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:24,613 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:24,778 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:19:24,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1134 [2022-12-06 00:19:24,779 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 275 flow [2022-12-06 00:19:24,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:24,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:24,779 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 00:19:24,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:19:24,780 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 00:19:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1399500214, now seen corresponding path program 1 times [2022-12-06 00:19:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:24,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712429577] [2022-12-06 00:19:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:24,930 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 00:19:24,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:24,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712429577] [2022-12-06 00:19:24,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712429577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:24,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:19:24,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:19:24,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321002234] [2022-12-06 00:19:24,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:24,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:19:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:24,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:19:24,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:19:24,932 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:19:24,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 275 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 00:19:24,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:24,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:19:24,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:25,012 INFO L130 PetriNetUnfolder]: 194/362 cut-off events. [2022-12-06 00:19:25,013 INFO L131 PetriNetUnfolder]: For 1036/1044 co-relation queries the response was YES. [2022-12-06 00:19:25,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 362 events. 194/362 cut-off events. For 1036/1044 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1393 event pairs, 61 based on Foata normal form. 46/405 useless extension candidates. Maximal degree in co-relation 1007. Up to 285 conditions per place. [2022-12-06 00:19:25,015 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 25 selfloop transitions, 5 changer transitions 14/46 dead transitions. [2022-12-06 00:19:25,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 353 flow [2022-12-06 00:19:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:19:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:19:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 00:19:25,016 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2022-12-06 00:19:25,016 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 275 flow. Second operand 4 states and 44 transitions. [2022-12-06 00:19:25,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 353 flow [2022-12-06 00:19:25,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 326 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-06 00:19:25,020 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 165 flow [2022-12-06 00:19:25,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2022-12-06 00:19:25,022 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2022-12-06 00:19:25,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:25,022 INFO L89 Accepts]: Start accepts. Operand has 50 places, 30 transitions, 165 flow [2022-12-06 00:19:25,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:25,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:25,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 30 transitions, 165 flow [2022-12-06 00:19:25,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 30 transitions, 165 flow [2022-12-06 00:19:25,029 INFO L130 PetriNetUnfolder]: 9/49 cut-off events. [2022-12-06 00:19:25,029 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-06 00:19:25,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 49 events. 9/49 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 111. Up to 13 conditions per place. [2022-12-06 00:19:25,030 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 30 transitions, 165 flow [2022-12-06 00:19:25,030 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 00:19:25,034 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] $Ultimate##0-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_102 0) (= |v_thread2Thread1of1ForFork1_#res.base_25| 0) (= v_~M~0_103 v_thread3Thread1of1ForFork2_~i~2_88) (= |v_thread2Thread1of1ForFork1_#res.offset_25| 0) (not (< v_thread2Thread1of1ForFork1_~i~1_102 v_~M~0_103))) InVars {~M~0=v_~M~0_103} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_25|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_102, ~M~0=v_~M~0_103, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_88} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork2_~i~2] and [477] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (let ((.cse0 (select (select |v_#memory_int_94| v_~A~0.base_55) (+ v_~A~0.offset_55 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (let ((.cse1 (< .cse0 v_~min2~0_80))) (or (and (= .cse0 v_~min2~0_79) .cse1) (and (= v_~min2~0_79 v_~min2~0_80) (not .cse1) (= |v_thread3Thread1of1ForFork2_#t~mem9_32| |v_thread3Thread1of1ForFork2_#t~mem9_31|))))) (< 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, #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, ~min2~0=v_~min2~0_80} OutVars{~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, #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, ~min2~0=v_~min2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min2~0] [2022-12-06 00:19:25,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [602] $Ultimate##0-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_108 0) (not (< v_thread2Thread1of1ForFork1_~i~1_108 v_~M~0_113)) (= |v_thread2Thread1of1ForFork1_#res.base_31| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_31| 0)) InVars {~M~0=v_~M~0_113} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_31|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_108, ~M~0=v_~M~0_113, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_31|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#res.base] and [601] $Ultimate##0-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_286| v_~A~0.base_181) (+ v_~A~0.offset_182 (* v_~M~0_111 4))))) (let ((.cse0 (< .cse1 v_~min2~0_213))) (or (and .cse0 (= v_~min2~0_212 .cse1)) (and (not .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem9_79| |v_thread3Thread1of1ForFork2_#t~mem9_78|) (= v_~min2~0_213 v_~min2~0_212))))) (= v_thread3Thread1of1ForFork2_~i~2_114 (+ v_~M~0_111 1)) (< v_~M~0_111 v_~N~0_171)) InVars {~A~0.base=v_~A~0.base_181, ~A~0.offset=v_~A~0.offset_182, ~M~0=v_~M~0_111, #memory_int=|v_#memory_int_286|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_79|, ~N~0=v_~N~0_171, ~min2~0=v_~min2~0_213} OutVars{~A~0.base=v_~A~0.base_181, ~A~0.offset=v_~A~0.offset_182, ~M~0=v_~M~0_111, #memory_int=|v_#memory_int_286|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_45|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_49|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_78|, ~N~0=v_~N~0_171, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_114, ~min2~0=v_~min2~0_212} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min2~0] [2022-12-06 00:19:25,302 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->thread1EXIT: Formula: (and (let ((.cse1 (select (select |v_#memory_int_276| v_~A~0.base_171) v_~A~0.offset_172))) (let ((.cse0 (< .cse1 v_~min1~0_206))) (or (and .cse0 (= v_~min1~0_205 .cse1)) (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_156| |v_thread1Thread1of1ForFork0_#t~mem3_155|) (= v_~min1~0_206 v_~min1~0_205))))) (= |v_thread1Thread1of1ForFork0_#res.base_27| 0) (= v_thread1Thread1of1ForFork0_~i~0_126 1) (< 0 v_~N~0_161) (= |v_thread1Thread1of1ForFork0_#res.offset_27| 0) (not (< v_thread1Thread1of1ForFork0_~i~0_126 v_~N~0_161)) (= v_~M~0_107 v_thread3Thread1of1ForFork2_~i~2_90)) InVars {~A~0.base=v_~A~0.base_171, ~A~0.offset=v_~A~0.offset_172, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_156|, ~M~0=v_~M~0_107, #memory_int=|v_#memory_int_276|, ~N~0=v_~N~0_161, ~min1~0=v_~min1~0_206} OutVars{~A~0.base=v_~A~0.base_171, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_27|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_126, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_27|, ~N~0=v_~N~0_161, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_90, ~A~0.offset=v_~A~0.offset_172, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_88|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_155|, ~M~0=v_~M~0_107, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_96|, #memory_int=|v_#memory_int_276|, ~min1~0=v_~min1~0_205} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#res.offset, ~min1~0, 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 00:19:25,381 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->thread1EXIT: Formula: (and (let ((.cse1 (select (select |v_#memory_int_276| v_~A~0.base_171) v_~A~0.offset_172))) (let ((.cse0 (< .cse1 v_~min1~0_206))) (or (and .cse0 (= v_~min1~0_205 .cse1)) (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_156| |v_thread1Thread1of1ForFork0_#t~mem3_155|) (= v_~min1~0_206 v_~min1~0_205))))) (= |v_thread1Thread1of1ForFork0_#res.base_27| 0) (= v_thread1Thread1of1ForFork0_~i~0_126 1) (< 0 v_~N~0_161) (= |v_thread1Thread1of1ForFork0_#res.offset_27| 0) (not (< v_thread1Thread1of1ForFork0_~i~0_126 v_~N~0_161)) (= v_~M~0_107 v_thread3Thread1of1ForFork2_~i~2_90)) InVars {~A~0.base=v_~A~0.base_171, ~A~0.offset=v_~A~0.offset_172, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_156|, ~M~0=v_~M~0_107, #memory_int=|v_#memory_int_276|, ~N~0=v_~N~0_161, ~min1~0=v_~min1~0_206} OutVars{~A~0.base=v_~A~0.base_171, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_27|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_126, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_27|, ~N~0=v_~N~0_161, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_90, ~A~0.offset=v_~A~0.offset_172, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_88|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_155|, ~M~0=v_~M~0_107, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_96|, #memory_int=|v_#memory_int_276|, ~min1~0=v_~min1~0_205} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#res.offset, ~min1~0, thread3Thread1of1ForFork2_~i~2] and [477] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (let ((.cse0 (select (select |v_#memory_int_94| v_~A~0.base_55) (+ v_~A~0.offset_55 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (let ((.cse1 (< .cse0 v_~min2~0_80))) (or (and (= .cse0 v_~min2~0_79) .cse1) (and (= v_~min2~0_79 v_~min2~0_80) (not .cse1) (= |v_thread3Thread1of1ForFork2_#t~mem9_32| |v_thread3Thread1of1ForFork2_#t~mem9_31|))))) (< 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, #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, ~min2~0=v_~min2~0_80} OutVars{~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, #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, ~min2~0=v_~min2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min2~0] [2022-12-06 00:19:25,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread1EXIT: Formula: (and (< 0 v_~N~0_155) (let ((.cse1 (select (select |v_#memory_int_270| v_~A~0.base_165) v_~A~0.offset_166))) (let ((.cse0 (< .cse1 v_~min1~0_194))) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem3_144| |v_thread1Thread1of1ForFork0_#t~mem3_143|) (= v_~min1~0_194 v_~min1~0_193) (not .cse0)) (and (= v_~min1~0_193 .cse1) .cse0)))) (= |v_thread1Thread1of1ForFork0_#res.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_21| 0) (= v_thread1Thread1of1ForFork0_~i~0_120 1) (not (< v_thread1Thread1of1ForFork0_~i~0_120 v_~N~0_155))) InVars {~A~0.base=v_~A~0.base_165, ~A~0.offset=v_~A~0.offset_166, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_144|, #memory_int=|v_#memory_int_270|, ~N~0=v_~N~0_155, ~min1~0=v_~min1~0_194} OutVars{~A~0.base=v_~A~0.base_165, ~A~0.offset=v_~A~0.offset_166, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_82|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_21|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_143|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_90|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_120, #memory_int=|v_#memory_int_270|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_21|, ~N~0=v_~N~0_155, ~min1~0=v_~min1~0_193} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#res.offset, ~min1~0] and [477] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (let ((.cse0 (select (select |v_#memory_int_94| v_~A~0.base_55) (+ v_~A~0.offset_55 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (let ((.cse1 (< .cse0 v_~min2~0_80))) (or (and (= .cse0 v_~min2~0_79) .cse1) (and (= v_~min2~0_79 v_~min2~0_80) (not .cse1) (= |v_thread3Thread1of1ForFork2_#t~mem9_32| |v_thread3Thread1of1ForFork2_#t~mem9_31|))))) (< 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, #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, ~min2~0=v_~min2~0_80} OutVars{~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, #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, ~min2~0=v_~min2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min2~0] [2022-12-06 00:19:25,685 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:25,686 WARN L322 ript$VariableManager]: TermVariable LBE235 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:25,686 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:25,686 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:19:26,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [608] $Ultimate##0-->L70-4: Formula: (let ((.cse2 (select |v_#memory_int_296| v_~A~0.base_191)) (.cse5 (* v_~M~0_121 4))) (and (let ((.cse1 (select .cse2 v_~A~0.offset_192))) (let ((.cse0 (< .cse1 v_~min1~0_222))) (or (and .cse0 (= v_~min1~0_221 .cse1)) (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_172| |v_thread1Thread1of1ForFork0_#t~mem3_171|) (= v_~min1~0_222 v_~min1~0_221))))) (= |v_thread1Thread1of1ForFork0_#res.offset_35| 0) (= v_thread1Thread1of1ForFork0_~i~0_134 1) (let ((.cse4 (select .cse2 (+ .cse5 v_~A~0.offset_192 4)))) (let ((.cse3 (< .cse4 v_~min2~0_229))) (or (and (= v_~min2~0_229 v_~min2~0_228) (= |v_thread3Thread1of1ForFork2_#t~mem9_95| |v_thread3Thread1of1ForFork2_#t~mem9_94|) (not .cse3)) (and .cse3 (= v_~min2~0_228 .cse4))))) (< 0 v_~N~0_181) (= |v_thread1Thread1of1ForFork0_#res.base_35| 0) (= (+ v_~M~0_121 2) v_thread3Thread1of1ForFork2_~i~2_130) (< (+ v_~M~0_121 1) v_~N~0_181) (let ((.cse7 (select .cse2 (+ .cse5 v_~A~0.offset_192)))) (let ((.cse6 (< .cse7 v_~min2~0_230))) (or (and (not .cse6) (= v_~min2~0_229 v_~min2~0_230) (= |v_thread3Thread1of1ForFork2_#t~mem9_95| |v_thread3Thread1of1ForFork2_#t~mem9_96|)) (and .cse6 (= v_~min2~0_229 .cse7))))) (not (< v_thread1Thread1of1ForFork0_~i~0_134 v_~N~0_181)))) InVars {~A~0.base=v_~A~0.base_191, ~A~0.offset=v_~A~0.offset_192, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_172|, ~M~0=v_~M~0_121, #memory_int=|v_#memory_int_296|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_96|, ~N~0=v_~N~0_181, ~min1~0=v_~min1~0_222, ~min2~0=v_~min2~0_230} OutVars{~A~0.base=v_~A~0.base_191, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_35|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_53|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_134, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_35|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_94|, ~N~0=v_~N~0_181, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_130, ~A~0.offset=v_~A~0.offset_192, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_96|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_171|, ~M~0=v_~M~0_121, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_104|, #memory_int=|v_#memory_int_296|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_57|, ~min1~0=v_~min1~0_221, ~min2~0=v_~min2~0_228} AuxVars[|v_thread3Thread1of1ForFork2_#t~mem9_95|, v_~min2~0_229] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread3Thread1of1ForFork2_#t~mem8, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, ~min1~0, thread3Thread1of1ForFork2_~i~2, ~min2~0] and [579] $Ultimate##0-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_100 0) (= |v_thread2Thread1of1ForFork1_#res.offset_23| 0) (= |v_thread2Thread1of1ForFork1_#res.base_23| 0) (not (< v_thread2Thread1of1ForFork1_~i~1_100 v_~M~0_101))) InVars {~M~0=v_~M~0_101} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_23|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_100, ~M~0=v_~M~0_101, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#res.base] [2022-12-06 00:19:26,515 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_59 (+ 1 v_~M~0_73)) (let ((.cse1 (select (select |v_#memory_int_222| v_~A~0.base_124) (+ v_~A~0.offset_124 (- 4) (* v_thread3Thread1of1ForFork2_~i~2_59 4))))) (let ((.cse0 (< .cse1 v_~min2~0_144))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem9_42| |v_thread3Thread1of1ForFork2_#t~mem9_41|) (= v_~min2~0_144 v_~min2~0_143)) (and .cse0 (= .cse1 v_~min2~0_143))))) (< v_thread3Thread1of1ForFork2_~i~2_59 (+ v_~N~0_117 1))) InVars {~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, ~M~0=v_~M~0_73, #memory_int=|v_#memory_int_222|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_42|, ~N~0=v_~N~0_117, ~min2~0=v_~min2~0_144} OutVars{~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, ~M~0=v_~M~0_73, #memory_int=|v_#memory_int_222|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_23|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_27|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_41|, ~N~0=v_~N~0_117, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, ~min2~0=v_~min2~0_143} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min2~0] and [579] $Ultimate##0-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_100 0) (= |v_thread2Thread1of1ForFork1_#res.offset_23| 0) (= |v_thread2Thread1of1ForFork1_#res.base_23| 0) (not (< v_thread2Thread1of1ForFork1_~i~1_100 v_~M~0_101))) InVars {~M~0=v_~M~0_101} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_23|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_100, ~M~0=v_~M~0_101, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#res.base] [2022-12-06 00:19:26,597 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 00:19:26,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1577 [2022-12-06 00:19:26,599 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 172 flow [2022-12-06 00:19:26,600 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 00:19:26,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:26,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:26,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:19:26,600 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 00:19:26,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash 211552743, now seen corresponding path program 1 times [2022-12-06 00:19:26,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:26,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62874908] [2022-12-06 00:19:26,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:26,713 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 00:19:26,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:26,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62874908] [2022-12-06 00:19:26,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62874908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:26,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:19:26,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:19:26,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715596884] [2022-12-06 00:19:26,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:26,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:19:26,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:26,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:19:26,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:19:26,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:19:26,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:26,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:26,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:19:26,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:26,748 INFO L130 PetriNetUnfolder]: 38/79 cut-off events. [2022-12-06 00:19:26,748 INFO L131 PetriNetUnfolder]: For 430/430 co-relation queries the response was YES. [2022-12-06 00:19:26,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 79 events. 38/79 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 156 event pairs, 16 based on Foata normal form. 4/83 useless extension candidates. Maximal degree in co-relation 273. Up to 79 conditions per place. [2022-12-06 00:19:26,749 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 20 selfloop transitions, 1 changer transitions 1/22 dead transitions. [2022-12-06 00:19:26,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 22 transitions, 177 flow [2022-12-06 00:19:26,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:19:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:19:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 00:19:26,750 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 00:19:26,750 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 172 flow. Second operand 3 states and 23 transitions. [2022-12-06 00:19:26,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 22 transitions, 177 flow [2022-12-06 00:19:26,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 120 flow, removed 11 selfloop flow, removed 12 redundant places. [2022-12-06 00:19:26,751 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 73 flow [2022-12-06 00:19:26,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2022-12-06 00:19:26,752 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-12-06 00:19:26,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:26,752 INFO L89 Accepts]: Start accepts. Operand has 30 places, 21 transitions, 73 flow [2022-12-06 00:19:26,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:26,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:26,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 21 transitions, 73 flow [2022-12-06 00:19:26,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 73 flow [2022-12-06 00:19:26,757 INFO L130 PetriNetUnfolder]: 5/23 cut-off events. [2022-12-06 00:19:26,758 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:19:26,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 23 events. 5/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 46. Up to 6 conditions per place. [2022-12-06 00:19:26,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 73 flow [2022-12-06 00:19:26,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-06 00:19:26,758 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:19:26,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 00:19:26,760 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 73 flow [2022-12-06 00:19:26,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:26,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:26,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:26,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:19:26,760 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 00:19:26,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash 597705175, now seen corresponding path program 1 times [2022-12-06 00:19:26,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:26,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736194947] [2022-12-06 00:19:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:26,895 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 00:19:26,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:26,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736194947] [2022-12-06 00:19:26,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736194947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:26,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:19:26,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:19:26,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705031547] [2022-12-06 00:19:26,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:26,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:19:26,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:26,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:19:26,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:19:26,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 00:19:26,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:26,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:26,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 00:19:26,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:26,920 INFO L130 PetriNetUnfolder]: 5/14 cut-off events. [2022-12-06 00:19:26,921 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:19:26,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 14 events. 5/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 4/14 useless extension candidates. Maximal degree in co-relation 52. Up to 7 conditions per place. [2022-12-06 00:19:26,921 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 0 selfloop transitions, 0 changer transitions 11/11 dead transitions. [2022-12-06 00:19:26,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 11 transitions, 61 flow [2022-12-06 00:19:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:19:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:19:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-12-06 00:19:26,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1625 [2022-12-06 00:19:26,922 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 73 flow. Second operand 4 states and 13 transitions. [2022-12-06 00:19:26,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 11 transitions, 61 flow [2022-12-06 00:19:26,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 11 transitions, 59 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:19:26,923 INFO L231 Difference]: Finished difference. Result has 19 places, 0 transitions, 0 flow [2022-12-06 00:19:26,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=35, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=19, PETRI_TRANSITIONS=0} [2022-12-06 00:19:26,924 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -11 predicate places. [2022-12-06 00:19:26,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:26,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 0 transitions, 0 flow [2022-12-06 00:19:26,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 00:19:26,925 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 00:19:26,925 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:19:26,925 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 00:19:26,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 00:19:26,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:19:26,925 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:19:26,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 00:19:26,926 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 00:19:26,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:26,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 00:19:26,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 00:19:26,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 00:19:26,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 00:19:26,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:19:26,929 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:26,933 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:19:26,934 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:19:26,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:19:26 BasicIcfg [2022-12-06 00:19:26,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:19:26,936 INFO L158 Benchmark]: Toolchain (without parser) took 25628.15ms. Allocated memory was 191.9MB in the beginning and 389.0MB in the end (delta: 197.1MB). Free memory was 167.5MB in the beginning and 225.4MB in the end (delta: -57.9MB). Peak memory consumption was 140.8MB. Max. memory is 8.0GB. [2022-12-06 00:19:26,937 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 191.9MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:19:26,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.14ms. Allocated memory is still 191.9MB. Free memory was 167.0MB in the beginning and 155.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 00:19:26,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.70ms. Allocated memory is still 191.9MB. Free memory was 155.0MB in the beginning and 153.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:19:26,937 INFO L158 Benchmark]: Boogie Preprocessor took 34.02ms. Allocated memory is still 191.9MB. Free memory was 153.4MB in the beginning and 151.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:19:26,938 INFO L158 Benchmark]: RCFGBuilder took 965.57ms. Allocated memory is still 191.9MB. Free memory was 151.3MB in the beginning and 130.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 00:19:26,938 INFO L158 Benchmark]: TraceAbstraction took 24246.79ms. Allocated memory was 191.9MB in the beginning and 389.0MB in the end (delta: 197.1MB). Free memory was 129.8MB in the beginning and 225.4MB in the end (delta: -95.6MB). Peak memory consumption was 103.1MB. Max. memory is 8.0GB. [2022-12-06 00:19:26,939 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.13ms. Allocated memory is still 191.9MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 320.14ms. Allocated memory is still 191.9MB. Free memory was 167.0MB in the beginning and 155.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.70ms. Allocated memory is still 191.9MB. Free memory was 155.0MB in the beginning and 153.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.02ms. Allocated memory is still 191.9MB. Free memory was 153.4MB in the beginning and 151.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 965.57ms. Allocated memory is still 191.9MB. Free memory was 151.3MB in the beginning and 130.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 24246.79ms. Allocated memory was 191.9MB in the beginning and 389.0MB in the end (delta: 197.1MB). Free memory was 129.8MB in the beginning and 225.4MB in the end (delta: -95.6MB). Peak memory consumption was 103.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 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: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, 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.1s, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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.3s, 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: 0.9s, 39 PlacesBefore, 39 PlacesAfterwards, 48 TransitionsBefore, 48 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: 24, independent: 24, independent conditional: 17, 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: 24, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 34, independent conditional: 13, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 17, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 55, Positive conditional cache size: 30, 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: 1.8s, 54 PlacesBefore, 52 PlacesAfterwards, 76 TransitionsBefore, 74 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, 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: 32, independent: 31, independent conditional: 28, independent unconditional: 3, 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: 32, independent: 31, independent conditional: 28, independent unconditional: 3, 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: 30, independent: 29, independent conditional: 26, independent unconditional: 3, 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: 30, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 30, unknown conditional: 27, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 95, Positive conditional cache size: 61, Positive unconditional cache size: 34, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 50 PlacesBefore, 51 PlacesAfterwards, 48 TransitionsBefore, 49 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 128, independent conditional: 128, 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: 128, independent: 128, independent conditional: 69, independent unconditional: 59, 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: 128, independent: 128, independent conditional: 69, independent unconditional: 59, 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: 128, independent: 128, independent conditional: 69, independent unconditional: 59, 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: 33, independent: 33, independent conditional: 20, independent unconditional: 13, 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: 33, independent: 33, independent conditional: 0, independent unconditional: 33, 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: 128, independent: 95, independent conditional: 49, independent unconditional: 46, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 33, unknown conditional: 20, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 146, Positive conditional cache size: 90, Positive unconditional cache size: 56, Negative cache size: 2, Negative conditional cache size: 2, 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: 1.1s, 51 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 42 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 141, independent conditional: 141, 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: 141, independent: 141, independent conditional: 93, independent unconditional: 48, 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: 141, independent: 141, independent conditional: 93, independent unconditional: 48, 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: 141, independent: 141, independent conditional: 93, independent unconditional: 48, 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: 25, independent: 25, independent conditional: 18, 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: 25, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 141, independent: 116, independent conditional: 75, independent unconditional: 41, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 25, unknown conditional: 18, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 267, Positive conditional cache size: 193, Positive unconditional cache size: 74, Negative cache size: 2, Negative conditional cache size: 2, 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: 1.6s, 48 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 24 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 59, independent conditional: 59, 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: 59, independent: 59, independent conditional: 51, independent unconditional: 8, 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: 59, independent: 59, independent conditional: 48, independent unconditional: 11, 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: 59, independent: 59, independent conditional: 48, independent unconditional: 11, 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: 25, independent: 25, independent conditional: 22, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 59, independent: 34, independent conditional: 26, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 25, unknown conditional: 22, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 298, Positive conditional cache size: 218, Positive unconditional cache size: 80, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 32 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): 300, Positive cache size: 298, Positive conditional cache size: 218, Positive unconditional cache size: 80, Negative cache size: 2, Negative conditional cache size: 2, 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.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): 300, Positive cache size: 298, Positive conditional cache size: 218, Positive unconditional cache size: 80, Negative cache size: 2, Negative conditional cache size: 2, 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: 24.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1521 IncrementalHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 14 mSDtfsCounter, 1521 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=5, InterpolantAutomatonStates: 57, 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.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 290 ConstructedInterpolants, 7 QuantifiedInterpolants, 3243 SizeOfPredicates, 43 NumberOfNonLiveVariables, 610 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 2/11 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 00:19:26,981 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...