/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/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:19:35,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:19:35,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:19:35,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:19:35,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:19:35,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:19:35,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:19:35,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:19:35,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:19:35,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:19:35,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:19:35,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:19:35,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:19:35,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:19:35,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:19:35,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:19:35,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:19:35,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:19:35,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:19:35,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:19:35,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:19:35,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:19:35,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:19:35,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:19:35,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:19:35,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:19:35,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:19:35,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:19:35,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:19:35,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:19:35,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:19:35,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:19:35,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:19:35,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:19:35,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:19:35,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:19:35,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:19:35,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:19:35,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:19:35,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:19:35,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:19:35,484 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:19:35,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:19:35,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:19:35,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:19:35,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:19:35,516 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:19:35,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:19:35,517 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:19:35,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:19:35,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:19:35,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:19:35,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:19:35,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:19:35,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:19:35,519 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:19:35,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:19:35,519 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:19:35,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:19:35,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:19:35,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:19:35,520 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:19:35,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:19:35,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:19:35,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:19:35,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:19:35,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:19:35,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:19:35,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:19:35,521 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:19:35,522 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:19:35,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:19:35,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:19:35,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:19:35,885 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:19:35,885 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:19:35,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-12-06 02:19:37,380 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:19:37,577 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:19:37,577 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-12-06 02:19:37,585 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e5005b5/976959a9e0c146c29c22f799004da644/FLAG0900ababd [2022-12-06 02:19:37,606 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e5005b5/976959a9e0c146c29c22f799004da644 [2022-12-06 02:19:37,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:19:37,610 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:19:37,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:19:37,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:19:37,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:19:37,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:19:37" (1/1) ... [2022-12-06 02:19:37,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390de48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37, skipping insertion in model container [2022-12-06 02:19:37,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:19:37" (1/1) ... [2022-12-06 02:19:37,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:19:37,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:19:37,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,817 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/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-12-06 02:19:37,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:19:37,843 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:19:37,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:19:37,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:19:37,895 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/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-12-06 02:19:37,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:19:37,913 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:19:37,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37 WrapperNode [2022-12-06 02:19:37,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:19:37,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:19:37,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:19:37,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:19:37,921 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:19:37" (1/1) ... [2022-12-06 02:19:37,939 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:19:37" (1/1) ... [2022-12-06 02:19:37,976 INFO L138 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2022-12-06 02:19:37,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:19:37,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:19:37,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:19:37,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:19:37,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37" (1/1) ... [2022-12-06 02:19:37,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37" (1/1) ... [2022-12-06 02:19:38,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37" (1/1) ... [2022-12-06 02:19:38,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37" (1/1) ... [2022-12-06 02:19:38,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37" (1/1) ... [2022-12-06 02:19:38,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37" (1/1) ... [2022-12-06 02:19:38,026 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37" (1/1) ... [2022-12-06 02:19:38,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37" (1/1) ... [2022-12-06 02:19:38,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:19:38,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:19:38,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:19:38,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:19:38,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37" (1/1) ... [2022-12-06 02:19:38,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:19:38,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:19:38,065 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:19:38,086 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:19:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:19:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:19:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:19:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:19:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:19:38,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:19:38,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:19:38,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:19:38,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:19:38,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:19:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 02:19:38,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 02:19:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:19:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:19:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:19:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:19:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:19:38,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:19:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:19:38,125 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:19:38,294 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:19:38,296 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:19:38,717 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:19:38,881 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:19:38,881 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 02:19:38,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:19:38 BoogieIcfgContainer [2022-12-06 02:19:38,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:19:38,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:19:38,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:19:38,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:19:38,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:19:37" (1/3) ... [2022-12-06 02:19:38,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6868b045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:19:38, skipping insertion in model container [2022-12-06 02:19:38,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:19:37" (2/3) ... [2022-12-06 02:19:38,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6868b045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:19:38, skipping insertion in model container [2022-12-06 02:19:38,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:19:38" (3/3) ... [2022-12-06 02:19:38,892 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-12-06 02:19:38,908 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:19:38,909 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:19:38,909 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:19:38,994 INFO L144 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-12-06 02:19:39,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 193 transitions, 430 flow [2022-12-06 02:19:39,148 INFO L130 PetriNetUnfolder]: 14/178 cut-off events. [2022-12-06 02:19:39,148 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:19:39,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 178 events. 14/178 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 155 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 152. Up to 3 conditions per place. [2022-12-06 02:19:39,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 193 transitions, 430 flow [2022-12-06 02:19:39,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 170 transitions, 370 flow [2022-12-06 02:19:39,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:19:39,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 170 transitions, 370 flow [2022-12-06 02:19:39,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 170 transitions, 370 flow [2022-12-06 02:19:39,282 INFO L130 PetriNetUnfolder]: 14/170 cut-off events. [2022-12-06 02:19:39,283 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:19:39,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 170 events. 14/170 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 153 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 152. Up to 3 conditions per place. [2022-12-06 02:19:39,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 170 transitions, 370 flow [2022-12-06 02:19:39,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 2612 [2022-12-06 02:19:46,024 INFO L203 LiptonReduction]: Total number of compositions: 133 [2022-12-06 02:19:46,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:19:46,043 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;@b2ff7e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:19:46,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 02:19:46,051 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-06 02:19:46,051 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:19:46,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:19:46,052 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, 1, 1, 1, 1, 1, 1] [2022-12-06 02:19:46,052 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:19:46,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:19:46,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1477800028, now seen corresponding path program 1 times [2022-12-06 02:19:46,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:19:46,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112361205] [2022-12-06 02:19:46,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:19:46,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:19:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:19:46,576 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:19:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:19:46,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112361205] [2022-12-06 02:19:46,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112361205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:19:46,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:19:46,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:19:46,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118609842] [2022-12-06 02:19:46,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:19:46,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:19:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:19:46,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:19:46,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:19:46,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2022-12-06 02:19:46,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:19:46,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:19:46,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2022-12-06 02:19:46,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:19:47,082 INFO L130 PetriNetUnfolder]: 1802/2575 cut-off events. [2022-12-06 02:19:47,082 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2022-12-06 02:19:47,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5515 conditions, 2575 events. 1802/2575 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10965 event pairs, 486 based on Foata normal form. 1/1944 useless extension candidates. Maximal degree in co-relation 5414. Up to 1174 conditions per place. [2022-12-06 02:19:47,105 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 70 selfloop transitions, 7 changer transitions 1/84 dead transitions. [2022-12-06 02:19:47,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 402 flow [2022-12-06 02:19:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:19:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:19:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-12-06 02:19:47,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6959459459459459 [2022-12-06 02:19:47,120 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2022-12-06 02:19:47,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:19:47,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 84 transitions, 402 flow [2022-12-06 02:19:47,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 84 transitions, 402 flow [2022-12-06 02:19:47,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 02:19:47,277 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 02:19:47,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 02:19:47,280 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 81 transitions, 396 flow [2022-12-06 02:19:47,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:19:47,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:19:47,281 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, 1, 1, 1] [2022-12-06 02:19:47,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:19:47,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:19:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:19:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash -478437011, now seen corresponding path program 1 times [2022-12-06 02:19:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:19:47,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091788271] [2022-12-06 02:19:47,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:19:47,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:19:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:19:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:19:47,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:19:47,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091788271] [2022-12-06 02:19:47,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091788271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:19:47,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:19:47,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:19:47,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977976576] [2022-12-06 02:19:47,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:19:47,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:19:47,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:19:47,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:19:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:19:47,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 02:19:47,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 81 transitions, 396 flow. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:47,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:19:47,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 02:19:47,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:19:48,081 INFO L130 PetriNetUnfolder]: 2942/4073 cut-off events. [2022-12-06 02:19:48,082 INFO L131 PetriNetUnfolder]: For 468/468 co-relation queries the response was YES. [2022-12-06 02:19:48,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12665 conditions, 4073 events. 2942/4073 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16474 event pairs, 907 based on Foata normal form. 1/3067 useless extension candidates. Maximal degree in co-relation 12459. Up to 2470 conditions per place. [2022-12-06 02:19:48,107 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 120 selfloop transitions, 8 changer transitions 2/130 dead transitions. [2022-12-06 02:19:48,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 130 transitions, 889 flow [2022-12-06 02:19:48,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:19:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:19:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-06 02:19:48,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2022-12-06 02:19:48,112 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2022-12-06 02:19:48,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:19:48,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 130 transitions, 889 flow [2022-12-06 02:19:48,136 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 130 transitions, 889 flow [2022-12-06 02:19:48,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:19:48,139 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:19:48,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 02:19:48,141 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 130 transitions, 889 flow [2022-12-06 02:19:48,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:48,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:19:48,141 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, 1, 1] [2022-12-06 02:19:48,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:19:48,141 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:19:48,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:19:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1834115287, now seen corresponding path program 1 times [2022-12-06 02:19:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:19:48,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829285096] [2022-12-06 02:19:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:19:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:19:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:19:48,301 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:19:48,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:19:48,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829285096] [2022-12-06 02:19:48,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829285096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:19:48,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:19:48,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:19:48,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359722262] [2022-12-06 02:19:48,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:19:48,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:19:48,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:19:48,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:19:48,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:19:48,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 02:19:48,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 130 transitions, 889 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:48,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:19:48,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 02:19:48,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:19:49,106 INFO L130 PetriNetUnfolder]: 4843/6801 cut-off events. [2022-12-06 02:19:49,106 INFO L131 PetriNetUnfolder]: For 766/766 co-relation queries the response was YES. [2022-12-06 02:19:49,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27992 conditions, 6801 events. 4843/6801 cut-off events. For 766/766 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 31418 event pairs, 1890 based on Foata normal form. 0/5331 useless extension candidates. Maximal degree in co-relation 16472. Up to 4074 conditions per place. [2022-12-06 02:19:49,162 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 224 selfloop transitions, 5 changer transitions 19/248 dead transitions. [2022-12-06 02:19:49,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 248 transitions, 2196 flow [2022-12-06 02:19:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:19:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:19:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-06 02:19:49,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2022-12-06 02:19:49,168 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2022-12-06 02:19:49,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:19:49,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 248 transitions, 2196 flow [2022-12-06 02:19:49,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 248 transitions, 2196 flow [2022-12-06 02:19:49,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:19:51,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:19:51,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2484 [2022-12-06 02:19:51,652 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 247 transitions, 2188 flow [2022-12-06 02:19:51,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:51,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:19:51,653 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, 1, 1] [2022-12-06 02:19:51,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:19:51,653 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:19:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:19:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash 646593547, now seen corresponding path program 1 times [2022-12-06 02:19:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:19:51,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351909933] [2022-12-06 02:19:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:19:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:19:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:19:51,785 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:19:51,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:19:51,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351909933] [2022-12-06 02:19:51,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351909933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:19:51,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:19:51,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:19:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465625194] [2022-12-06 02:19:51,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:19:51,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:19:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:19:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:19:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:19:51,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 02:19:51,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 247 transitions, 2188 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:51,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:19:51,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 02:19:51,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:19:52,401 INFO L130 PetriNetUnfolder]: 3423/4862 cut-off events. [2022-12-06 02:19:52,402 INFO L131 PetriNetUnfolder]: For 562/562 co-relation queries the response was YES. [2022-12-06 02:19:52,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24907 conditions, 4862 events. 3423/4862 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 21309 event pairs, 1430 based on Foata normal form. 0/3815 useless extension candidates. Maximal degree in co-relation 20485. Up to 4074 conditions per place. [2022-12-06 02:19:52,435 INFO L137 encePairwiseOnDemand]: 34/38 looper letters, 128 selfloop transitions, 0 changer transitions 72/200 dead transitions. [2022-12-06 02:19:52,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 200 transitions, 2171 flow [2022-12-06 02:19:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:19:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:19:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 02:19:52,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 02:19:52,438 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2022-12-06 02:19:52,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:19:52,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 200 transitions, 2171 flow [2022-12-06 02:19:52,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 200 transitions, 2171 flow [2022-12-06 02:19:52,468 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:19:52,470 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:19:52,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 02:19:52,475 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 200 transitions, 2171 flow [2022-12-06 02:19:52,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:52,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:19:52,475 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, 1, 1] [2022-12-06 02:19:52,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:19:52,476 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:19:52,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:19:52,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1271920847, now seen corresponding path program 1 times [2022-12-06 02:19:52,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:19:52,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362747703] [2022-12-06 02:19:52,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:19:52,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:19:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:19:52,601 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:19:52,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:19:52,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362747703] [2022-12-06 02:19:52,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362747703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:19:52,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:19:52,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:19:52,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723456308] [2022-12-06 02:19:52,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:19:52,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:19:52,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:19:52,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:19:52,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:19:52,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 02:19:52,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 200 transitions, 2171 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:52,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:19:52,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 02:19:52,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:19:53,580 INFO L130 PetriNetUnfolder]: 5324/7590 cut-off events. [2022-12-06 02:19:53,581 INFO L131 PetriNetUnfolder]: For 912/912 co-relation queries the response was YES. [2022-12-06 02:19:53,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46479 conditions, 7590 events. 5324/7590 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 36469 event pairs, 2093 based on Foata normal form. 0/6080 useless extension candidates. Maximal degree in co-relation 24498. Up to 6802 conditions per place. [2022-12-06 02:19:53,631 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 224 selfloop transitions, 5 changer transitions 89/318 dead transitions. [2022-12-06 02:19:53,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 318 transitions, 4090 flow [2022-12-06 02:19:53,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:19:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:19:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-12-06 02:19:53,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5338345864661654 [2022-12-06 02:19:53,634 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2022-12-06 02:19:53,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:19:53,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 318 transitions, 4090 flow [2022-12-06 02:19:53,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 318 transitions, 4090 flow [2022-12-06 02:19:53,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:19:56,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:19:56,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2772 [2022-12-06 02:19:56,406 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 317 transitions, 4078 flow [2022-12-06 02:19:56,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:56,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:19:56,407 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, 1, 1] [2022-12-06 02:19:56,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:19:56,407 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:19:56,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:19:56,407 INFO L85 PathProgramCache]: Analyzing trace with hash 787142157, now seen corresponding path program 1 times [2022-12-06 02:19:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:19:56,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153639379] [2022-12-06 02:19:56,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:19:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:19:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:19:56,593 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:19:56,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:19:56,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153639379] [2022-12-06 02:19:56,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153639379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:19:56,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:19:56,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:19:56,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370312989] [2022-12-06 02:19:56,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:19:56,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:19:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:19:56,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:19:56,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:19:56,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:19:56,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 317 transitions, 4078 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:56,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:19:56,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:19:56,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:19:57,205 INFO L130 PetriNetUnfolder]: 3904/5651 cut-off events. [2022-12-06 02:19:57,205 INFO L131 PetriNetUnfolder]: For 719/719 co-relation queries the response was YES. [2022-12-06 02:19:57,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40305 conditions, 5651 events. 3904/5651 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 26402 event pairs, 1633 based on Foata normal form. 0/4564 useless extension candidates. Maximal degree in co-relation 28511. Up to 4863 conditions per place. [2022-12-06 02:19:57,237 INFO L137 encePairwiseOnDemand]: 34/39 looper letters, 128 selfloop transitions, 0 changer transitions 142/270 dead transitions. [2022-12-06 02:19:57,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 270 transitions, 4013 flow [2022-12-06 02:19:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:19:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:19:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 02:19:57,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2022-12-06 02:19:57,239 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2022-12-06 02:19:57,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:19:57,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 270 transitions, 4013 flow [2022-12-06 02:19:57,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 270 transitions, 4013 flow [2022-12-06 02:19:57,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:19:57,272 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:19:57,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 02:19:57,273 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 270 transitions, 4013 flow [2022-12-06 02:19:57,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:57,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:19:57,273 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, 1, 1] [2022-12-06 02:19:57,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 02:19:57,273 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:19:57,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:19:57,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1797280871, now seen corresponding path program 1 times [2022-12-06 02:19:57,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:19:57,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317091603] [2022-12-06 02:19:57,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:19:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:19:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:19:57,498 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:19:57,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:19:57,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317091603] [2022-12-06 02:19:57,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317091603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:19:57,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:19:57,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:19:57,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845466097] [2022-12-06 02:19:57,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:19:57,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:19:57,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:19:57,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:19:57,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:19:57,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:19:57,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 270 transitions, 4013 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:57,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:19:57,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:19:57,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:19:58,032 INFO L130 PetriNetUnfolder]: 3207/4681 cut-off events. [2022-12-06 02:19:58,032 INFO L131 PetriNetUnfolder]: For 594/594 co-relation queries the response was YES. [2022-12-06 02:19:58,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38053 conditions, 4681 events. 3207/4681 cut-off events. For 594/594 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 21567 event pairs, 985 based on Foata normal form. 0/3962 useless extension candidates. Maximal degree in co-relation 24886. Up to 3893 conditions per place. [2022-12-06 02:19:58,058 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 133 selfloop transitions, 9 changer transitions 140/282 dead transitions. [2022-12-06 02:19:58,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 282 transitions, 4713 flow [2022-12-06 02:19:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:19:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:19:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-06 02:19:58,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2022-12-06 02:19:58,060 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2022-12-06 02:19:58,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:19:58,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 282 transitions, 4713 flow [2022-12-06 02:19:58,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 282 transitions, 4713 flow [2022-12-06 02:19:58,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:19:58,091 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:19:58,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 02:19:58,092 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 282 transitions, 4713 flow [2022-12-06 02:19:58,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:58,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:19:58,092 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, 1, 1, 1] [2022-12-06 02:19:58,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 02:19:58,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:19:58,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:19:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash -384834232, now seen corresponding path program 1 times [2022-12-06 02:19:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:19:58,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454084535] [2022-12-06 02:19:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:19:58,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:19:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:19:58,410 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:19:58,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:19:58,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454084535] [2022-12-06 02:19:58,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454084535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:19:58,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:19:58,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:19:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97011903] [2022-12-06 02:19:58,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:19:58,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:19:58,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:19:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:19:58,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:19:58,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:19:58,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 282 transitions, 4713 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:58,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:19:58,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:19:58,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:19:58,986 INFO L130 PetriNetUnfolder]: 2765/4075 cut-off events. [2022-12-06 02:19:58,986 INFO L131 PetriNetUnfolder]: For 498/498 co-relation queries the response was YES. [2022-12-06 02:19:58,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37237 conditions, 4075 events. 2765/4075 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18545 event pairs, 619 based on Foata normal form. 0/3580 useless extension candidates. Maximal degree in co-relation 22519. Up to 3287 conditions per place. [2022-12-06 02:19:59,006 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 126 selfloop transitions, 9 changer transitions 140/275 dead transitions. [2022-12-06 02:19:59,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 275 transitions, 5148 flow [2022-12-06 02:19:59,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:19:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:19:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-06 02:19:59,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 02:19:59,008 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2022-12-06 02:19:59,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:19:59,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 275 transitions, 5148 flow [2022-12-06 02:19:59,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 275 transitions, 5148 flow [2022-12-06 02:19:59,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:19:59,031 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:19:59,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 02:19:59,032 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 275 transitions, 5148 flow [2022-12-06 02:19:59,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:59,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:19:59,032 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, 1, 1, 1, 1] [2022-12-06 02:19:59,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 02:19:59,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:19:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:19:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1874131151, now seen corresponding path program 1 times [2022-12-06 02:19:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:19:59,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392639395] [2022-12-06 02:19:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:19:59,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:19:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:19:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:19:59,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:19:59,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392639395] [2022-12-06 02:19:59,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392639395] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:19:59,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664256467] [2022-12-06 02:19:59,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:19:59,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:19:59,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:19:59,686 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:19:59,687 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:19:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:19:59,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 02:19:59,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:19:59,957 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:19:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:19:59,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:00,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:20:00,117 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 26 treesize of output 21 [2022-12-06 02:20:00,129 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:20:00,130 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 25 treesize of output 12 [2022-12-06 02:20:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:00,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664256467] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:00,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:00,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 15 [2022-12-06 02:20:00,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534671507] [2022-12-06 02:20:00,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:00,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:20:00,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:00,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:20:00,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:20:00,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:20:00,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 275 transitions, 5148 flow. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 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:20:00,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:00,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:20:00,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:01,086 INFO L130 PetriNetUnfolder]: 3418/4967 cut-off events. [2022-12-06 02:20:01,087 INFO L131 PetriNetUnfolder]: For 576/576 co-relation queries the response was YES. [2022-12-06 02:20:01,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50298 conditions, 4967 events. 3418/4967 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 22853 event pairs, 663 based on Foata normal form. 1/4267 useless extension candidates. Maximal degree in co-relation 33886. Up to 4179 conditions per place. [2022-12-06 02:20:01,231 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 168 selfloop transitions, 25 changer transitions 141/334 dead transitions. [2022-12-06 02:20:01,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 334 transitions, 6907 flow [2022-12-06 02:20:01,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:20:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:20:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-06 02:20:01,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4198717948717949 [2022-12-06 02:20:01,234 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2022-12-06 02:20:01,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:20:01,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 334 transitions, 6907 flow [2022-12-06 02:20:01,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 334 transitions, 6907 flow [2022-12-06 02:20:01,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:20:01,282 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:20:01,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 02:20:01,283 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 334 transitions, 6907 flow [2022-12-06 02:20:01,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 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:20:01,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:20:01,283 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, 1, 1, 1, 1] [2022-12-06 02:20:01,297 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:20:01,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:01,490 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:20:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:20:01,491 INFO L85 PathProgramCache]: Analyzing trace with hash 368965097, now seen corresponding path program 1 times [2022-12-06 02:20:01,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:20:01,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222179012] [2022-12-06 02:20:01,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:01,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:20:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:02,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:20:02,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222179012] [2022-12-06 02:20:02,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222179012] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:20:02,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147846514] [2022-12-06 02:20:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:02,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:02,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:20:02,061 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:20:02,064 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:20:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:02,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 02:20:02,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:20:02,259 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:20:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:02,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:02,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:20:02,387 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 26 treesize of output 21 [2022-12-06 02:20:02,398 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:20:02,399 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 25 treesize of output 12 [2022-12-06 02:20:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:02,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147846514] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:02,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:02,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 15 [2022-12-06 02:20:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306574999] [2022-12-06 02:20:02,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:02,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:20:02,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:02,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:20:02,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:20:02,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:20:02,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 334 transitions, 6907 flow. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 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:20:02,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:02,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:20:02,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:03,522 INFO L130 PetriNetUnfolder]: 3822/5512 cut-off events. [2022-12-06 02:20:03,522 INFO L131 PetriNetUnfolder]: For 663/663 co-relation queries the response was YES. [2022-12-06 02:20:03,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61304 conditions, 5512 events. 3822/5512 cut-off events. For 663/663 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 25428 event pairs, 999 based on Foata normal form. 1/4658 useless extension candidates. Maximal degree in co-relation 43180. Up to 4724 conditions per place. [2022-12-06 02:20:03,558 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 197 selfloop transitions, 25 changer transitions 142/364 dead transitions. [2022-12-06 02:20:03,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 364 transitions, 8259 flow [2022-12-06 02:20:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:20:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:20:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2022-12-06 02:20:03,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 02:20:03,561 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2022-12-06 02:20:03,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:20:03,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 364 transitions, 8259 flow [2022-12-06 02:20:03,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 364 transitions, 8259 flow [2022-12-06 02:20:03,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:20:03,592 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:20:03,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 02:20:03,593 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 364 transitions, 8259 flow [2022-12-06 02:20:03,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 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:20:03,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:20:03,594 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, 1, 1, 1, 1] [2022-12-06 02:20:03,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 02:20:03,798 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,SelfDestructingSolverStorable9 [2022-12-06 02:20:03,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:20:03,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:20:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash 683673304, now seen corresponding path program 1 times [2022-12-06 02:20:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:20:03,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453072060] [2022-12-06 02:20:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:03,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:20:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:04,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:20:04,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453072060] [2022-12-06 02:20:04,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453072060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:20:04,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667629658] [2022-12-06 02:20:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:04,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:04,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:20:04,380 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:20:04,382 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:20:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:04,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 02:20:04,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:20:04,562 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:20:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:04,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:04,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:20:04,815 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 20 treesize of output 16 [2022-12-06 02:20:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:04,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667629658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:04,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:04,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-12-06 02:20:04,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842993170] [2022-12-06 02:20:04,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:04,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:20:04,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:04,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:20:04,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:20:04,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:20:04,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 364 transitions, 8259 flow. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:20:04,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:04,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:20:04,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:06,964 INFO L130 PetriNetUnfolder]: 6598/9307 cut-off events. [2022-12-06 02:20:06,964 INFO L131 PetriNetUnfolder]: For 994/994 co-relation queries the response was YES. [2022-12-06 02:20:06,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112750 conditions, 9307 events. 6598/9307 cut-off events. For 994/994 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 45241 event pairs, 843 based on Foata normal form. 2/7607 useless extension candidates. Maximal degree in co-relation 92404. Up to 8519 conditions per place. [2022-12-06 02:20:07,018 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 397 selfloop transitions, 107 changer transitions 145/649 dead transitions. [2022-12-06 02:20:07,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 649 transitions, 15992 flow [2022-12-06 02:20:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:20:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:20:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 259 transitions. [2022-12-06 02:20:07,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4150641025641026 [2022-12-06 02:20:07,030 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2022-12-06 02:20:07,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:20:07,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 649 transitions, 15992 flow [2022-12-06 02:20:07,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 649 transitions, 15992 flow [2022-12-06 02:20:07,104 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:20:07,108 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:20:07,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 02:20:07,109 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 649 transitions, 15992 flow [2022-12-06 02:20:07,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:20:07,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:20:07,109 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, 1, 1, 1, 1] [2022-12-06 02:20:07,114 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:20:07,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:07,311 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:20:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:20:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1603483774, now seen corresponding path program 2 times [2022-12-06 02:20:07,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:20:07,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373356792] [2022-12-06 02:20:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:07,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:20:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:08,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:20:08,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373356792] [2022-12-06 02:20:08,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373356792] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:20:08,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074252490] [2022-12-06 02:20:08,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:20:08,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:08,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:20:08,008 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:20:08,011 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:20:08,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:20:08,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:20:08,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-06 02:20:08,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:20:08,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-06 02:20:08,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:20:08,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:20:08,171 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 02:20:08,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-06 02:20:08,203 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:20:08,229 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 02:20:08,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-06 02:20:08,252 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:20:08,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:20:08,355 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:20:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:08,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:08,677 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_428) |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_429) c_~X_0~0.base))) (< (+ (select .cse0 .cse1) c_~s_2~0) (+ (select .cse0 .cse2) 1)))) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_428) |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_429) c_~X_0~0.base))) (<= (select .cse3 .cse2) (+ (select .cse3 .cse1) c_~s_2~0)))))) is different from false [2022-12-06 02:20:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:08,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074252490] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:08,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:08,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2022-12-06 02:20:08,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722904698] [2022-12-06 02:20:08,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:08,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:20:08,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:08,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:20:08,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=418, Unknown=6, NotChecked=42, Total=552 [2022-12-06 02:20:08,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:20:08,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 649 transitions, 15992 flow. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:20:08,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:08,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:20:08,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:11,324 INFO L130 PetriNetUnfolder]: 7518/10557 cut-off events. [2022-12-06 02:20:11,324 INFO L131 PetriNetUnfolder]: For 1120/1120 co-relation queries the response was YES. [2022-12-06 02:20:11,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138426 conditions, 10557 events. 7518/10557 cut-off events. For 1120/1120 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 52038 event pairs, 922 based on Foata normal form. 2/8517 useless extension candidates. Maximal degree in co-relation 116172. Up to 9769 conditions per place. [2022-12-06 02:20:11,409 INFO L137 encePairwiseOnDemand]: 24/39 looper letters, 563 selfloop transitions, 54 changer transitions 172/789 dead transitions. [2022-12-06 02:20:11,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 789 transitions, 20985 flow [2022-12-06 02:20:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:20:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:20:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-12-06 02:20:11,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2765567765567766 [2022-12-06 02:20:11,411 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 65 predicate places. [2022-12-06 02:20:11,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:20:11,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 789 transitions, 20985 flow [2022-12-06 02:20:11,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 789 transitions, 20985 flow [2022-12-06 02:20:11,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:20:11,497 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:20:11,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 02:20:11,498 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 789 transitions, 20985 flow [2022-12-06 02:20:11,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:20:11,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:20:11,499 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, 1, 1, 1, 1] [2022-12-06 02:20:11,507 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:20:11,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:11,708 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:20:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:20:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash -602235096, now seen corresponding path program 3 times [2022-12-06 02:20:11,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:20:11,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033001791] [2022-12-06 02:20:11,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:11,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:20:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:12,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:20:12,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033001791] [2022-12-06 02:20:12,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033001791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:20:12,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637865270] [2022-12-06 02:20:12,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:20:12,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:12,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:20:12,389 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:20:12,392 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:20:12,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:20:12,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:20:12,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-06 02:20:12,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:20:12,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-06 02:20:12,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 02:20:12,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:20:12,620 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:20:12,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:20:12,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:20:12,738 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 16 treesize of output 18 [2022-12-06 02:20:12,783 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:20:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:12,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:12,908 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_492) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_2~0)) is different from false [2022-12-06 02:20:13,041 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491))) (= (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (select (select (store .cse0 |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_492) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-12-06 02:20:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 02:20:13,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637865270] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:13,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:13,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2022-12-06 02:20:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760689092] [2022-12-06 02:20:13,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:13,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 02:20:13,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:13,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 02:20:13,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=514, Unknown=16, NotChecked=94, Total=702 [2022-12-06 02:20:13,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:20:13,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 789 transitions, 20985 flow. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 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:20:13,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:13,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:20:13,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:17,124 INFO L130 PetriNetUnfolder]: 9244/12951 cut-off events. [2022-12-06 02:20:17,124 INFO L131 PetriNetUnfolder]: For 1368/1368 co-relation queries the response was YES. [2022-12-06 02:20:17,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182737 conditions, 12951 events. 9244/12951 cut-off events. For 1368/1368 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 66342 event pairs, 837 based on Foata normal form. 1/10407 useless extension candidates. Maximal degree in co-relation 157712. Up to 12140 conditions per place. [2022-12-06 02:20:17,221 INFO L137 encePairwiseOnDemand]: 21/39 looper letters, 706 selfloop transitions, 179 changer transitions 202/1087 dead transitions. [2022-12-06 02:20:17,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 1087 transitions, 31036 flow [2022-12-06 02:20:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 02:20:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 02:20:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 264 transitions. [2022-12-06 02:20:17,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2022-12-06 02:20:17,223 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 84 predicate places. [2022-12-06 02:20:17,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:20:17,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 1087 transitions, 31036 flow [2022-12-06 02:20:17,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 1087 transitions, 31036 flow [2022-12-06 02:20:17,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:20:17,418 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:20:17,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 02:20:17,419 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 1087 transitions, 31036 flow [2022-12-06 02:20:17,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 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:20:17,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:20:17,420 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, 1, 1, 1, 1] [2022-12-06 02:20:17,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 02:20:17,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 02:20:17,625 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:20:17,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:20:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1361930935, now seen corresponding path program 2 times [2022-12-06 02:20:17,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:20:17,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725926903] [2022-12-06 02:20:17,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:20:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:18,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:20:18,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725926903] [2022-12-06 02:20:18,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725926903] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:20:18,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554982129] [2022-12-06 02:20:18,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:20:18,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:18,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:20:18,100 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:20:18,102 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:20:18,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:20:18,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:20:18,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 02:20:18,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:20:18,339 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:20:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:18,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:18,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:20:18,459 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 25 treesize of output 20 [2022-12-06 02:20:18,469 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:20:18,470 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 26 treesize of output 13 [2022-12-06 02:20:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:18,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554982129] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:18,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:18,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2022-12-06 02:20:18,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57639579] [2022-12-06 02:20:18,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:18,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:20:18,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:18,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:20:18,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:20:18,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:20:18,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 1087 transitions, 31036 flow. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 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:20:18,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:18,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:20:18,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:21,842 INFO L130 PetriNetUnfolder]: 10274/14347 cut-off events. [2022-12-06 02:20:21,842 INFO L131 PetriNetUnfolder]: For 1513/1513 co-relation queries the response was YES. [2022-12-06 02:20:21,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216751 conditions, 14347 events. 10274/14347 cut-off events. For 1513/1513 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 73618 event pairs, 718 based on Foata normal form. 2/11406 useless extension candidates. Maximal degree in co-relation 189473. Up to 13536 conditions per place. [2022-12-06 02:20:21,984 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 938 selfloop transitions, 52 changer transitions 206/1196 dead transitions. [2022-12-06 02:20:21,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 1196 transitions, 36561 flow [2022-12-06 02:20:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:20:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:20:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 198 transitions. [2022-12-06 02:20:21,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3905325443786982 [2022-12-06 02:20:21,987 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 96 predicate places. [2022-12-06 02:20:21,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:20:21,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 1196 transitions, 36561 flow [2022-12-06 02:20:22,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 1196 transitions, 36561 flow [2022-12-06 02:20:22,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:20:22,192 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:20:22,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 02:20:22,193 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 1196 transitions, 36561 flow [2022-12-06 02:20:22,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 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:20:22,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:20:22,193 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, 1, 1, 1, 1] [2022-12-06 02:20:22,200 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:20:22,398 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:20:22,399 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:20:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:20:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash 136089176, now seen corresponding path program 4 times [2022-12-06 02:20:22,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:20:22,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474151945] [2022-12-06 02:20:22,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:22,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:20:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:22,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:20:22,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474151945] [2022-12-06 02:20:22,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474151945] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:20:22,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858570651] [2022-12-06 02:20:22,974 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:20:22,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:22,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:20:22,981 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:20:22,982 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:20:23,139 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:20:23,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:20:23,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 02:20:23,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:20:23,211 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:20:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:23,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:23,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:20:23,370 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 22 treesize of output 18 [2022-12-06 02:20:23,380 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:20:23,382 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 20 treesize of output 10 [2022-12-06 02:20:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:23,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858570651] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:23,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:23,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-12-06 02:20:23,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025027625] [2022-12-06 02:20:23,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:23,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:20:23,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:23,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:20:23,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:20:23,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:20:23,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 1196 transitions, 36561 flow. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 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:20:23,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:23,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:20:23,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:27,159 INFO L130 PetriNetUnfolder]: 11194/15597 cut-off events. [2022-12-06 02:20:27,159 INFO L131 PetriNetUnfolder]: For 1559/1559 co-relation queries the response was YES. [2022-12-06 02:20:27,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251217 conditions, 15597 events. 11194/15597 cut-off events. For 1559/1559 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 80648 event pairs, 966 based on Foata normal form. 2/12316 useless extension candidates. Maximal degree in co-relation 221850. Up to 14786 conditions per place. [2022-12-06 02:20:27,284 INFO L137 encePairwiseOnDemand]: 24/39 looper letters, 997 selfloop transitions, 93 changer transitions 210/1300 dead transitions. [2022-12-06 02:20:27,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 1300 transitions, 42341 flow [2022-12-06 02:20:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:20:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:20:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 185 transitions. [2022-12-06 02:20:27,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3162393162393162 [2022-12-06 02:20:27,286 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 110 predicate places. [2022-12-06 02:20:27,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:20:27,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 1300 transitions, 42341 flow [2022-12-06 02:20:27,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 1300 transitions, 42341 flow [2022-12-06 02:20:27,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:20:27,438 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:20:27,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-06 02:20:27,438 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 1300 transitions, 42341 flow [2022-12-06 02:20:27,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 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:20:27,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:20:27,439 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, 1, 1, 1, 1] [2022-12-06 02:20:27,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 02:20:27,645 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:20:27,645 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:20:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:20:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1332134887, now seen corresponding path program 3 times [2022-12-06 02:20:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:20:27,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362438929] [2022-12-06 02:20:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:20:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:28,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:20:28,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362438929] [2022-12-06 02:20:28,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362438929] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:20:28,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301684872] [2022-12-06 02:20:28,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:20:28,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:28,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:20:28,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:20:28,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 02:20:28,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:20:28,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:20:28,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 02:20:28,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:20:28,492 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 15 treesize of output 7 [2022-12-06 02:20:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:28,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:28,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:20:28,628 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 26 treesize of output 21 [2022-12-06 02:20:28,639 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:20:28,639 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 25 treesize of output 12 [2022-12-06 02:20:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:28,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301684872] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:28,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:28,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-06 02:20:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459290190] [2022-12-06 02:20:28,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:28,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:20:28,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:28,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:20:28,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:20:28,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:20:28,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 1300 transitions, 42341 flow. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:20:28,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:28,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:20:28,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:32,621 INFO L130 PetriNetUnfolder]: 11598/16142 cut-off events. [2022-12-06 02:20:32,621 INFO L131 PetriNetUnfolder]: For 1617/1617 co-relation queries the response was YES. [2022-12-06 02:20:32,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276123 conditions, 16142 events. 11598/16142 cut-off events. For 1617/1617 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 83907 event pairs, 911 based on Foata normal form. 1/12706 useless extension candidates. Maximal degree in co-relation 244787. Up to 15331 conditions per place. [2022-12-06 02:20:32,746 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 1084 selfloop transitions, 37 changer transitions 212/1333 dead transitions. [2022-12-06 02:20:32,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 1333 transitions, 46087 flow [2022-12-06 02:20:32,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:20:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:20:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2022-12-06 02:20:32,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3789173789173789 [2022-12-06 02:20:32,748 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 118 predicate places. [2022-12-06 02:20:32,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:20:32,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 1333 transitions, 46087 flow [2022-12-06 02:20:32,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 1333 transitions, 46087 flow [2022-12-06 02:20:32,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:20:32,874 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:20:32,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 02:20:32,875 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 1333 transitions, 46087 flow [2022-12-06 02:20:32,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:20:32,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:20:32,875 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, 1, 1, 1, 1] [2022-12-06 02:20:32,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 02:20:33,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 02:20:33,077 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:20:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:20:33,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1584094995, now seen corresponding path program 1 times [2022-12-06 02:20:33,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:20:33,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3752559] [2022-12-06 02:20:33,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:33,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:20:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:33,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:20:33,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3752559] [2022-12-06 02:20:33,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3752559] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:20:33,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789252981] [2022-12-06 02:20:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:33,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:20:33,527 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:20:33,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 02:20:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:33,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 02:20:33,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:20:33,740 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:20:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:33,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:33,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:20:33,987 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 25 treesize of output 20 [2022-12-06 02:20:33,997 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:20:34,000 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 26 treesize of output 13 [2022-12-06 02:20:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:34,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789252981] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:34,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:34,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2022-12-06 02:20:34,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691134009] [2022-12-06 02:20:34,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:34,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:20:34,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:34,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:20:34,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:20:34,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:20:34,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 1333 transitions, 46087 flow. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 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:20:34,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:34,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:20:34,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:39,089 INFO L130 PetriNetUnfolder]: 13513/18750 cut-off events. [2022-12-06 02:20:39,090 INFO L131 PetriNetUnfolder]: For 1869/1869 co-relation queries the response was YES. [2022-12-06 02:20:39,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339445 conditions, 18750 events. 13513/18750 cut-off events. For 1869/1869 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 99024 event pairs, 688 based on Foata normal form. 3/14622 useless extension candidates. Maximal degree in co-relation 305536. Up to 17939 conditions per place. [2022-12-06 02:20:39,237 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 1220 selfloop transitions, 75 changer transitions 218/1513 dead transitions. [2022-12-06 02:20:39,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 1513 transitions, 55354 flow [2022-12-06 02:20:39,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:20:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:20:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 210 transitions. [2022-12-06 02:20:39,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41420118343195267 [2022-12-06 02:20:39,239 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 130 predicate places. [2022-12-06 02:20:39,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:20:39,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 1513 transitions, 55354 flow [2022-12-06 02:20:39,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 1513 transitions, 55354 flow [2022-12-06 02:20:39,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:20:39,388 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:20:39,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-06 02:20:39,389 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 1513 transitions, 55354 flow [2022-12-06 02:20:39,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 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:20:39,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:20:39,389 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, 1, 1, 1, 1] [2022-12-06 02:20:39,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 02:20:39,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 02:20:39,599 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:20:39,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:20:39,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1881500528, now seen corresponding path program 1 times [2022-12-06 02:20:39,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:20:39,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331557906] [2022-12-06 02:20:39,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:39,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:20:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:40,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:20:40,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331557906] [2022-12-06 02:20:40,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331557906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:20:40,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309108007] [2022-12-06 02:20:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:40,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:40,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:20:40,093 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:20:40,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 02:20:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:40,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 02:20:40,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:20:40,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:20:40,318 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 16 treesize of output 18 [2022-12-06 02:20:40,341 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:20:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:40,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:40,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:20:40,662 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 58 treesize of output 43 [2022-12-06 02:20:40,665 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 11 [2022-12-06 02:20:40,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:20:40,679 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:20:40,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-12-06 02:20:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:40,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309108007] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:40,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:40,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-06 02:20:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559272674] [2022-12-06 02:20:40,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:40,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:20:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:40,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:20:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=388, Unknown=3, NotChecked=0, Total=462 [2022-12-06 02:20:40,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:20:40,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 1513 transitions, 55354 flow. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 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:20:40,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:40,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:20:40,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:46,238 INFO L130 PetriNetUnfolder]: 13933/19319 cut-off events. [2022-12-06 02:20:46,238 INFO L131 PetriNetUnfolder]: For 1936/1936 co-relation queries the response was YES. [2022-12-06 02:20:46,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369074 conditions, 19319 events. 13933/19319 cut-off events. For 1936/1936 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 102426 event pairs, 879 based on Foata normal form. 1/15031 useless extension candidates. Maximal degree in co-relation 333128. Up to 18508 conditions per place. [2022-12-06 02:20:46,400 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 1281 selfloop transitions, 61 changer transitions 220/1562 dead transitions. [2022-12-06 02:20:46,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1562 transitions, 60275 flow [2022-12-06 02:20:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:20:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:20:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2022-12-06 02:20:46,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36182336182336183 [2022-12-06 02:20:46,402 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 138 predicate places. [2022-12-06 02:20:46,403 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:20:46,403 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 1562 transitions, 60275 flow [2022-12-06 02:20:46,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 1562 transitions, 60275 flow [2022-12-06 02:20:46,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:20:46,559 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:20:46,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 02:20:46,560 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 1562 transitions, 60275 flow [2022-12-06 02:20:46,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 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:20:46,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:20:46,560 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, 1, 1, 1, 1] [2022-12-06 02:20:46,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 02:20:46,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 02:20:46,765 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:20:46,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:20:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash -315341683, now seen corresponding path program 2 times [2022-12-06 02:20:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:20:46,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49614696] [2022-12-06 02:20:46,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:46,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:20:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:47,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:20:47,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49614696] [2022-12-06 02:20:47,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49614696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:20:47,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884672472] [2022-12-06 02:20:47,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:20:47,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:47,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:20:47,482 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:20:47,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 02:20:47,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:20:47,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:20:47,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-06 02:20:47,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:20:47,696 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-06 02:20:47,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-06 02:20:47,719 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 02:20:47,719 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 15 treesize of output 15 [2022-12-06 02:20:47,996 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 16 treesize of output 18 [2022-12-06 02:20:48,018 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 15 treesize of output 7 [2022-12-06 02:20:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:48,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:48,114 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_823) c_~X_0~0.base) .cse0)) (+ 1 c_~s_2~0))) (forall ((v_ArrVal_823 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_823) c_~X_0~0.base) .cse0)))))) is different from false [2022-12-06 02:20:48,125 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_823) c_~X_0~0.base) .cse0)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_823 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_823) c_~X_0~0.base) .cse0)))))) is different from false [2022-12-06 02:20:48,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:20:48,132 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 60 treesize of output 45 [2022-12-06 02:20:48,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 19 treesize of output 12 [2022-12-06 02:20:48,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:20:48,150 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:20:48,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-12-06 02:20:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:20:48,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884672472] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:48,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:48,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-06 02:20:48,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870698533] [2022-12-06 02:20:48,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:48,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:20:48,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:48,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:20:48,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=317, Unknown=2, NotChecked=74, Total=462 [2022-12-06 02:20:48,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 02:20:48,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 1562 transitions, 60275 flow. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 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:20:48,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:48,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 02:20:48,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:59,947 INFO L130 PetriNetUnfolder]: 16795/23210 cut-off events. [2022-12-06 02:20:59,947 INFO L131 PetriNetUnfolder]: For 2300/2300 co-relation queries the response was YES. [2022-12-06 02:20:59,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466639 conditions, 23210 events. 16795/23210 cut-off events. For 2300/2300 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 126004 event pairs, 880 based on Foata normal form. 2/17867 useless extension candidates. Maximal degree in co-relation 427724. Up to 22399 conditions per place. [2022-12-06 02:21:00,158 INFO L137 encePairwiseOnDemand]: 17/39 looper letters, 1526 selfloop transitions, 193 changer transitions 228/1947 dead transitions. [2022-12-06 02:21:00,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1947 transitions, 79044 flow [2022-12-06 02:21:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 02:21:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 02:21:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 251 transitions. [2022-12-06 02:21:00,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3217948717948718 [2022-12-06 02:21:00,160 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 157 predicate places. [2022-12-06 02:21:00,160 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:21:00,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 1947 transitions, 79044 flow [2022-12-06 02:21:00,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 1947 transitions, 79044 flow [2022-12-06 02:21:00,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:21:00,348 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [868] L56-->L53: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet1#1_26| 256) 0)) (= (+ v_~i_3~0_141 1) v_~i_3~0_140) (= (select (select |v_#memory_int_104| v_~X_0~0.base_60) (+ (* v_~i_3~0_140 4) v_~X_0~0.offset_60)) v_~t_4~0_49) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (ite (< v_~i_3~0_141 v_~n_1~0_103) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|)) InVars {~i_3~0=v_~i_3~0_141, ~n_1~0=v_~n_1~0_103, #memory_int=|v_#memory_int_104|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60, thread2Thread1of1ForFork0_#t~nondet1#1=|v_thread2Thread1of1ForFork0_#t~nondet1#1_26|} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_17|, ~i_3~0=v_~i_3~0_140, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~t_4~0=v_~t_4~0_49, ~n_1~0=v_~n_1~0_103, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, #memory_int=|v_#memory_int_104|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_17|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~i_3~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~t_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_#t~nondet1#1] and [918] L74-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5#1_In_1| 256) 0) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_8| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_8|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_Out_6|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_8| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_6| 0) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_8| (ite (not (< v_~i_3~0_In_8 v_~n_1~0_In_18)) 1 0))) InVars {~i_3~0=v_~i_3~0_In_8, thread3Thread1of1ForFork2_#t~nondet5#1=|v_thread3Thread1of1ForFork2_#t~nondet5#1_In_1|, ~n_1~0=v_~n_1~0_In_18} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_8|, ~i_3~0=v_~i_3~0_In_8, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_6|, ~n_1~0=v_~n_1~0_In_18, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_6|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_8|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~nondet5#1, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 02:21:00,457 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [868] L56-->L53: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet1#1_26| 256) 0)) (= (+ v_~i_3~0_141 1) v_~i_3~0_140) (= (select (select |v_#memory_int_104| v_~X_0~0.base_60) (+ (* v_~i_3~0_140 4) v_~X_0~0.offset_60)) v_~t_4~0_49) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (ite (< v_~i_3~0_141 v_~n_1~0_103) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|)) InVars {~i_3~0=v_~i_3~0_141, ~n_1~0=v_~n_1~0_103, #memory_int=|v_#memory_int_104|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60, thread2Thread1of1ForFork0_#t~nondet1#1=|v_thread2Thread1of1ForFork0_#t~nondet1#1_26|} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_17|, ~i_3~0=v_~i_3~0_140, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~t_4~0=v_~t_4~0_49, ~n_1~0=v_~n_1~0_103, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, #memory_int=|v_#memory_int_104|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_17|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~i_3~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~t_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_#t~nondet1#1] and [886] L74-->L71: Formula: (and (= v_~t_5~0_47 (select (select |v_#memory_int_126| v_~X_0~0.base_68) (+ (* v_~i_3~0_156 4) v_~X_0~0.offset_68))) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (= (ite (< v_~i_3~0_157 v_~n_1~0_117) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (= v_~i_3~0_156 (+ v_~i_3~0_157 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| 0)) (not (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5#1_40| 256) 0))) InVars {~i_3~0=v_~i_3~0_157, thread3Thread1of1ForFork2_#t~nondet5#1=|v_thread3Thread1of1ForFork2_#t~nondet5#1_40|, ~n_1~0=v_~n_1~0_117, #memory_int=|v_#memory_int_126|, ~X_0~0.offset=v_~X_0~0.offset_68, ~X_0~0.base=v_~X_0~0.base_68} OutVars{~i_3~0=v_~i_3~0_156, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|, ~n_1~0=v_~n_1~0_117, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_39|, #memory_int=|v_#memory_int_126|, ~X_0~0.offset=v_~X_0~0.offset_68, ~t_5~0=v_~t_5~0_47, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_17|, ~X_0~0.base=v_~X_0~0.base_68, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_17|} AuxVars[] AssignedVars[~i_3~0, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~nondet5#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~t_5~0, thread3Thread1of1ForFork2_#t~mem7#1, thread3Thread1of1ForFork2_#t~post6#1] [2022-12-06 02:21:00,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [868] L56-->L53: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet1#1_26| 256) 0)) (= (+ v_~i_3~0_141 1) v_~i_3~0_140) (= (select (select |v_#memory_int_104| v_~X_0~0.base_60) (+ (* v_~i_3~0_140 4) v_~X_0~0.offset_60)) v_~t_4~0_49) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (ite (< v_~i_3~0_141 v_~n_1~0_103) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|)) InVars {~i_3~0=v_~i_3~0_141, ~n_1~0=v_~n_1~0_103, #memory_int=|v_#memory_int_104|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60, thread2Thread1of1ForFork0_#t~nondet1#1=|v_thread2Thread1of1ForFork0_#t~nondet1#1_26|} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_17|, ~i_3~0=v_~i_3~0_140, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~t_4~0=v_~t_4~0_49, ~n_1~0=v_~n_1~0_103, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, #memory_int=|v_#memory_int_104|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_17|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~i_3~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~t_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_#t~nondet1#1] and [840] L92-4-->L93-1: Formula: (= (select (select |v_#memory_int_94| |v_thread1Thread1of1ForFork1_~#t2~0.base_27|) |v_thread1Thread1of1ForFork1_~#t2~0.offset_21|) |v_thread1Thread1of1ForFork1_#t~mem13_13|) InVars {thread1Thread1of1ForFork1_~#t2~0.base=|v_thread1Thread1of1ForFork1_~#t2~0.base_27|, #memory_int=|v_#memory_int_94|, thread1Thread1of1ForFork1_~#t2~0.offset=|v_thread1Thread1of1ForFork1_~#t2~0.offset_21|} OutVars{thread1Thread1of1ForFork1_~#t2~0.base=|v_thread1Thread1of1ForFork1_~#t2~0.base_27|, thread1Thread1of1ForFork1_#t~pre11=|v_thread1Thread1of1ForFork1_#t~pre11_15|, thread1Thread1of1ForFork1_#t~mem13=|v_thread1Thread1of1ForFork1_#t~mem13_13|, #memory_int=|v_#memory_int_94|, thread1Thread1of1ForFork1_~#t2~0.offset=|v_thread1Thread1of1ForFork1_~#t2~0.offset_21|, thread1Thread1of1ForFork1_#t~nondet12=|v_thread1Thread1of1ForFork1_#t~nondet12_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~pre11, thread1Thread1of1ForFork1_#t~mem13, thread1Thread1of1ForFork1_#t~nondet12] [2022-12-06 02:21:00,606 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [868] L56-->L53: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet1#1_26| 256) 0)) (= (+ v_~i_3~0_141 1) v_~i_3~0_140) (= (select (select |v_#memory_int_104| v_~X_0~0.base_60) (+ (* v_~i_3~0_140 4) v_~X_0~0.offset_60)) v_~t_4~0_49) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (ite (< v_~i_3~0_141 v_~n_1~0_103) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|)) InVars {~i_3~0=v_~i_3~0_141, ~n_1~0=v_~n_1~0_103, #memory_int=|v_#memory_int_104|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60, thread2Thread1of1ForFork0_#t~nondet1#1=|v_thread2Thread1of1ForFork0_#t~nondet1#1_26|} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_17|, ~i_3~0=v_~i_3~0_140, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~t_4~0=v_~t_4~0_49, ~n_1~0=v_~n_1~0_103, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, #memory_int=|v_#memory_int_104|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_17|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~i_3~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~t_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_#t~nondet1#1] and [924] L91-3-->L92-3: Formula: (and (= (store |v_#memory_int_189| |v_thread1Thread1of1ForFork1_~#t3~0.base_41| (store (select |v_#memory_int_189| |v_thread1Thread1of1ForFork1_~#t3~0.base_41|) |v_thread1Thread1of1ForFork1_~#t3~0.offset_35| |v_thread1Thread1of1ForFork1_#t~pre11_29|)) |v_#memory_int_188|) (= |v_thread1Thread1of1ForFork1_#t~pre11_29| |v_#pthreadsForks_130|) (= |v_#pthreadsForks_129| (+ |v_#pthreadsForks_130| 1))) InVars {thread1Thread1of1ForFork1_~#t3~0.base=|v_thread1Thread1of1ForFork1_~#t3~0.base_41|, #pthreadsForks=|v_#pthreadsForks_130|, #memory_int=|v_#memory_int_189|, thread1Thread1of1ForFork1_~#t3~0.offset=|v_thread1Thread1of1ForFork1_~#t3~0.offset_35|} OutVars{thread1Thread1of1ForFork1_~#t3~0.base=|v_thread1Thread1of1ForFork1_~#t3~0.base_41|, thread1Thread1of1ForFork1_#t~pre11=|v_thread1Thread1of1ForFork1_#t~pre11_29|, #pthreadsForks=|v_#pthreadsForks_129|, #memory_int=|v_#memory_int_188|, thread1Thread1of1ForFork1_~#t3~0.offset=|v_thread1Thread1of1ForFork1_~#t3~0.offset_35|, thread1Thread1of1ForFork1_#t~nondet10=|v_thread1Thread1of1ForFork1_#t~nondet10_13|, thread1Thread1of1ForFork1_#t~pre9=|v_thread1Thread1of1ForFork1_#t~pre9_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~pre11, #pthreadsForks, #memory_int, thread1Thread1of1ForFork1_#t~nondet10, thread1Thread1of1ForFork1_#t~pre9] [2022-12-06 02:21:00,669 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [868] L56-->L53: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet1#1_26| 256) 0)) (= (+ v_~i_3~0_141 1) v_~i_3~0_140) (= (select (select |v_#memory_int_104| v_~X_0~0.base_60) (+ (* v_~i_3~0_140 4) v_~X_0~0.offset_60)) v_~t_4~0_49) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (ite (< v_~i_3~0_141 v_~n_1~0_103) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|)) InVars {~i_3~0=v_~i_3~0_141, ~n_1~0=v_~n_1~0_103, #memory_int=|v_#memory_int_104|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60, thread2Thread1of1ForFork0_#t~nondet1#1=|v_thread2Thread1of1ForFork0_#t~nondet1#1_26|} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_17|, ~i_3~0=v_~i_3~0_140, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~t_4~0=v_~t_4~0_49, ~n_1~0=v_~n_1~0_103, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, #memory_int=|v_#memory_int_104|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_17|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~i_3~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~t_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_#t~nondet1#1] and [908] L113-->L113: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork3_plus_~a#1_5| |v_thread4Thread1of1ForFork3_plus_~b#1_5|))) (and (= v_~s_6~0_48 |v_thread4Thread1of1ForFork3_plus_#in~a#1_5|) (not (= (mod |v_thread4Thread1of1ForFork3_#t~nondet15#1_40| 256) 0)) (= v_~i_7~0_85 (+ v_~i_7~0_86 1)) (= v_~s_6~0_47 |v_thread4Thread1of1ForFork3_plus_#res#1_5|) (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_29| |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_29|) (<= v_~s_6~0_47 2147483647) (not (= (ite (< v_~i_7~0_86 v_~n_1~0_139) 1 0) 0)) (= |v_thread4Thread1of1ForFork3_plus_#in~b#1_5| |v_thread4Thread1of1ForFork3_plus_~b#1_5|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork3_plus_~b#1_5| 0)) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_29|) (= .cse0 |v_thread4Thread1of1ForFork3_plus_#res#1_5|) (= |v_thread4Thread1of1ForFork3_plus_#in~a#1_5| |v_thread4Thread1of1ForFork3_plus_~a#1_5|) (= (select (select |v_#memory_int_154| v_~X_0~0.base_84) (+ v_~X_0~0.offset_84 (* v_~i_7~0_85 4))) v_~t_8~0_45) (<= 0 (+ v_~s_6~0_47 2147483648)) (= |v_thread4Thread1of1ForFork3_plus_#in~b#1_5| v_~t_8~0_45))) InVars {~s_6~0=v_~s_6~0_48, ~n_1~0=v_~n_1~0_139, thread4Thread1of1ForFork3_#t~nondet15#1=|v_thread4Thread1of1ForFork3_#t~nondet15#1_40|, #memory_int=|v_#memory_int_154|, ~X_0~0.offset=v_~X_0~0.offset_84, ~X_0~0.base=v_~X_0~0.base_84, ~i_7~0=v_~i_7~0_86} OutVars{~s_6~0=v_~s_6~0_47, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_29|, thread4Thread1of1ForFork3_#t~mem17#1=|v_thread4Thread1of1ForFork3_#t~mem17#1_13|, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_5|, thread4Thread1of1ForFork3_#t~ret18#1=|v_thread4Thread1of1ForFork3_#t~ret18#1_5|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_29|, ~X_0~0.base=v_~X_0~0.base_84, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_5|, ~n_1~0=v_~n_1~0_139, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_5|, #memory_int=|v_#memory_int_154|, ~t_8~0=v_~t_8~0_45, ~X_0~0.offset=v_~X_0~0.offset_84, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_5|, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_5|, thread4Thread1of1ForFork3_#t~post16#1=|v_thread4Thread1of1ForFork3_#t~post16#1_13|, ~i_7~0=v_~i_7~0_85} AuxVars[] AssignedVars[~s_6~0, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~mem17#1, thread4Thread1of1ForFork3_#t~nondet15#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_#t~ret18#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork3_plus_~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, ~t_8~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_plus_~a#1, thread4Thread1of1ForFork3_#t~post16#1, ~i_7~0] [2022-12-06 02:21:01,034 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [868] L56-->L53: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet1#1_26| 256) 0)) (= (+ v_~i_3~0_141 1) v_~i_3~0_140) (= (select (select |v_#memory_int_104| v_~X_0~0.base_60) (+ (* v_~i_3~0_140 4) v_~X_0~0.offset_60)) v_~t_4~0_49) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (ite (< v_~i_3~0_141 v_~n_1~0_103) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|)) InVars {~i_3~0=v_~i_3~0_141, ~n_1~0=v_~n_1~0_103, #memory_int=|v_#memory_int_104|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60, thread2Thread1of1ForFork0_#t~nondet1#1=|v_thread2Thread1of1ForFork0_#t~nondet1#1_26|} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_17|, ~i_3~0=v_~i_3~0_140, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~t_4~0=v_~t_4~0_49, ~n_1~0=v_~n_1~0_103, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, #memory_int=|v_#memory_int_104|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_17|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~i_3~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~t_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_#t~nondet1#1] and [922] L92-1-->L92-3: Formula: (and (= (store |v_#memory_int_181| |v_thread1Thread1of1ForFork1_~#t3~0.base_37| (store (select |v_#memory_int_181| |v_thread1Thread1of1ForFork1_~#t3~0.base_37|) |v_thread1Thread1of1ForFork1_~#t3~0.offset_31| |v_thread1Thread1of1ForFork1_#t~pre11_25|)) |v_#memory_int_180|) (= (+ |v_#pthreadsForks_122| 1) |v_#pthreadsForks_121|)) InVars {thread1Thread1of1ForFork1_~#t3~0.base=|v_thread1Thread1of1ForFork1_~#t3~0.base_37|, thread1Thread1of1ForFork1_#t~pre11=|v_thread1Thread1of1ForFork1_#t~pre11_25|, #pthreadsForks=|v_#pthreadsForks_122|, #memory_int=|v_#memory_int_181|, thread1Thread1of1ForFork1_~#t3~0.offset=|v_thread1Thread1of1ForFork1_~#t3~0.offset_31|} OutVars{thread1Thread1of1ForFork1_~#t3~0.base=|v_thread1Thread1of1ForFork1_~#t3~0.base_37|, thread1Thread1of1ForFork1_#t~pre11=|v_thread1Thread1of1ForFork1_#t~pre11_25|, #pthreadsForks=|v_#pthreadsForks_121|, #memory_int=|v_#memory_int_180|, thread1Thread1of1ForFork1_~#t3~0.offset=|v_thread1Thread1of1ForFork1_~#t3~0.offset_31|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int] [2022-12-06 02:21:01,087 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [868] L56-->L53: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet1#1_26| 256) 0)) (= (+ v_~i_3~0_141 1) v_~i_3~0_140) (= (select (select |v_#memory_int_104| v_~X_0~0.base_60) (+ (* v_~i_3~0_140 4) v_~X_0~0.offset_60)) v_~t_4~0_49) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (ite (< v_~i_3~0_141 v_~n_1~0_103) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|)) InVars {~i_3~0=v_~i_3~0_141, ~n_1~0=v_~n_1~0_103, #memory_int=|v_#memory_int_104|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60, thread2Thread1of1ForFork0_#t~nondet1#1=|v_thread2Thread1of1ForFork0_#t~nondet1#1_26|} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_17|, ~i_3~0=v_~i_3~0_140, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~t_4~0=v_~t_4~0_49, ~n_1~0=v_~n_1~0_103, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, #memory_int=|v_#memory_int_104|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_17|, ~X_0~0.offset=v_~X_0~0.offset_60, ~X_0~0.base=v_~X_0~0.base_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~i_3~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~t_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_#t~nondet1#1] and [899] L139-4-->L140-1: Formula: (= (select (select |v_#memory_int_140| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem32#1_20|) InVars {#memory_int=|v_#memory_int_140|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_20|, #memory_int=|v_#memory_int_140|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_15|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre30#1] [2022-12-06 02:21:01,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:21:01,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 981 [2022-12-06 02:21:01,141 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 1947 transitions, 79060 flow [2022-12-06 02:21:01,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 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:21:01,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:21:01,142 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, 1, 1, 1] [2022-12-06 02:21:01,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 02:21:01,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:21:01,343 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:21:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:21:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash 265292032, now seen corresponding path program 1 times [2022-12-06 02:21:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:21:01,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272016832] [2022-12-06 02:21:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:21:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:21:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:21:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:21:01,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:21:01,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272016832] [2022-12-06 02:21:01,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272016832] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:21:01,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471793646] [2022-12-06 02:21:01,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:21:01,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:21:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:21:01,967 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:21:01,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 02:21:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:21:02,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:21:02,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:21:02,142 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-06 02:21:02,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-06 02:21:02,199 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 02:21:02,199 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 29 treesize of output 34 [2022-12-06 02:21:02,289 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 16 treesize of output 18 [2022-12-06 02:21:02,344 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:21:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:21:02,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:21:02,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:21:02,486 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 58 treesize of output 43 [2022-12-06 02:21:02,490 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 11 [2022-12-06 02:21:02,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:21:02,506 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:21:02,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-12-06 02:21:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:21:02,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471793646] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:21:02,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:21:02,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-06 02:21:02,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108507131] [2022-12-06 02:21:02,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:21:02,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:21:02,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:21:02,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:21:02,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:21:02,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 02:21:02,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 1947 transitions, 79060 flow. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 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:21:02,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:21:02,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 02:21:02,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:21:20,063 INFO L130 PetriNetUnfolder]: 25055/35100 cut-off events. [2022-12-06 02:21:20,063 INFO L131 PetriNetUnfolder]: For 3592/3592 co-relation queries the response was YES. [2022-12-06 02:21:20,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740940 conditions, 35100 events. 25055/35100 cut-off events. For 3592/3592 co-relation queries the response was YES. Maximal size of possible extension queue 1543. Compared 210829 event pairs, 720 based on Foata normal form. 6/27133 useless extension candidates. Maximal degree in co-relation 696345. Up to 34289 conditions per place. [2022-12-06 02:21:20,673 INFO L137 encePairwiseOnDemand]: 20/47 looper letters, 2683 selfloop transitions, 1106 changer transitions 288/4077 dead transitions. [2022-12-06 02:21:20,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 4077 transitions, 173393 flow [2022-12-06 02:21:20,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-06 02:21:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-06 02:21:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 473 transitions. [2022-12-06 02:21:20,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24545926310326932 [2022-12-06 02:21:20,676 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 197 predicate places. [2022-12-06 02:21:20,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:21:20,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 4077 transitions, 173393 flow [2022-12-06 02:21:21,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 4077 transitions, 173393 flow [2022-12-06 02:21:21,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:21:21,016 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:21:21,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 340 [2022-12-06 02:21:21,017 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 4077 transitions, 173393 flow [2022-12-06 02:21:21,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 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:21:21,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:21:21,017 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, 1, 1, 1, 1] [2022-12-06 02:21:21,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 02:21:21,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:21:21,218 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:21:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:21:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1967502224, now seen corresponding path program 1 times [2022-12-06 02:21:21,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:21:21,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031651213] [2022-12-06 02:21:21,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:21:21,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:21:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:21:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:21:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:21:21,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031651213] [2022-12-06 02:21:21,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031651213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:21:21,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:21:21,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:21:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010983376] [2022-12-06 02:21:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:21:21,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:21:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:21:21,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:21:21,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:21:21,322 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 02:21:21,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 4077 transitions, 173393 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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:21:21,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:21:21,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 02:21:21,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:22:18,357 INFO L130 PetriNetUnfolder]: 43757/62325 cut-off events. [2022-12-06 02:22:18,357 INFO L131 PetriNetUnfolder]: For 6659/6659 co-relation queries the response was YES. [2022-12-06 02:22:18,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378140 conditions, 62325 events. 43757/62325 cut-off events. For 6659/6659 co-relation queries the response was YES. Maximal size of possible extension queue 2814. Compared 419305 event pairs, 795 based on Foata normal form. 187/50461 useless extension candidates. Maximal degree in co-relation 729344. Up to 61514 conditions per place. [2022-12-06 02:22:19,200 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 8362 selfloop transitions, 357 changer transitions 995/9714 dead transitions. [2022-12-06 02:22:19,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 9714 transitions, 432915 flow [2022-12-06 02:22:19,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:22:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:22:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2022-12-06 02:22:19,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48404255319148937 [2022-12-06 02:22:19,202 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 204 predicate places. [2022-12-06 02:22:19,202 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:22:19,202 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 9714 transitions, 432915 flow [2022-12-06 02:22:20,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 9714 transitions, 432915 flow [2022-12-06 02:22:20,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:22:23,300 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:22:23,300 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4098 [2022-12-06 02:22:23,300 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 9713 transitions, 432871 flow [2022-12-06 02:22:23,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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:22:23,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:22:23,301 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, 1, 1, 1] [2022-12-06 02:22:23,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 02:22:23,301 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:22:23,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:22:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1625121764, now seen corresponding path program 1 times [2022-12-06 02:22:23,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:22:23,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378026605] [2022-12-06 02:22:23,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:22:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:22:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:22:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:22:23,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:22:23,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378026605] [2022-12-06 02:22:23,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378026605] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:22:23,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14446287] [2022-12-06 02:22:23,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:22:23,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:22:23,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:22:23,789 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:22:23,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 02:22:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:22:23,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-06 02:22:23,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:22:23,960 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-06 02:22:23,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-06 02:22:23,981 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 02:22:23,982 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 15 treesize of output 15 [2022-12-06 02:22:24,097 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 16 treesize of output 18 [2022-12-06 02:22:24,138 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:22:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:22:24,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:22:24,275 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_975 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_975) c_~X_0~0.base) .cse0)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_975 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_975) c_~X_0~0.base) .cse0)))))) is different from false [2022-12-06 02:22:24,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:22:24,315 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 48 treesize of output 34 [2022-12-06 02:22:24,319 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 13 treesize of output 9 [2022-12-06 02:22:24,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:22:24,335 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:22:24,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2022-12-06 02:22:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:22:24,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14446287] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:22:24,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:22:24,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-06 02:22:24,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183846290] [2022-12-06 02:22:24,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:22:24,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:22:24,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:22:24,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:22:24,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=278, Unknown=7, NotChecked=34, Total=380 [2022-12-06 02:22:24,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 02:22:24,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 9713 transitions, 432871 flow. Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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:22:24,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:22:24,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 02:22:24,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:22:31,907 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 44 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:25:52,313 INFO L130 PetriNetUnfolder]: 45564/64924 cut-off events. [2022-12-06 02:25:52,313 INFO L131 PetriNetUnfolder]: For 6985/6985 co-relation queries the response was YES. [2022-12-06 02:25:52,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500552 conditions, 64924 events. 45564/64924 cut-off events. For 6985/6985 co-relation queries the response was YES. Maximal size of possible extension queue 2942. Compared 440905 event pairs, 781 based on Foata normal form. 2/52485 useless extension candidates. Maximal degree in co-relation 762343. Up to 64113 conditions per place. [2022-12-06 02:25:53,128 INFO L137 encePairwiseOnDemand]: 18/48 looper letters, 8757 selfloop transitions, 276 changer transitions 1043/10076 dead transitions. [2022-12-06 02:25:53,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 10076 transitions, 469207 flow [2022-12-06 02:25:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:25:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 02:25:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 259 transitions. [2022-12-06 02:25:53,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29976851851851855 [2022-12-06 02:25:53,130 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 220 predicate places. [2022-12-06 02:25:53,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:25:53,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 10076 transitions, 469207 flow [2022-12-06 02:25:54,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 10076 transitions, 469207 flow [2022-12-06 02:25:54,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:25:54,120 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:25:54,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 991 [2022-12-06 02:25:54,121 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 10076 transitions, 469207 flow [2022-12-06 02:25:54,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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:25:54,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:25:54,121 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, 1, 1, 1] [2022-12-06 02:25:54,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 02:25:54,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-06 02:25:54,322 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:25:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:25:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1686504652, now seen corresponding path program 1 times [2022-12-06 02:25:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:25:54,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263393458] [2022-12-06 02:25:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:25:54,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:25:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:25:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:54,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:25:54,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263393458] [2022-12-06 02:25:54,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263393458] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:25:54,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647758481] [2022-12-06 02:25:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:25:54,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:25:54,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:25:54,759 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:25:54,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 02:25:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:25:54,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 02:25:54,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:25:54,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:25:54,980 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 16 treesize of output 18 [2022-12-06 02:25:55,020 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:25:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:55,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:25:55,197 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~t_4~0 c_~s_2~0)) (.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_1036 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_1036) c_~X_0~0.base) .cse0) .cse1)) (forall ((v_ArrVal_1036 (Array Int Int))) (< .cse1 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_1036) c_~X_0~0.base) .cse0) 1))))) is different from false [2022-12-06 02:25:55,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:25:55,207 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 48 treesize of output 34 [2022-12-06 02:25:55,213 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 13 treesize of output 9 [2022-12-06 02:25:55,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:25:55,230 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:25:55,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 12 [2022-12-06 02:25:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:55,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647758481] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:25:55,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:25:55,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-06 02:25:55,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040587891] [2022-12-06 02:25:55,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:25:55,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:25:55,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:25:55,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:25:55,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=279, Unknown=8, NotChecked=34, Total=380 [2022-12-06 02:25:55,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 02:25:55,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 10076 transitions, 469207 flow. Second operand has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 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:25:55,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:25:55,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 02:25:55,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:19,648 INFO L130 PetriNetUnfolder]: 45994/65551 cut-off events. [2022-12-06 02:29:19,648 INFO L131 PetriNetUnfolder]: For 7076/7076 co-relation queries the response was YES. [2022-12-06 02:29:19,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580600 conditions, 65551 events. 45994/65551 cut-off events. For 7076/7076 co-relation queries the response was YES. Maximal size of possible extension queue 2994. Compared 445636 event pairs, 719 based on Foata normal form. 1/53015 useless extension candidates. Maximal degree in co-relation 795342. Up to 64740 conditions per place. [2022-12-06 02:29:20,678 INFO L137 encePairwiseOnDemand]: 24/48 looper letters, 8878 selfloop transitions, 220 changer transitions 1053/10151 dead transitions. [2022-12-06 02:29:20,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 10151 transitions, 493001 flow [2022-12-06 02:29:20,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:29:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:29:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 219 transitions. [2022-12-06 02:29:20,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32589285714285715 [2022-12-06 02:29:20,680 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 233 predicate places. [2022-12-06 02:29:20,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:20,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 277 places, 10151 transitions, 493001 flow [2022-12-06 02:29:21,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 277 places, 10151 transitions, 493001 flow [2022-12-06 02:29:21,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:21,640 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:21,641 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 961 [2022-12-06 02:29:21,641 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 10151 transitions, 493001 flow [2022-12-06 02:29:21,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 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:29:21,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:21,641 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, 1, 1, 1] [2022-12-06 02:29:21,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:21,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:21,850 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:29:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:21,850 INFO L85 PathProgramCache]: Analyzing trace with hash -83099337, now seen corresponding path program 1 times [2022-12-06 02:29:21,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:21,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824357424] [2022-12-06 02:29:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:21,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:22,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:22,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824357424] [2022-12-06 02:29:22,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824357424] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:22,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259930063] [2022-12-06 02:29:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:22,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:22,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:22,392 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:22,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 02:29:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:22,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 02:29:22,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:22,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:29:22,650 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 16 treesize of output 18 [2022-12-06 02:29:22,678 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:29:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:22,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:22,816 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_1097 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_1097) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_1097 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_1097) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))))) is different from false [2022-12-06 02:29:22,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:22,831 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 58 treesize of output 43 [2022-12-06 02:29:22,835 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 11 [2022-12-06 02:29:22,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:29:22,848 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:29:22,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-12-06 02:29:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 02:29:22,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259930063] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:22,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:22,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-06 02:29:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706481399] [2022-12-06 02:29:22,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:22,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:29:22,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:22,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:29:22,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2022-12-06 02:29:22,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 02:29:22,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 10151 transitions, 493001 flow. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 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:29:22,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:22,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 02:29:22,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:32:30,629 INFO L130 PetriNetUnfolder]: 47123/67229 cut-off events. [2022-12-06 02:32:30,630 INFO L131 PetriNetUnfolder]: For 7255/7255 co-relation queries the response was YES. [2022-12-06 02:32:30,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688257 conditions, 67229 events. 47123/67229 cut-off events. For 7255/7255 co-relation queries the response was YES. Maximal size of possible extension queue 3100. Compared 460349 event pairs, 747 based on Foata normal form. 1/54443 useless extension candidates. Maximal degree in co-relation 828341. Up to 66418 conditions per place. [2022-12-06 02:32:31,477 INFO L137 encePairwiseOnDemand]: 19/48 looper letters, 9182 selfloop transitions, 134 changer transitions 1082/10398 dead transitions. [2022-12-06 02:32:31,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 10398 transitions, 525766 flow [2022-12-06 02:32:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:32:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:32:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2022-12-06 02:32:31,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2022-12-06 02:32:31,479 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 241 predicate places. [2022-12-06 02:32:31,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:32:31,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 10398 transitions, 525766 flow [2022-12-06 02:32:32,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 10398 transitions, 525766 flow [2022-12-06 02:32:32,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:32:32,498 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:32:32,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1020 [2022-12-06 02:32:32,499 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 10398 transitions, 525766 flow [2022-12-06 02:32:32,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 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:32:32,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:32:32,499 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, 1, 1, 1] [2022-12-06 02:32:32,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 02:32:32,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:32:32,705 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 02:32:32,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:32:32,705 INFO L85 PathProgramCache]: Analyzing trace with hash -937058859, now seen corresponding path program 1 times [2022-12-06 02:32:32,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:32:32,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686333778] [2022-12-06 02:32:32,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:32,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:32:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:33,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:32:33,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686333778] [2022-12-06 02:32:33,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686333778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:32:33,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428151050] [2022-12-06 02:32:33,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:33,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:32:33,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:32:33,236 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:32:33,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 02:32:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:33,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 02:32:33,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:32:33,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:32:33,445 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 16 treesize of output 18 [2022-12-06 02:32:33,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:32:33,501 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 16 treesize of output 18 [2022-12-06 02:32:33,570 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:32:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:33,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:32:33,674 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_1159 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_1159) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_1159 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_1159) c_~X_0~0.base) .cse0)) (+ c_~t_4~0 1 c_~s_2~0))))) is different from false [2022-12-06 02:32:33,683 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_1159 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_1159) c_~X_0~0.base) .cse0))) (forall ((v_ArrVal_1159 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_1159) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) is different from false [2022-12-06 02:32:33,702 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1158) |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_1159) c_~X_0~0.base) .cse0))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1158) |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_1159) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) is different from false [2022-12-06 02:32:33,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:32:33,712 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 104 treesize of output 72 [2022-12-06 02:32:33,715 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 62 treesize of output 54 [2022-12-06 02:32:33,719 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 28 treesize of output 24 [2022-12-06 02:32:33,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:32:33,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:32:33,755 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:32:33,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 11 [2022-12-06 02:32:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:33,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428151050] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:32:33,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:32:33,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 02:32:33,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261770071] [2022-12-06 02:32:33,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:32:33,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:32:33,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:32:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:32:33,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=359, Unknown=3, NotChecked=120, Total=552 [2022-12-06 02:32:33,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 02:32:33,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 10398 transitions, 525766 flow. Second operand has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 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:32:33,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:32:33,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 02:32:33,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:33:05,131 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:33:05,131 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:33:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:33:05,144 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 02:33:05,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 02:33:05,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-06 02:33:05,344 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 0/48 universal loopers) in iteration 25,while PetriNetUnfolder was constructing finite prefix that currently has 296965 conditions, 11369 events (7704/11368 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 2161. Compared 78969 event pairs, 176 based on Foata normal form. 0/11667 useless extension candidates. Maximal degree in co-relation 189784. Up to 10765 conditions per place.). [2022-12-06 02:33:05,346 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2022-12-06 02:33:05,346 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 02:33:05,346 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 02:33:05,346 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 02:33:05,346 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 02:33:05,346 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2022-12-06 02:33:05,346 INFO L458 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:05,349 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:33:05,349 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:33:05,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:33:05 BasicIcfg [2022-12-06 02:33:05,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:33:05,351 INFO L158 Benchmark]: Toolchain (without parser) took 807742.02ms. Allocated memory was 199.2MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 156.5MB in the beginning and 435.5MB in the end (delta: -279.0MB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2022-12-06 02:33:05,352 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 176.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:33:05,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.44ms. Allocated memory is still 199.2MB. Free memory was 156.0MB in the beginning and 141.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 02:33:05,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.14ms. Allocated memory is still 199.2MB. Free memory was 141.3MB in the beginning and 139.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:33:05,352 INFO L158 Benchmark]: Boogie Preprocessor took 51.76ms. Allocated memory is still 199.2MB. Free memory was 139.2MB in the beginning and 137.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:33:05,352 INFO L158 Benchmark]: RCFGBuilder took 854.15ms. Allocated memory is still 199.2MB. Free memory was 137.1MB in the beginning and 96.7MB in the end (delta: 40.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-12-06 02:33:05,352 INFO L158 Benchmark]: TraceAbstraction took 806464.95ms. Allocated memory was 199.2MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 96.2MB in the beginning and 435.5MB in the end (delta: -339.3MB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2022-12-06 02:33:05,353 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 176.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 303.44ms. Allocated memory is still 199.2MB. Free memory was 156.0MB in the beginning and 141.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.14ms. Allocated memory is still 199.2MB. Free memory was 141.3MB in the beginning and 139.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.76ms. Allocated memory is still 199.2MB. Free memory was 139.2MB in the beginning and 137.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 854.15ms. Allocated memory is still 199.2MB. Free memory was 137.1MB in the beginning and 96.7MB in the end (delta: 40.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 806464.95ms. Allocated memory was 199.2MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 96.2MB in the beginning and 435.5MB in the end (delta: -339.3MB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 169 PlacesBefore, 44 PlacesAfterwards, 170 TransitionsBefore, 37 TransitionsAfterwards, 2612 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 87 TrivialYvCompositions, 38 ConcurrentYvCompositions, 8 ChoiceCompositions, 133 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1521, independent: 1472, independent conditional: 1472, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1521, independent: 1472, independent conditional: 0, independent unconditional: 1472, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1521, independent: 1472, independent conditional: 0, independent unconditional: 1472, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1521, independent: 1472, independent conditional: 0, independent unconditional: 1472, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1334, independent: 1310, independent conditional: 0, independent unconditional: 1310, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1334, independent: 1302, independent conditional: 0, independent unconditional: 1302, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 115, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1521, independent: 162, independent conditional: 0, independent unconditional: 162, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 1334, unknown conditional: 0, unknown unconditional: 1334] , Statistics on independence cache: Total cache size (in pairs): 2003, Positive cache size: 1979, Positive conditional cache size: 0, Positive unconditional cache size: 1979, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 44 PlacesAfterwards, 84 TransitionsBefore, 81 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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, 47 PlacesBefore, 47 PlacesAfterwards, 130 TransitionsBefore, 130 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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: 2.4s, 51 PlacesBefore, 50 PlacesAfterwards, 248 TransitionsBefore, 247 TransitionsAfterwards, 0 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, 53 PlacesBefore, 53 PlacesAfterwards, 200 TransitionsBefore, 200 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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: 2.7s, 59 PlacesBefore, 58 PlacesAfterwards, 318 TransitionsBefore, 317 TransitionsAfterwards, 0 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, 61 PlacesBefore, 61 PlacesAfterwards, 270 TransitionsBefore, 270 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 64 PlacesBefore, 64 PlacesAfterwards, 282 TransitionsBefore, 282 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 67 PlacesBefore, 67 PlacesAfterwards, 275 TransitionsBefore, 275 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 74 PlacesBefore, 74 PlacesAfterwards, 334 TransitionsBefore, 334 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 81 PlacesBefore, 81 PlacesAfterwards, 364 TransitionsBefore, 364 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 96 PlacesBefore, 96 PlacesAfterwards, 649 TransitionsBefore, 649 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 109 PlacesBefore, 109 PlacesAfterwards, 789 TransitionsBefore, 789 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 128 PlacesBefore, 128 PlacesAfterwards, 1087 TransitionsBefore, 1087 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 140 PlacesBefore, 140 PlacesAfterwards, 1196 TransitionsBefore, 1196 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 154 PlacesBefore, 154 PlacesAfterwards, 1300 TransitionsBefore, 1300 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 162 PlacesBefore, 162 PlacesAfterwards, 1333 TransitionsBefore, 1333 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 174 PlacesBefore, 174 PlacesAfterwards, 1513 TransitionsBefore, 1513 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 182 PlacesBefore, 182 PlacesAfterwards, 1562 TransitionsBefore, 1562 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.8s, 201 PlacesBefore, 201 PlacesAfterwards, 1947 TransitionsBefore, 1947 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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, 241 PlacesBefore, 241 PlacesAfterwards, 4077 TransitionsBefore, 4077 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.2s, 248 PlacesBefore, 247 PlacesAfterwards, 9714 TransitionsBefore, 9713 TransitionsAfterwards, 0 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, 264 PlacesBefore, 264 PlacesAfterwards, 10076 TransitionsBefore, 10076 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 277 PlacesBefore, 277 PlacesAfterwards, 10151 TransitionsBefore, 10151 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 285 PlacesBefore, 285 PlacesAfterwards, 10398 TransitionsBefore, 10398 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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 - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 0/48 universal loopers) in iteration 25,while PetriNetUnfolder was constructing finite prefix that currently has 296965 conditions, 11369 events (7704/11368 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 2161. Compared 78969 event pairs, 176 based on Foata normal form. 0/11667 useless extension candidates. Maximal degree in co-relation 189784. Up to 10765 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 0/48 universal loopers) in iteration 25,while PetriNetUnfolder was constructing finite prefix that currently has 296965 conditions, 11369 events (7704/11368 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 2161. Compared 78969 event pairs, 176 based on Foata normal form. 0/11667 useless extension candidates. Maximal degree in co-relation 189784. Up to 10765 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 0/48 universal loopers) in iteration 25,while PetriNetUnfolder was constructing finite prefix that currently has 296965 conditions, 11369 events (7704/11368 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 2161. Compared 78969 event pairs, 176 based on Foata normal form. 0/11667 useless extension candidates. Maximal degree in co-relation 189784. Up to 10765 conditions per place.). - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 0/48 universal loopers) in iteration 25,while PetriNetUnfolder was constructing finite prefix that currently has 296965 conditions, 11369 events (7704/11368 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 2161. Compared 78969 event pairs, 176 based on Foata normal form. 0/11667 useless extension candidates. Maximal degree in co-relation 189784. Up to 10765 conditions per place.). - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 0/48 universal loopers) in iteration 25,while PetriNetUnfolder was constructing finite prefix that currently has 296965 conditions, 11369 events (7704/11368 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 2161. Compared 78969 event pairs, 176 based on Foata normal form. 0/11667 useless extension candidates. Maximal degree in co-relation 189784. Up to 10765 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 0/48 universal loopers) in iteration 25,while PetriNetUnfolder was constructing finite prefix that currently has 296965 conditions, 11369 events (7704/11368 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 2161. Compared 78969 event pairs, 176 based on Foata normal form. 0/11667 useless extension candidates. Maximal degree in co-relation 189784. Up to 10765 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 0/48 universal loopers) in iteration 25,while PetriNetUnfolder was constructing finite prefix that currently has 296965 conditions, 11369 events (7704/11368 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 2161. Compared 78969 event pairs, 176 based on Foata normal form. 0/11667 useless extension candidates. Maximal degree in co-relation 189784. Up to 10765 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 231 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 806.3s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 760.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 38 mSolverCounterUnknown, 5661 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5661 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1362 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17761 IncrementalHoareTripleChecker+Invalid, 19548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 387 mSolverCounterUnsat, 0 mSDtfsCounter, 17761 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1215 GetRequests, 641 SyntacticMatches, 60 SemanticMatches, 514 ConstructedPredicates, 11 IntricatePredicates, 4 DeprecatedPredicates, 3343 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525766occurred in iteration=24, InterpolantAutomatonStates: 271, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 1087 NumberOfCodeBlocks, 1087 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1457 ConstructedInterpolants, 38 QuantifiedInterpolants, 16451 SizeOfPredicates, 390 NumberOfNonLiveVariables, 5368 ConjunctsInSsa, 897 ConjunctsInUnsatCore, 57 InterpolantComputations, 9 PerfectInterpolantSequences, 8/104 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown