/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:41:06,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:41:06,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:41:06,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:41:06,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:41:06,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:41:06,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:41:06,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:41:06,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:41:06,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:41:06,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:41:06,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:41:06,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:41:06,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:41:06,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:41:06,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:41:06,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:41:06,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:41:06,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:41:06,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:41:06,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:41:06,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:41:06,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:41:06,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:41:06,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:41:06,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:41:06,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:41:06,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:41:06,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:41:06,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:41:06,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:41:06,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:41:06,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:41:06,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:41:06,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:41:06,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:41:06,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:41:06,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:41:06,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:41:06,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:41:06,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:41:06,814 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 02:41:06,841 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:41:06,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:41:06,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:41:06,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:41:06,843 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:41:06,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:41:06,844 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:41:06,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:41:06,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:41:06,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:41:06,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:41:06,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:41:06,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:41:06,845 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:41:06,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:41:06,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:41:06,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:41:06,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:41:06,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:41:06,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:41:06,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:41:06,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:41:06,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:41:06,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:41:06,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:41:06,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:41:06,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:41:06,847 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:41:06,847 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:41:07,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:41:07,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:41:07,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:41:07,162 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:41:07,162 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:41:07,163 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-12-06 02:41:08,362 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:41:08,522 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:41:08,522 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-12-06 02:41:08,527 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1713b1d76/14fabf7766034522b824eafd3cf95f1a/FLAGe6ae573af [2022-12-06 02:41:08,537 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1713b1d76/14fabf7766034522b824eafd3cf95f1a [2022-12-06 02:41:08,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:41:08,541 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:41:08,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:41:08,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:41:08,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:41:08,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@509fe709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08, skipping insertion in model container [2022-12-06 02:41:08,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:41:08,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:41:08,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:08,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:08,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:08,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:08,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:08,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:08,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:08,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:08,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:08,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:08,697 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-horseshoe.wvr.c[3424,3437] [2022-12-06 02:41:08,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:41:08,713 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:41:08,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:08,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:08,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:08,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:08,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:08,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:08,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:08,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:08,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:08,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:08,758 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-horseshoe.wvr.c[3424,3437] [2022-12-06 02:41:08,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:41:08,779 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:41:08,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08 WrapperNode [2022-12-06 02:41:08,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:41:08,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:41:08,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:41:08,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:41:08,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,847 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-12-06 02:41:08,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:41:08,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:41:08,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:41:08,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:41:08,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,886 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:41:08,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:41:08,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:41:08,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:41:08,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (1/1) ... [2022-12-06 02:41:08,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:41:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:08,932 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 02:41:08,957 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 02:41:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:41:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:41:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:41:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:41:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:41:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:41:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:41:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:41:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:41:08,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:41:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:41:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:41:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:41:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:41:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:41:08,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:41:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:41:08,977 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 02:41:09,138 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:41:09,139 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:41:09,524 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:41:09,674 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:41:09,675 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 02:41:09,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:41:09 BoogieIcfgContainer [2022-12-06 02:41:09,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:41:09,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:41:09,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:41:09,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:41:09,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:41:08" (1/3) ... [2022-12-06 02:41:09,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f492e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:41:09, skipping insertion in model container [2022-12-06 02:41:09,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:08" (2/3) ... [2022-12-06 02:41:09,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f492e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:41:09, skipping insertion in model container [2022-12-06 02:41:09,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:41:09" (3/3) ... [2022-12-06 02:41:09,693 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2022-12-06 02:41:09,710 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:41:09,711 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:41:09,711 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:41:09,782 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 02:41:09,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 412 flow [2022-12-06 02:41:09,926 INFO L130 PetriNetUnfolder]: 18/191 cut-off events. [2022-12-06 02:41:09,926 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:41:09,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 191 events. 18/191 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 111 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2022-12-06 02:41:09,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 412 flow [2022-12-06 02:41:09,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 181 transitions, 380 flow [2022-12-06 02:41:09,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:09,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 181 transitions, 380 flow [2022-12-06 02:41:09,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 181 transitions, 380 flow [2022-12-06 02:41:10,046 INFO L130 PetriNetUnfolder]: 18/181 cut-off events. [2022-12-06 02:41:10,047 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:41:10,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 181 events. 18/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 112 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2022-12-06 02:41:10,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 181 transitions, 380 flow [2022-12-06 02:41:10,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-06 02:41:17,668 INFO L203 LiptonReduction]: Total number of compositions: 152 [2022-12-06 02:41:17,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:41:17,687 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;@dc75aae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:41:17,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 02:41:17,693 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 02:41:17,694 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:41:17,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:17,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:17,695 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 02:41:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 717820976, now seen corresponding path program 1 times [2022-12-06 02:41:17,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:17,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55551061] [2022-12-06 02:41:17,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:17,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:17,926 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 02:41:17,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:17,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55551061] [2022-12-06 02:41:17,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55551061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:41:17,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:41:17,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:41:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653857258] [2022-12-06 02:41:17,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:41:17,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 02:41:17,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:17,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 02:41:17,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 02:41:17,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 02:41:17,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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 02:41:17,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:17,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 02:41:17,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:18,092 INFO L130 PetriNetUnfolder]: 321/458 cut-off events. [2022-12-06 02:41:18,092 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 02:41:18,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 458 events. 321/458 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1460 event pairs, 166 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 732. Up to 449 conditions per place. [2022-12-06 02:41:18,097 INFO L137 encePairwiseOnDemand]: 27/28 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2022-12-06 02:41:18,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 120 flow [2022-12-06 02:41:18,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 02:41:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 02:41:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2022-12-06 02:41:18,107 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2022-12-06 02:41:18,109 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-06 02:41:18,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:18,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 120 flow [2022-12-06 02:41:18,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 120 flow [2022-12-06 02:41:18,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 02:41:18,116 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:18,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 02:41:18,118 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 120 flow [2022-12-06 02:41:18,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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 02:41:18,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:18,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:18,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:41:18,119 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 02:41:18,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:18,120 INFO L85 PathProgramCache]: Analyzing trace with hash 749797966, now seen corresponding path program 1 times [2022-12-06 02:41:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:18,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316880402] [2022-12-06 02:41:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:18,394 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 02:41:18,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:18,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316880402] [2022-12-06 02:41:18,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316880402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:41:18,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:41:18,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:41:18,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53327769] [2022-12-06 02:41:18,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:41:18,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:41:18,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:18,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:41:18,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:41:18,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 02:41:18,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:18,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:18,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 02:41:18,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:18,538 INFO L130 PetriNetUnfolder]: 326/478 cut-off events. [2022-12-06 02:41:18,539 INFO L131 PetriNetUnfolder]: For 45/47 co-relation queries the response was YES. [2022-12-06 02:41:18,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 478 events. 326/478 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1530 event pairs, 167 based on Foata normal form. 15/336 useless extension candidates. Maximal degree in co-relation 1078. Up to 466 conditions per place. [2022-12-06 02:41:18,546 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 23 selfloop transitions, 2 changer transitions 11/39 dead transitions. [2022-12-06 02:41:18,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 249 flow [2022-12-06 02:41:18,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:41:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:41:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 02:41:18,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-06 02:41:18,550 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2022-12-06 02:41:18,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:18,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 39 transitions, 249 flow [2022-12-06 02:41:18,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 39 transitions, 249 flow [2022-12-06 02:41:18,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 02:41:21,976 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:41:21,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3427 [2022-12-06 02:41:21,977 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 38 transitions, 243 flow [2022-12-06 02:41:21,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:21,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:21,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:21,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:41:21,978 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 02:41:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:21,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1187507402, now seen corresponding path program 1 times [2022-12-06 02:41:21,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:21,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860482774] [2022-12-06 02:41:21,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:21,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:22,175 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 02:41:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:22,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860482774] [2022-12-06 02:41:22,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860482774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:41:22,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:41:22,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:41:22,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187993785] [2022-12-06 02:41:22,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:41:22,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:41:22,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:22,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:41:22,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:41:22,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 02:41:22,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 38 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:22,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:22,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 02:41:22,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:22,369 INFO L130 PetriNetUnfolder]: 373/580 cut-off events. [2022-12-06 02:41:22,369 INFO L131 PetriNetUnfolder]: For 103/107 co-relation queries the response was YES. [2022-12-06 02:41:22,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 580 events. 373/580 cut-off events. For 103/107 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2138 event pairs, 195 based on Foata normal form. 31/433 useless extension candidates. Maximal degree in co-relation 1424. Up to 555 conditions per place. [2022-12-06 02:41:22,373 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 22 selfloop transitions, 3 changer transitions 31/59 dead transitions. [2022-12-06 02:41:22,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 502 flow [2022-12-06 02:41:22,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:41:22,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:41:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 02:41:22,375 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2022-12-06 02:41:22,376 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-06 02:41:22,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:22,376 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 59 transitions, 502 flow [2022-12-06 02:41:22,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 59 transitions, 502 flow [2022-12-06 02:41:22,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 02:41:22,381 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:22,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:41:22,382 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 59 transitions, 502 flow [2022-12-06 02:41:22,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:22,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:22,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:22,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:41:22,383 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 02:41:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash 620826208, now seen corresponding path program 1 times [2022-12-06 02:41:22,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:22,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704466376] [2022-12-06 02:41:22,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:22,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:22,518 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 02:41:22,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:22,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704466376] [2022-12-06 02:41:22,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704466376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:41:22,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:41:22,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:41:22,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599548098] [2022-12-06 02:41:22,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:41:22,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:41:22,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:22,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:41:22,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:41:22,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 02:41:22,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 59 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 02:41:22,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:22,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 02:41:22,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:22,634 INFO L130 PetriNetUnfolder]: 388/599 cut-off events. [2022-12-06 02:41:22,635 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-12-06 02:41:22,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 599 events. 388/599 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2082 event pairs, 76 based on Foata normal form. 18/429 useless extension candidates. Maximal degree in co-relation 1956. Up to 574 conditions per place. [2022-12-06 02:41:22,640 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 32 selfloop transitions, 3 changer transitions 29/67 dead transitions. [2022-12-06 02:41:22,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 67 transitions, 700 flow [2022-12-06 02:41:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:41:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:41:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 02:41:22,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 02:41:22,642 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-06 02:41:22,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:22,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 67 transitions, 700 flow [2022-12-06 02:41:22,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 67 transitions, 700 flow [2022-12-06 02:41:22,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 02:41:22,648 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:22,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 02:41:22,649 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 67 transitions, 700 flow [2022-12-06 02:41:22,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 02:41:22,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:22,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:22,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:41:22,650 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 02:41:22,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:22,651 INFO L85 PathProgramCache]: Analyzing trace with hash 727953756, now seen corresponding path program 2 times [2022-12-06 02:41:22,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:22,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668462390] [2022-12-06 02:41:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:24,179 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 02:41:24,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:24,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668462390] [2022-12-06 02:41:24,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668462390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:24,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322498348] [2022-12-06 02:41:24,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:41:24,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:24,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:24,183 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 02:41:24,204 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 02:41:24,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 02:41:24,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:24,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 02:41:24,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:24,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:41:24,648 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 18 treesize of output 20 [2022-12-06 02:41:24,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 02:41:24,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2022-12-06 02:41:24,838 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 02:41:24,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:41:24,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322498348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:41:24,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:41:24,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 16 [2022-12-06 02:41:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033864079] [2022-12-06 02:41:24,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:41:24,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 02:41:24,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:24,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 02:41:24,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:41:24,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 02:41:24,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 67 transitions, 700 flow. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 02:41:24,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:24,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 02:41:24,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:25,213 INFO L130 PetriNetUnfolder]: 425/752 cut-off events. [2022-12-06 02:41:25,213 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-12-06 02:41:25,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4317 conditions, 752 events. 425/752 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3121 event pairs, 54 based on Foata normal form. 9/584 useless extension candidates. Maximal degree in co-relation 2337. Up to 671 conditions per place. [2022-12-06 02:41:25,220 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 48 selfloop transitions, 9 changer transitions 74/133 dead transitions. [2022-12-06 02:41:25,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 133 transitions, 1664 flow [2022-12-06 02:41:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:41:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:41:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-12-06 02:41:25,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-06 02:41:25,227 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2022-12-06 02:41:25,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:25,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 133 transitions, 1664 flow [2022-12-06 02:41:25,236 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 133 transitions, 1664 flow [2022-12-06 02:41:25,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 02:41:28,826 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:41:28,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3600 [2022-12-06 02:41:28,827 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 132 transitions, 1652 flow [2022-12-06 02:41:28,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 02:41:28,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:28,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:28,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:29,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:29,034 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 02:41:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1962384035, now seen corresponding path program 1 times [2022-12-06 02:41:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:29,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543850755] [2022-12-06 02:41:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:30,501 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 02:41:30,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:30,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543850755] [2022-12-06 02:41:30,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543850755] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:30,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769673408] [2022-12-06 02:41:30,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:30,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:30,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:30,504 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 02:41:30,531 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 02:41:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:30,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 02:41:30,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:30,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 02:41:30,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:41:30,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:41:30,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:41:30,974 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 18 treesize of output 20 [2022-12-06 02:41:31,179 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-12-06 02:41:31,180 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 43 treesize of output 30 [2022-12-06 02:41:31,219 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 02:41:31,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:32,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:41:32,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 139 [2022-12-06 02:41:32,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:41:32,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61978 treesize of output 57782 [2022-12-06 02:41:32,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:41:32,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57682 treesize of output 51326 [2022-12-06 02:41:32,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:41:32,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51186 treesize of output 38366 [2022-12-06 02:41:33,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:41:33,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37708 treesize of output 34574 [2022-12-06 02:44:16,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:16,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 140 [2022-12-06 02:44:16,172 INFO L321 Elim1Store]: treesize reduction 46, result has 54.5 percent of original size [2022-12-06 02:44:16,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8246 treesize of output 7732 [2022-12-06 02:44:16,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:16,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:16,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 7670 treesize of output 7280 [2022-12-06 02:44:16,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:16,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:16,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 7002 treesize of output 6178 [2022-12-06 02:44:16,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:16,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:16,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 6322 treesize of output 4626 [2022-12-06 02:44:40,489 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 02:44:40,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769673408] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:40,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:40,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2022-12-06 02:44:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7070690] [2022-12-06 02:44:40,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:40,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 02:44:40,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:40,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 02:44:40,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=609, Unknown=5, NotChecked=0, Total=702 [2022-12-06 02:44:40,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 02:44:40,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 132 transitions, 1652 flow. Second operand has 27 states, 27 states have (on average 4.074074074074074) internal successors, (110), 27 states have internal predecessors, (110), 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 02:44:40,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:40,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 02:44:40,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:45,729 INFO L130 PetriNetUnfolder]: 984/1723 cut-off events. [2022-12-06 02:44:45,730 INFO L131 PetriNetUnfolder]: For 840/840 co-relation queries the response was YES. [2022-12-06 02:44:45,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11548 conditions, 1723 events. 984/1723 cut-off events. For 840/840 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8939 event pairs, 32 based on Foata normal form. 2/1332 useless extension candidates. Maximal degree in co-relation 4369. Up to 1533 conditions per place. [2022-12-06 02:44:45,744 INFO L137 encePairwiseOnDemand]: 11/29 looper letters, 138 selfloop transitions, 60 changer transitions 235/435 dead transitions. [2022-12-06 02:44:45,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 435 transitions, 6334 flow [2022-12-06 02:44:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 02:44:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 02:44:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 296 transitions. [2022-12-06 02:44:45,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916256157635468 [2022-12-06 02:44:45,750 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2022-12-06 02:44:45,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:45,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 435 transitions, 6334 flow [2022-12-06 02:44:45,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 435 transitions, 6334 flow [2022-12-06 02:44:45,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-06 02:44:45,771 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [844] L119-3-->L120-3: Formula: (and (= |v_#pthreadsForks_81| |v_ULTIMATE.start_main_#t~pre21#1_43|) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre21#1_43|)) |v_#memory_int_211|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_33|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 02:44:49,045 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [851] L47-4-->L47-4: Formula: (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (< |v_thread1Thread1of1ForFork2_~i~0#1_32| v_~N~0_50) (not (= (ite (and (<= 0 v_~q1_back~0_168) (< v_~q1_back~0_168 v_~n1~0_107)) 1 0) 0)) (= (+ v_~q1_back~0_168 1) v_~q1_back~0_167) (= |v_thread1Thread1of1ForFork2_~i~0#1_31| (+ |v_thread1Thread1of1ForFork2_~i~0#1_32| 1)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_37| 0)) (= (ite (= (select (select |v_#memory_int_229| v_~q1~0.base_76) (+ v_~q1~0.offset_76 (* v_~q1_back~0_168 4))) 2) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|)) InVars {~q1~0.offset=v_~q1~0.offset_76, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_32|, ~q1_back~0=v_~q1_back~0_168, ~n1~0=v_~n1~0_107, ~q1~0.base=v_~q1~0.base_76, #memory_int=|v_#memory_int_229|, ~N~0=v_~N~0_50} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_19|, ~q1~0.offset=v_~q1~0.offset_76, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_13|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_31|, ~q1_back~0=v_~q1_back~0_167, ~n1~0=v_~n1~0_107, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|, ~q1~0.base=v_~q1~0.base_76, #memory_int=|v_#memory_int_229|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_13|, ~N~0=v_~N~0_50, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_37|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [844] L119-3-->L120-3: Formula: (and (= |v_#pthreadsForks_81| |v_ULTIMATE.start_main_#t~pre21#1_43|) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre21#1_43|)) |v_#memory_int_211|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_33|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 02:44:49,250 WARN L322 ript$VariableManager]: TermVariable LBE410 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 02:44:49,250 WARN L322 ript$VariableManager]: TermVariable LBE381 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 02:44:49,250 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 02:44:49,250 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 02:44:49,385 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 02:44:49,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3636 [2022-12-06 02:44:49,386 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 434 transitions, 6324 flow [2022-12-06 02:44:49,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.074074074074074) internal successors, (110), 27 states have internal predecessors, (110), 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 02:44:49,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:49,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:49,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 02:44:49,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 02:44:49,591 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 02:44:49,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash -225767611, now seen corresponding path program 2 times [2022-12-06 02:44:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:49,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507746275] [2022-12-06 02:44:49,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:51,049 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 02:44:51,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:51,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507746275] [2022-12-06 02:44:51,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507746275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:51,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124466812] [2022-12-06 02:44:51,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:44:51,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:51,051 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 02:44:51,052 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 02:44:51,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 02:44:51,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:51,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 02:44:51,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:51,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:51,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 216 [2022-12-06 02:44:51,571 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 02:44:51,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 49 [2022-12-06 02:44:51,594 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 32 treesize of output 20 [2022-12-06 02:44:51,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2022-12-06 02:44:51,707 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 02:44:51,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:44:51,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124466812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:44:51,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:44:51,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 16 [2022-12-06 02:44:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060401346] [2022-12-06 02:44:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:44:51,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 02:44:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 02:44:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:44:51,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-06 02:44:51,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 434 transitions, 6324 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:51,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:51,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-06 02:44:51,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:52,356 INFO L130 PetriNetUnfolder]: 964/1715 cut-off events. [2022-12-06 02:44:52,356 INFO L131 PetriNetUnfolder]: For 930/930 co-relation queries the response was YES. [2022-12-06 02:44:52,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13156 conditions, 1715 events. 964/1715 cut-off events. For 930/930 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9254 event pairs, 40 based on Foata normal form. 2/1345 useless extension candidates. Maximal degree in co-relation 4623. Up to 1524 conditions per place. [2022-12-06 02:44:52,372 INFO L137 encePairwiseOnDemand]: 19/34 looper letters, 155 selfloop transitions, 13 changer transitions 282/452 dead transitions. [2022-12-06 02:44:52,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 452 transitions, 7501 flow [2022-12-06 02:44:52,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:44:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:44:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-12-06 02:44:52,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35661764705882354 [2022-12-06 02:44:52,375 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 54 predicate places. [2022-12-06 02:44:52,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:52,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 452 transitions, 7501 flow [2022-12-06 02:44:52,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 452 transitions, 7501 flow [2022-12-06 02:44:52,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-06 02:44:52,395 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:52,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 02:44:52,396 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 452 transitions, 7501 flow [2022-12-06 02:44:52,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:52,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:52,396 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:52,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 02:44:52,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:52,602 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 02:44:52,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1173567275, now seen corresponding path program 3 times [2022-12-06 02:44:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:52,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963553025] [2022-12-06 02:44:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:52,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:53,883 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 02:44:53,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963553025] [2022-12-06 02:44:53,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963553025] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050974536] [2022-12-06 02:44:53,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:44:53,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:53,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:53,886 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:44:53,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 02:44:54,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-06 02:44:54,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:54,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 02:44:54,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:54,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:54,207 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 18 treesize of output 20 [2022-12-06 02:44:54,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:54,266 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 18 treesize of output 20 [2022-12-06 02:44:54,449 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-12-06 02:44:54,450 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 49 treesize of output 30 [2022-12-06 02:44:54,480 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 02:44:54,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:44:54,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050974536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:44:54,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:44:54,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 15 [2022-12-06 02:44:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421918022] [2022-12-06 02:44:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:44:54,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 02:44:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:54,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 02:44:54,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:44:54,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 02:44:54,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 452 transitions, 7501 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:54,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:54,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 02:44:54,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:55,039 INFO L130 PetriNetUnfolder]: 1001/1832 cut-off events. [2022-12-06 02:44:55,040 INFO L131 PetriNetUnfolder]: For 1077/1077 co-relation queries the response was YES. [2022-12-06 02:44:55,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15784 conditions, 1832 events. 1001/1832 cut-off events. For 1077/1077 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10453 event pairs, 60 based on Foata normal form. 1/1462 useless extension candidates. Maximal degree in co-relation 4802. Up to 1618 conditions per place. [2022-12-06 02:44:55,052 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 147 selfloop transitions, 12 changer transitions 349/510 dead transitions. [2022-12-06 02:44:55,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 510 transitions, 9501 flow [2022-12-06 02:44:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:44:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:44:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-06 02:44:55,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38839285714285715 [2022-12-06 02:44:55,054 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 60 predicate places. [2022-12-06 02:44:55,055 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:55,055 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 510 transitions, 9501 flow [2022-12-06 02:44:55,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 510 transitions, 9501 flow [2022-12-06 02:44:55,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-06 02:44:55,078 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:55,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 02:44:55,079 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 510 transitions, 9501 flow [2022-12-06 02:44:55,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:55,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:55,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:55,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 02:44:55,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:55,285 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 02:44:55,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:55,286 INFO L85 PathProgramCache]: Analyzing trace with hash 17420765, now seen corresponding path program 4 times [2022-12-06 02:44:55,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:55,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713068893] [2022-12-06 02:44:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:55,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:56,431 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 02:44:56,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:56,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713068893] [2022-12-06 02:44:56,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713068893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:56,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600108134] [2022-12-06 02:44:56,432 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:44:56,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:56,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:56,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:44:56,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 02:44:56,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:44:56,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:56,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-06 02:44:56,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:56,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 02:44:56,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:56,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:56,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:56,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 02:44:56,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 02:44:56,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:44:56,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:56,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:44:57,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:57,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:57,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2022-12-06 02:44:57,277 INFO L321 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-12-06 02:44:57,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 21 [2022-12-06 02:44:57,312 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 02:44:57,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:00,469 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 02:45:00,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600108134] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:00,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:00,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-06 02:45:00,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815199790] [2022-12-06 02:45:00,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:00,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:45:00,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:45:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=643, Unknown=16, NotChecked=0, Total=756 [2022-12-06 02:45:00,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 02:45:00,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 510 transitions, 9501 flow. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 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 02:45:00,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:00,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 02:45:00,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:22,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 02:45:25,866 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~q2_back~0 4))) (let ((.cse36 (select |c_#memory_int| c_~q2~0.base)) (.cse5 (+ .cse11 c_~q2~0.offset)) (.cse13 (* c_~q2_front~0 4))) (let ((.cse33 (<= c_~q2_back~0 c_~q2_front~0)) (.cse34 (<= c_~n2~0 c_~q2_front~0)) (.cse28 (select |c_#memory_int| c_~q1~0.base)) (.cse1 (* c_~t~0 2)) (.cse3 (+ c_~q2~0.offset .cse13)) (.cse0 (not (< c_~q2_back~0 c_~n2~0))) (.cse8 (< c_~q2_back~0 c_~q2_front~0)) (.cse9 (< c_~q2_front~0 0)) (.cse38 (+ (select .cse36 .cse5) 1))) (and (= c_~s~0 (+ c_~t~0 1)) (or .cse0 (and (forall ((~q1_front~0 Int) (v_ArrVal_409 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse4 (select (select .cse2 c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))))) (or (< ~q1_front~0 0) (<= c_~n1~0 ~q1_front~0) (<= c_~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int))) (< (+ .cse1 (* (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~q2~0.base) .cse3) 2) 1) (+ c_~s~0 .cse4))) (not (= .cse4 (+ (select (select .cse2 c_~q2~0.base) .cse5) 1))))))) (forall ((~q1_front~0 Int) (v_ArrVal_409 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse6 (select (select .cse7 c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))))) (or (< ~q1_front~0 0) (<= c_~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int))) (<= (+ c_~s~0 .cse6) (+ .cse1 (* (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~q2~0.base) .cse3) 2) 2))) (<= c_~q1_back~0 ~q1_front~0) (not (= .cse6 (+ (select (select .cse7 c_~q2~0.base) .cse5) 1)))))))) .cse8 .cse9) (= c_~s~0 0) (or (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((~q1_back~0 Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_407 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse15 (+ .cse16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_407)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_408))) (or (forall ((~q1_front~0 Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse10 (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse12 (select (select .cse10 c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))))) (or (< ~q1_front~0 0) (not (= (+ (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse11 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) .cse12)) (< (+ .cse1 (* (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2) 1) (+ c_~s~0 .cse12)) (< ~q1_back~0 ~q1_front~0))))) (not (< ~q1_back~0 c_~n1~0)) (not (= (select (select .cse14 c_~q1~0.base) (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)) (not (<= 0 ~q1_back~0))))) (forall ((~q1_back~0 Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_407 Int)) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse15 (+ .cse16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_407)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_408))) (or (not (< ~q1_back~0 c_~n1~0)) (not (= (select (select .cse17 c_~q1~0.base) (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)) (forall ((~q1_front~0 Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse18 (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse19 (select (select .cse18 c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))))) (or (< ~q1_front~0 0) (not (= (+ (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse11 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) .cse19)) (< ~q1_back~0 ~q1_front~0) (<= (+ c_~s~0 .cse19) (+ .cse1 (* (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2) 2)))))) (not (<= 0 ~q1_back~0))))))) .cse0 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse8 .cse9) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 (let ((.cse22 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse24 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((~q1_back~0 Int) (v_ArrVal_408 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_408))) (or (not (= (select (select .cse20 c_~q1~0.base) (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)) (forall ((~q1_front~0 Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse21 (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse23 (select (select .cse21 c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))))) (or (< ~q1_front~0 0) (< (+ .cse1 (* 2 (select (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse22)) 1) (+ c_~s~0 .cse23)) (< ~q1_back~0 ~q1_front~0) (not (= .cse23 (+ (select (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse24) 1))))))) (not (< ~q1_back~0 c_~n1~0)) (not (<= 0 ~q1_back~0))))) (forall ((~q1_back~0 Int) (v_ArrVal_408 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_408))) (or (not (= (select (select .cse25 c_~q1~0.base) (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)) (not (< ~q1_back~0 c_~n1~0)) (not (<= 0 ~q1_back~0)) (forall ((~q1_front~0 Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse27 (store .cse25 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse26 (select (select .cse27 c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))))) (or (< ~q1_front~0 0) (<= (+ c_~s~0 .cse26) (+ .cse1 (* 2 (select (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse22)) 2)) (< ~q1_back~0 ~q1_front~0) (not (= .cse26 (+ (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse24) 1)))))))))))) .cse8 .cse9) (or (and (forall ((~q1_back~0 Int)) (or (not (= (select .cse28 (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)) (not (< ~q1_back~0 c_~n1~0)) (forall ((~q1_front~0 Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse30 (select (select .cse29 c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))))) (or (< ~q1_front~0 0) (< (+ .cse1 (* (select (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~q2~0.base) .cse3) 2) 1) (+ c_~s~0 .cse30)) (< ~q1_back~0 ~q1_front~0) (not (= .cse30 (+ (select (select .cse29 c_~q2~0.base) .cse5) 1))))))) (not (<= 0 ~q1_back~0)))) (forall ((~q1_back~0 Int)) (or (forall ((~q1_front~0 Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_409))) (let ((.cse31 (select (select .cse32 c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))))) (or (< ~q1_front~0 0) (<= (+ c_~s~0 .cse31) (+ .cse1 (* (select (select (store .cse32 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~q2~0.base) .cse3) 2) 2)) (< ~q1_back~0 ~q1_front~0) (not (= .cse31 (+ (select (select .cse32 c_~q2~0.base) .cse5) 1))))))) (not (= (select .cse28 (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)) (not (< ~q1_back~0 c_~n1~0)) (not (<= 0 ~q1_back~0))))) .cse0 .cse8 .cse9) (or .cse33 (and (forall ((v_ArrVal_410 (Array Int Int))) (< (+ .cse1 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~q2~0.base) .cse3) 2) 1) c_~s~0)) (forall ((v_ArrVal_410 (Array Int Int))) (<= c_~s~0 (+ .cse1 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~q2~0.base) .cse3) 2) 2)))) .cse34 .cse9) (or .cse33 (let ((.cse35 (* (select .cse36 .cse3) 2))) (and (< (+ .cse1 .cse35 1) c_~s~0) (<= c_~s~0 (+ .cse1 .cse35 2)))) .cse34 .cse9) (or .cse0 .cse8 .cse9 (and (forall ((~q1_front~0 Int)) (let ((.cse37 (select .cse28 (+ c_~q1~0.offset (* ~q1_front~0 4))))) (or (< ~q1_front~0 0) (<= c_~n1~0 ~q1_front~0) (<= c_~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int))) (<= (+ c_~s~0 .cse37) (+ .cse1 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~q2~0.base) .cse3) 2) 2))) (not (= .cse37 .cse38))))) (forall ((~q1_front~0 Int)) (let ((.cse39 (select .cse28 (+ c_~q1~0.offset (* ~q1_front~0 4))))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_410 (Array Int Int))) (< (+ .cse1 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~q2~0.base) .cse3) 2) 1) (+ c_~s~0 .cse39))) (<= c_~n1~0 ~q1_front~0) (<= c_~q1_back~0 ~q1_front~0) (not (= .cse39 .cse38))))))) (or (let ((.cse40 (+ c_~s~0 |c_thread2Thread1of1ForFork0_~j~0#1|))) (and (forall ((v_ArrVal_410 (Array Int Int))) (<= .cse40 (+ .cse1 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~q2~0.base) .cse3) 2) 2))) (forall ((v_ArrVal_410 (Array Int Int))) (< (+ .cse1 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~q2~0.base) .cse3) 2) 1) .cse40)))) .cse0 .cse8 .cse9 (not (= |c_thread2Thread1of1ForFork0_~j~0#1| .cse38))))))) is different from false [2022-12-06 02:45:28,818 INFO L130 PetriNetUnfolder]: 1654/2940 cut-off events. [2022-12-06 02:45:28,818 INFO L131 PetriNetUnfolder]: For 1628/1628 co-relation queries the response was YES. [2022-12-06 02:45:28,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28530 conditions, 2940 events. 1654/2940 cut-off events. For 1628/1628 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17670 event pairs, 87 based on Foata normal form. 2/2294 useless extension candidates. Maximal degree in co-relation 10446. Up to 2672 conditions per place. [2022-12-06 02:45:28,837 INFO L137 encePairwiseOnDemand]: 5/32 looper letters, 216 selfloop transitions, 107 changer transitions 595/920 dead transitions. [2022-12-06 02:45:28,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 920 transitions, 18890 flow [2022-12-06 02:45:28,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 02:45:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 02:45:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 313 transitions. [2022-12-06 02:45:28,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2794642857142857 [2022-12-06 02:45:28,839 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2022-12-06 02:45:28,840 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:28,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 920 transitions, 18890 flow [2022-12-06 02:45:28,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 920 transitions, 18890 flow [2022-12-06 02:45:28,865 INFO L188 LiptonReduction]: Number of co-enabled transitions 968 [2022-12-06 02:45:45,679 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 02:45:45,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16840 [2022-12-06 02:45:45,680 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 916 transitions, 18810 flow [2022-12-06 02:45:45,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 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 02:45:45,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:45,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:45,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 02:45:45,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:45,881 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 02:45:45,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1877755706, now seen corresponding path program 1 times [2022-12-06 02:45:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:45,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131249853] [2022-12-06 02:45:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:46,954 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 02:45:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:46,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131249853] [2022-12-06 02:45:46,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131249853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:45:46,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:45:46,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 02:45:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249602091] [2022-12-06 02:45:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:45:46,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 02:45:46,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:46,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 02:45:46,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 02:45:46,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:45:46,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 916 transitions, 18810 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:45:46,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:46,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:45:46,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:47,929 INFO L130 PetriNetUnfolder]: 1766/3167 cut-off events. [2022-12-06 02:45:47,929 INFO L131 PetriNetUnfolder]: For 2017/2052 co-relation queries the response was YES. [2022-12-06 02:45:47,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33864 conditions, 3167 events. 1766/3167 cut-off events. For 2017/2052 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 19646 event pairs, 60 based on Foata normal form. 1/2482 useless extension candidates. Maximal degree in co-relation 11487. Up to 2875 conditions per place. [2022-12-06 02:45:48,015 INFO L137 encePairwiseOnDemand]: 17/36 looper letters, 347 selfloop transitions, 19 changer transitions 640/1008 dead transitions. [2022-12-06 02:45:48,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 1008 transitions, 22684 flow [2022-12-06 02:45:48,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:45:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:45:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-12-06 02:45:48,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.345679012345679 [2022-12-06 02:45:48,018 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 97 predicate places. [2022-12-06 02:45:48,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:48,019 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 1008 transitions, 22684 flow [2022-12-06 02:45:48,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 1008 transitions, 22684 flow [2022-12-06 02:45:48,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 1090 [2022-12-06 02:45:48,060 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:48,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 02:45:48,062 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 1008 transitions, 22684 flow [2022-12-06 02:45:48,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:45:48,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:48,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:48,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 02:45:48,063 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1128704696, now seen corresponding path program 2 times [2022-12-06 02:45:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:48,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413639542] [2022-12-06 02:45:48,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:48,146 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 02:45:48,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:48,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413639542] [2022-12-06 02:45:48,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413639542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:45:48,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:45:48,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:45:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274476963] [2022-12-06 02:45:48,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:45:48,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:45:48,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:48,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:45:48,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:45:48,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-06 02:45:48,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 1008 transitions, 22684 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:45:48,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:48,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-06 02:45:48,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:49,049 INFO L130 PetriNetUnfolder]: 1603/2950 cut-off events. [2022-12-06 02:45:49,050 INFO L131 PetriNetUnfolder]: For 2645/2684 co-relation queries the response was YES. [2022-12-06 02:45:49,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34047 conditions, 2950 events. 1603/2950 cut-off events. For 2645/2684 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 18288 event pairs, 53 based on Foata normal form. 16/2355 useless extension candidates. Maximal degree in co-relation 13623. Up to 2652 conditions per place. [2022-12-06 02:45:49,071 INFO L137 encePairwiseOnDemand]: 23/36 looper letters, 340 selfloop transitions, 14 changer transitions 639/1009 dead transitions. [2022-12-06 02:45:49,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 1009 transitions, 24631 flow [2022-12-06 02:45:49,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:45:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:45:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 02:45:49,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-06 02:45:49,073 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 99 predicate places. [2022-12-06 02:45:49,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:49,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 1009 transitions, 24631 flow [2022-12-06 02:45:49,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 1009 transitions, 24631 flow [2022-12-06 02:45:49,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 1038 [2022-12-06 02:45:49,113 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:49,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 02:45:49,113 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 1009 transitions, 24631 flow [2022-12-06 02:45:49,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:45:49,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:49,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:49,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 02:45:49,114 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:49,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:49,114 INFO L85 PathProgramCache]: Analyzing trace with hash -751475060, now seen corresponding path program 3 times [2022-12-06 02:45:49,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:49,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088280384] [2022-12-06 02:45:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:49,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:50,465 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 02:45:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:50,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088280384] [2022-12-06 02:45:50,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088280384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:45:50,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:45:50,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 02:45:50,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676378984] [2022-12-06 02:45:50,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:45:50,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:45:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:50,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:45:50,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:45:50,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:45:50,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 1009 transitions, 24631 flow. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 02:45:50,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:50,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:45:50,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:51,732 INFO L130 PetriNetUnfolder]: 1677/3103 cut-off events. [2022-12-06 02:45:51,732 INFO L131 PetriNetUnfolder]: For 2809/2809 co-relation queries the response was YES. [2022-12-06 02:45:51,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38856 conditions, 3103 events. 1677/3103 cut-off events. For 2809/2809 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 19585 event pairs, 59 based on Foata normal form. 1/2465 useless extension candidates. Maximal degree in co-relation 14963. Up to 2792 conditions per place. [2022-12-06 02:45:51,755 INFO L137 encePairwiseOnDemand]: 17/36 looper letters, 392 selfloop transitions, 19 changer transitions 652/1065 dead transitions. [2022-12-06 02:45:51,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 1065 transitions, 28154 flow [2022-12-06 02:45:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:45:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:45:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-12-06 02:45:51,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2022-12-06 02:45:51,758 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 107 predicate places. [2022-12-06 02:45:51,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:51,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 1065 transitions, 28154 flow [2022-12-06 02:45:51,808 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 1065 transitions, 28154 flow [2022-12-06 02:45:51,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 1090 [2022-12-06 02:45:51,812 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:51,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 02:45:51,812 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 1065 transitions, 28154 flow [2022-12-06 02:45:51,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 02:45:51,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:51,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:51,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 02:45:51,813 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:51,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash -686767666, now seen corresponding path program 4 times [2022-12-06 02:45:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:51,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990935218] [2022-12-06 02:45:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:53,466 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 02:45:53,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:53,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990935218] [2022-12-06 02:45:53,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990935218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:45:53,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:45:53,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 02:45:53,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129567719] [2022-12-06 02:45:53,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:45:53,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:45:53,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:53,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:45:53,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:45:53,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:45:53,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 1065 transitions, 28154 flow. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 02:45:53,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:53,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:45:53,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:54,889 INFO L130 PetriNetUnfolder]: 1727/3227 cut-off events. [2022-12-06 02:45:54,889 INFO L131 PetriNetUnfolder]: For 3188/3188 co-relation queries the response was YES. [2022-12-06 02:45:54,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43586 conditions, 3227 events. 1727/3227 cut-off events. For 3188/3188 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 20836 event pairs, 55 based on Foata normal form. 1/2564 useless extension candidates. Maximal degree in co-relation 16628. Up to 2912 conditions per place. [2022-12-06 02:45:54,910 INFO L137 encePairwiseOnDemand]: 15/36 looper letters, 418 selfloop transitions, 30 changer transitions 682/1132 dead transitions. [2022-12-06 02:45:54,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 1132 transitions, 32201 flow [2022-12-06 02:45:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:45:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:45:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-12-06 02:45:54,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2022-12-06 02:45:54,912 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 116 predicate places. [2022-12-06 02:45:54,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:54,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 1132 transitions, 32201 flow [2022-12-06 02:45:54,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 1132 transitions, 32201 flow [2022-12-06 02:45:54,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-06 02:45:54,965 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:54,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 02:45:54,966 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 1132 transitions, 32201 flow [2022-12-06 02:45:54,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 02:45:54,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:54,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:54,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 02:45:54,966 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1490674398, now seen corresponding path program 1 times [2022-12-06 02:45:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:54,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911570926] [2022-12-06 02:45:54,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:54,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:55,029 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 02:45:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:55,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911570926] [2022-12-06 02:45:55,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911570926] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:55,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125532989] [2022-12-06 02:45:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:55,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:55,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:55,032 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:45:55,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:45:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:55,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 02:45:55,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:55,204 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 02:45:55,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:45:55,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125532989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:45:55,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:45:55,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 02:45:55,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102920036] [2022-12-06 02:45:55,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:45:55,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:45:55,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:55,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:45:55,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:45:55,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-06 02:45:55,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 1132 transitions, 32201 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:45:55,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:55,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-06 02:45:55,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:56,317 INFO L130 PetriNetUnfolder]: 1080/2299 cut-off events. [2022-12-06 02:45:56,317 INFO L131 PetriNetUnfolder]: For 3364/3364 co-relation queries the response was YES. [2022-12-06 02:45:56,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32755 conditions, 2299 events. 1080/2299 cut-off events. For 3364/3364 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15868 event pairs, 49 based on Foata normal form. 161/2069 useless extension candidates. Maximal degree in co-relation 8173. Up to 2032 conditions per place. [2022-12-06 02:45:56,331 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 214 selfloop transitions, 3 changer transitions 642/868 dead transitions. [2022-12-06 02:45:56,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 868 transitions, 26333 flow [2022-12-06 02:45:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:45:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:45:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 02:45:56,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2022-12-06 02:45:56,333 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 113 predicate places. [2022-12-06 02:45:56,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:56,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 868 transitions, 26333 flow [2022-12-06 02:45:56,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 868 transitions, 26333 flow [2022-12-06 02:45:56,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 846 [2022-12-06 02:45:56,372 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:56,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 02:45:56,373 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 868 transitions, 26333 flow [2022-12-06 02:45:56,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:45:56,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:56,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:56,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 02:45:56,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:56,580 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 02:45:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1739740825, now seen corresponding path program 1 times [2022-12-06 02:45:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:56,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451618057] [2022-12-06 02:45:56,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:56,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:56,855 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 02:45:56,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:56,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451618057] [2022-12-06 02:45:56,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451618057] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:56,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632894275] [2022-12-06 02:45:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:56,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:56,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:56,858 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:45:56,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 02:45:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:56,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 02:45:56,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:57,023 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-06 02:45:57,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-06 02:45:57,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:45:57,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-06 02:45:57,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 9 [2022-12-06 02:45:57,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-06 02:45:57,064 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:45:57,065 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2022-12-06 02:45:57,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:57,124 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 02:45:57,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 48 [2022-12-06 02:45:57,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-06 02:45:57,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:45:57,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:45:57,395 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 02:45:57,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:57,901 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 02:45:57,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632894275] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:57,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:57,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 19 [2022-12-06 02:45:57,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934172442] [2022-12-06 02:45:57,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:57,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:45:57,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:57,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:45:57,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=313, Unknown=6, NotChecked=0, Total=380 [2022-12-06 02:45:57,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 02:45:57,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 868 transitions, 26333 flow. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 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 02:45:57,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:57,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 02:45:57,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:01,887 INFO L130 PetriNetUnfolder]: 1864/3510 cut-off events. [2022-12-06 02:46:01,887 INFO L131 PetriNetUnfolder]: For 4922/4922 co-relation queries the response was YES. [2022-12-06 02:46:01,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53833 conditions, 3510 events. 1864/3510 cut-off events. For 4922/4922 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 23453 event pairs, 39 based on Foata normal form. 1/2802 useless extension candidates. Maximal degree in co-relation 17678. Up to 3156 conditions per place. [2022-12-06 02:46:01,910 INFO L137 encePairwiseOnDemand]: 11/36 looper letters, 358 selfloop transitions, 114 changer transitions 732/1206 dead transitions. [2022-12-06 02:46:01,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1206 transitions, 38974 flow [2022-12-06 02:46:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 02:46:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 02:46:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 374 transitions. [2022-12-06 02:46:01,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26638176638176636 [2022-12-06 02:46:01,914 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2022-12-06 02:46:01,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:01,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 1206 transitions, 38974 flow [2022-12-06 02:46:01,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 1206 transitions, 38974 flow [2022-12-06 02:46:01,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 1220 [2022-12-06 02:46:12,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 02:46:12,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:12,251 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 21 out of bounds for length 21 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 02:46:12,254 INFO L158 Benchmark]: Toolchain (without parser) took 303712.89ms. Allocated memory was 179.3MB in the beginning and 1.0GB in the end (delta: 851.4MB). Free memory was 143.6MB in the beginning and 668.6MB in the end (delta: -525.0MB). Peak memory consumption was 637.8MB. Max. memory is 8.0GB. [2022-12-06 02:46:12,254 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:46:12,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.93ms. Allocated memory is still 179.3MB. Free memory was 143.6MB in the beginning and 130.3MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 02:46:12,254 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.47ms. Allocated memory is still 179.3MB. Free memory was 130.3MB in the beginning and 127.9MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 02:46:12,254 INFO L158 Benchmark]: Boogie Preprocessor took 52.00ms. Allocated memory is still 179.3MB. Free memory was 127.9MB in the beginning and 126.1MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 02:46:12,255 INFO L158 Benchmark]: RCFGBuilder took 774.49ms. Allocated memory is still 179.3MB. Free memory was 126.1MB in the beginning and 133.0MB in the end (delta: -6.9MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-12-06 02:46:12,255 INFO L158 Benchmark]: TraceAbstraction took 302574.65ms. Allocated memory was 179.3MB in the beginning and 1.0GB in the end (delta: 851.4MB). Free memory was 131.9MB in the beginning and 668.6MB in the end (delta: -536.6MB). Peak memory consumption was 625.9MB. Max. memory is 8.0GB. [2022-12-06 02:46:12,256 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.93ms. Allocated memory is still 179.3MB. Free memory was 143.6MB in the beginning and 130.3MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.47ms. Allocated memory is still 179.3MB. Free memory was 130.3MB in the beginning and 127.9MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.00ms. Allocated memory is still 179.3MB. Free memory was 127.9MB in the beginning and 126.1MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 774.49ms. Allocated memory is still 179.3MB. Free memory was 126.1MB in the beginning and 133.0MB in the end (delta: -6.9MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * TraceAbstraction took 302574.65ms. Allocated memory was 179.3MB in the beginning and 1.0GB in the end (delta: 851.4MB). Free memory was 131.9MB in the beginning and 668.6MB in the end (delta: -536.6MB). Peak memory consumption was 625.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 173 PlacesBefore, 32 PlacesAfterwards, 181 TransitionsBefore, 28 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 112 TrivialYvCompositions, 29 ConcurrentYvCompositions, 11 ChoiceCompositions, 152 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 913, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 880, independent: 871, independent conditional: 0, independent unconditional: 871, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 880, independent: 864, independent conditional: 0, independent unconditional: 864, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 932, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 880, unknown conditional: 0, unknown unconditional: 880] , Statistics on independence cache: Total cache size (in pairs): 1423, Positive cache size: 1414, Positive conditional cache size: 0, Positive unconditional cache size: 1414, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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, 33 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 64 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): 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: 3.4s, 36 PlacesBefore, 35 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 90 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.0s, 39 PlacesBefore, 39 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 146 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): 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.0s, 41 PlacesBefore, 41 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 162 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): 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: 3.6s, 49 PlacesBefore, 48 PlacesAfterwards, 133 TransitionsBefore, 132 TransitionsAfterwards, 204 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: 3.6s, 82 PlacesBefore, 81 PlacesAfterwards, 435 TransitionsBefore, 434 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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.0s, 86 PlacesBefore, 86 PlacesAfterwards, 452 TransitionsBefore, 452 TransitionsAfterwards, 530 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): 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.0s, 92 PlacesBefore, 92 PlacesAfterwards, 510 TransitionsBefore, 510 TransitionsAfterwards, 600 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): 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: 16.8s, 126 PlacesBefore, 121 PlacesAfterwards, 920 TransitionsBefore, 916 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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.0s, 129 PlacesBefore, 129 PlacesAfterwards, 1008 TransitionsBefore, 1008 TransitionsAfterwards, 1090 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): 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.0s, 131 PlacesBefore, 131 PlacesAfterwards, 1009 TransitionsBefore, 1009 TransitionsAfterwards, 1038 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): 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.0s, 139 PlacesBefore, 139 PlacesAfterwards, 1065 TransitionsBefore, 1065 TransitionsAfterwards, 1090 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): 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.0s, 148 PlacesBefore, 148 PlacesAfterwards, 1132 TransitionsBefore, 1132 TransitionsAfterwards, 1138 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): 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.0s, 145 PlacesBefore, 145 PlacesAfterwards, 868 TransitionsBefore, 868 TransitionsAfterwards, 846 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): 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 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 21 out of bounds for length 21 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 21 out of bounds for length 21: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 02:46:12,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...