/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:26:56,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:26:56,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:26:56,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:26:56,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:26:56,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:26:56,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:26:56,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:26:56,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:26:56,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:26:56,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:26:56,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:26:56,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:26:56,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:26:56,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:26:56,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:26:56,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:26:56,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:26:56,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:26:56,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:26:56,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:26:56,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:26:56,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:26:56,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:26:56,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:26:56,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:26:56,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:26:56,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:26:56,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:26:56,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:26:56,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:26:56,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:26:56,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:26:56,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:26:56,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:26:56,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:26:56,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:26:56,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:26:56,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:26:56,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:26:56,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:26:56,730 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:26:56,763 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:26:56,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:26:56,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:26:56,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:26:56,765 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:26:56,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:26:56,766 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:26:56,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:26:56,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:26:56,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:26:56,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:26:56,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:26:56,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:26:56,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:26:56,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:26:56,768 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:26:56,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:26:56,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:26:56,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:26:56,768 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:26:56,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:26:56,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:26:56,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:26:56,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:26:56,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:26:56,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:26:56,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:26:56,770 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:26:56,770 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:26:57,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:26:57,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:26:57,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:26:57,125 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:26:57,126 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:26:57,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2022-12-06 02:26:58,332 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:26:58,551 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:26:58,552 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2022-12-06 02:26:58,558 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a96d710c7/b4418d4ef65f46c9b0e5b1d1044c1ecd/FLAGd7aa2da6d [2022-12-06 02:26:58,569 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a96d710c7/b4418d4ef65f46c9b0e5b1d1044c1ecd [2022-12-06 02:26:58,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:26:58,573 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:26:58,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:26:58,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:26:58,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:26:58,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:26:58" (1/1) ... [2022-12-06 02:26:58,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211f80aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58, skipping insertion in model container [2022-12-06 02:26:58,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:26:58" (1/1) ... [2022-12-06 02:26:58,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:26:58,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:26:58,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,750 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2022-12-06 02:26:58,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:26:58,773 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:26:58,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:58,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:58,812 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2022-12-06 02:26:58,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:26:58,832 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:26:58,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58 WrapperNode [2022-12-06 02:26:58,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:26:58,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:26:58,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:26:58,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:26:58,839 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:26:58" (1/1) ... [2022-12-06 02:26:58,846 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:26:58" (1/1) ... [2022-12-06 02:26:58,878 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 336 [2022-12-06 02:26:58,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:26:58,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:26:58,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:26:58,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:26:58,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58" (1/1) ... [2022-12-06 02:26:58,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58" (1/1) ... [2022-12-06 02:26:58,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58" (1/1) ... [2022-12-06 02:26:58,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58" (1/1) ... [2022-12-06 02:26:58,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58" (1/1) ... [2022-12-06 02:26:58,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58" (1/1) ... [2022-12-06 02:26:58,931 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58" (1/1) ... [2022-12-06 02:26:58,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58" (1/1) ... [2022-12-06 02:26:58,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:26:58,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:26:58,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:26:58,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:26:58,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58" (1/1) ... [2022-12-06 02:26:58,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:26:58,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:26:58,977 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:26:58,983 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:26:59,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:26:59,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:26:59,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:26:59,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:26:59,007 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:26:59,008 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:26:59,008 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:26:59,008 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:26:59,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:26:59,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:26:59,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:26:59,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:26:59,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:26:59,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:26:59,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:26:59,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:26:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:26:59,011 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:26:59,113 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:26:59,127 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:26:59,585 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:26:59,769 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:26:59,770 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 02:26:59,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:26:59 BoogieIcfgContainer [2022-12-06 02:26:59,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:26:59,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:26:59,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:26:59,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:26:59,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:26:58" (1/3) ... [2022-12-06 02:26:59,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a9c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:26:59, skipping insertion in model container [2022-12-06 02:26:59,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:58" (2/3) ... [2022-12-06 02:26:59,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a9c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:26:59, skipping insertion in model container [2022-12-06 02:26:59,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:26:59" (3/3) ... [2022-12-06 02:26:59,783 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2022-12-06 02:26:59,800 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:26:59,800 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:26:59,800 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:26:59,886 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 02:26:59,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 253 transitions, 530 flow [2022-12-06 02:27:00,055 INFO L130 PetriNetUnfolder]: 27/250 cut-off events. [2022-12-06 02:27:00,055 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:27:00,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 27/250 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 176 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 211. Up to 6 conditions per place. [2022-12-06 02:27:00,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 253 transitions, 530 flow [2022-12-06 02:27:00,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 240 transitions, 498 flow [2022-12-06 02:27:00,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:00,100 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 240 transitions, 498 flow [2022-12-06 02:27:00,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 240 transitions, 498 flow [2022-12-06 02:27:00,162 INFO L130 PetriNetUnfolder]: 27/240 cut-off events. [2022-12-06 02:27:00,163 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:27:00,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 240 events. 27/240 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 176 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 211. Up to 6 conditions per place. [2022-12-06 02:27:00,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 240 transitions, 498 flow [2022-12-06 02:27:00,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 2442 [2022-12-06 02:27:10,703 INFO L203 LiptonReduction]: Total number of compositions: 210 [2022-12-06 02:27:10,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:27:10,732 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;@58c94223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:27:10,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 02:27:10,745 INFO L130 PetriNetUnfolder]: 6/24 cut-off events. [2022-12-06 02:27:10,745 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:27:10,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:10,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:10,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:27:10,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:10,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1929606784, now seen corresponding path program 1 times [2022-12-06 02:27:10,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:10,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132190073] [2022-12-06 02:27:10,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:10,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:11,235 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:27:11,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:11,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132190073] [2022-12-06 02:27:11,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132190073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:11,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:11,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:27:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23633075] [2022-12-06 02:27:11,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:11,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:27:11,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:27:11,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:27:11,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 02:27:11,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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:27:11,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:11,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 02:27:11,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:11,391 INFO L130 PetriNetUnfolder]: 164/251 cut-off events. [2022-12-06 02:27:11,391 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-06 02:27:11,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 251 events. 164/251 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 607 event pairs, 37 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 376. Up to 167 conditions per place. [2022-12-06 02:27:11,395 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 36 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2022-12-06 02:27:11,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 197 flow [2022-12-06 02:27:11,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:27:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:27:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 02:27:11,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 02:27:11,410 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-06 02:27:11,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:11,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 41 transitions, 197 flow [2022-12-06 02:27:11,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 41 transitions, 197 flow [2022-12-06 02:27:11,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:11,431 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:11,432 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 02:27:11,432 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 41 transitions, 197 flow [2022-12-06 02:27:11,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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:27:11,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:11,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:11,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:27:11,433 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:27:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:11,434 INFO L85 PathProgramCache]: Analyzing trace with hash 495866599, now seen corresponding path program 1 times [2022-12-06 02:27:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:11,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209900360] [2022-12-06 02:27:11,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:11,706 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:27:11,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:11,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209900360] [2022-12-06 02:27:11,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209900360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:11,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:11,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:27:11,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412653373] [2022-12-06 02:27:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:11,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:27:11,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:11,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:27:11,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:27:11,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 02:27:11,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 41 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:11,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:11,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 02:27:11,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:11,897 INFO L130 PetriNetUnfolder]: 299/473 cut-off events. [2022-12-06 02:27:11,897 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 02:27:11,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1505 conditions, 473 events. 299/473 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1495 event pairs, 74 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 552. Up to 305 conditions per place. [2022-12-06 02:27:11,904 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 72 selfloop transitions, 3 changer transitions 4/79 dead transitions. [2022-12-06 02:27:11,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 79 transitions, 540 flow [2022-12-06 02:27:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:27:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:27:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 02:27:11,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49 [2022-12-06 02:27:11,907 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2022-12-06 02:27:11,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:11,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 79 transitions, 540 flow [2022-12-06 02:27:11,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 79 transitions, 540 flow [2022-12-06 02:27:11,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:15,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:27:15,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3977 [2022-12-06 02:27:15,884 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 78 transitions, 534 flow [2022-12-06 02:27:15,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:15,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:15,885 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:15,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:27:15,885 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:27:15,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:15,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1602551179, now seen corresponding path program 1 times [2022-12-06 02:27:15,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:15,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624431588] [2022-12-06 02:27:15,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:15,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:16,091 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:27:16,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:16,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624431588] [2022-12-06 02:27:16,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624431588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:16,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:16,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:27:16,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928742508] [2022-12-06 02:27:16,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:16,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:27:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:16,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:27:16,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:27:16,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:27:16,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 78 transitions, 534 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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:27:16,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:16,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:27:16,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:16,334 INFO L130 PetriNetUnfolder]: 453/732 cut-off events. [2022-12-06 02:27:16,334 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-06 02:27:16,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 732 events. 453/732 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2823 event pairs, 74 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 1200. Up to 565 conditions per place. [2022-12-06 02:27:16,339 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 103 selfloop transitions, 7 changer transitions 7/117 dead transitions. [2022-12-06 02:27:16,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 117 transitions, 1035 flow [2022-12-06 02:27:16,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:27:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:27:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 02:27:16,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2022-12-06 02:27:16,343 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 02:27:16,344 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:16,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 117 transitions, 1035 flow [2022-12-06 02:27:16,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 117 transitions, 1035 flow [2022-12-06 02:27:16,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:16,352 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:16,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 02:27:16,354 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 117 transitions, 1035 flow [2022-12-06 02:27:16,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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:27:16,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:16,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:16,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:27:16,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:27:16,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:16,355 INFO L85 PathProgramCache]: Analyzing trace with hash -175243636, now seen corresponding path program 1 times [2022-12-06 02:27:16,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:16,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205621756] [2022-12-06 02:27:16,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:16,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:16,815 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:27:16,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:16,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205621756] [2022-12-06 02:27:16,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205621756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:16,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:16,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:27:16,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643547802] [2022-12-06 02:27:16,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:16,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:27:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:16,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:27:16,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:27:16,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:27:16,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 117 transitions, 1035 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:27:16,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:16,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:27:16,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:17,028 INFO L130 PetriNetUnfolder]: 351/618 cut-off events. [2022-12-06 02:27:17,028 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-06 02:27:17,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3203 conditions, 618 events. 351/618 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2331 event pairs, 148 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 1142. Up to 454 conditions per place. [2022-12-06 02:27:17,033 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 66 selfloop transitions, 9 changer transitions 41/116 dead transitions. [2022-12-06 02:27:17,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 116 transitions, 1259 flow [2022-12-06 02:27:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:27:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:27:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-06 02:27:17,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-06 02:27:17,036 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-06 02:27:17,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:17,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 116 transitions, 1259 flow [2022-12-06 02:27:17,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 116 transitions, 1259 flow [2022-12-06 02:27:17,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:17,043 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:17,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 02:27:17,052 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 116 transitions, 1259 flow [2022-12-06 02:27:17,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:27:17,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:17,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] [2022-12-06 02:27:17,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:27:17,053 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:27:17,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:17,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1538082875, now seen corresponding path program 1 times [2022-12-06 02:27:17,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:17,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436478438] [2022-12-06 02:27:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:17,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:17,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:17,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436478438] [2022-12-06 02:27:17,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436478438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:17,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402919879] [2022-12-06 02:27:17,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:17,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:17,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:17,303 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:27:17,333 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:27:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:17,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 02:27:17,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:17,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:17,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402919879] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:17,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:17,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2022-12-06 02:27:17,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330914078] [2022-12-06 02:27:17,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:17,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:27:17,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:17,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:27:17,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:27:17,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:27:17,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 116 transitions, 1259 flow. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:27:17,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:17,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:27:17,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:17,895 INFO L130 PetriNetUnfolder]: 399/695 cut-off events. [2022-12-06 02:27:17,895 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-06 02:27:17,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4291 conditions, 695 events. 399/695 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2711 event pairs, 148 based on Foata normal form. 1/546 useless extension candidates. Maximal degree in co-relation 1632. Up to 531 conditions per place. [2022-12-06 02:27:17,900 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 80 selfloop transitions, 5 changer transitions 42/127 dead transitions. [2022-12-06 02:27:17,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 127 transitions, 1632 flow [2022-12-06 02:27:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:27:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:27:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 02:27:17,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 02:27:17,904 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2022-12-06 02:27:17,905 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:17,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 127 transitions, 1632 flow [2022-12-06 02:27:17,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 127 transitions, 1632 flow [2022-12-06 02:27:17,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:17,911 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:17,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:27:17,913 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 127 transitions, 1632 flow [2022-12-06 02:27:17,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:27:17,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:17,914 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:17,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 02:27:18,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:18,121 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:27:18,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash 436198136, now seen corresponding path program 2 times [2022-12-06 02:27:18,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:18,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579512789] [2022-12-06 02:27:18,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:18,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:18,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:18,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579512789] [2022-12-06 02:27:18,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579512789] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:18,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524885205] [2022-12-06 02:27:18,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:27:18,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:18,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:18,461 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:27:18,494 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:27:18,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:27:18,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:18,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:27:18,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:18,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:19,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:27:19,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 292 treesize of output 302 [2022-12-06 02:27:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:19,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524885205] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:19,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:19,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2022-12-06 02:27:19,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112185045] [2022-12-06 02:27:19,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:19,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:27:19,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:19,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:27:19,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:27:19,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:27:19,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 127 transitions, 1632 flow. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 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:27:19,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:19,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:27:19,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:19,896 INFO L130 PetriNetUnfolder]: 639/1166 cut-off events. [2022-12-06 02:27:19,896 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-12-06 02:27:19,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8382 conditions, 1166 events. 639/1166 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5611 event pairs, 296 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 1962. Up to 842 conditions per place. [2022-12-06 02:27:19,904 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 93 selfloop transitions, 12 changer transitions 109/214 dead transitions. [2022-12-06 02:27:19,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 214 transitions, 3194 flow [2022-12-06 02:27:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 02:27:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 02:27:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2022-12-06 02:27:19,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35664335664335667 [2022-12-06 02:27:19,910 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2022-12-06 02:27:19,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:19,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 214 transitions, 3194 flow [2022-12-06 02:27:19,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 214 transitions, 3194 flow [2022-12-06 02:27:19,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:33,029 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 02:27:33,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13120 [2022-12-06 02:27:33,030 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 211 transitions, 3152 flow [2022-12-06 02:27:33,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 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:27:33,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:33,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:33,042 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:27:33,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 02:27:33,239 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:27:33,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:33,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2129952403, now seen corresponding path program 1 times [2022-12-06 02:27:33,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:33,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893567415] [2022-12-06 02:27:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:33,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:34,045 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:27:34,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:34,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893567415] [2022-12-06 02:27:34,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893567415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:34,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334063216] [2022-12-06 02:27:34,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:34,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:34,048 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:27:34,056 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:27:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:34,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:27:34,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:34,355 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:27:34,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:34,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:27:34,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 379 treesize of output 491 [2022-12-06 02:27:39,264 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:27:39,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334063216] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:39,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:39,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 02:27:39,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769570855] [2022-12-06 02:27:39,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:39,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:27:39,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:39,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:27:39,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:27:39,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 02:27:39,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 211 transitions, 3152 flow. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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:27:39,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:39,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 02:27:39,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:40,234 INFO L130 PetriNetUnfolder]: 1273/2249 cut-off events. [2022-12-06 02:27:40,234 INFO L131 PetriNetUnfolder]: For 302/302 co-relation queries the response was YES. [2022-12-06 02:27:40,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18374 conditions, 2249 events. 1273/2249 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12204 event pairs, 481 based on Foata normal form. 6/1815 useless extension candidates. Maximal degree in co-relation 2788. Up to 1845 conditions per place. [2022-12-06 02:27:40,250 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 183 selfloop transitions, 36 changer transitions 177/396 dead transitions. [2022-12-06 02:27:40,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 396 transitions, 6696 flow [2022-12-06 02:27:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:27:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:27:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 155 transitions. [2022-12-06 02:27:40,253 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41114058355437666 [2022-12-06 02:27:40,253 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2022-12-06 02:27:40,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:40,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 396 transitions, 6696 flow [2022-12-06 02:27:40,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 396 transitions, 6696 flow [2022-12-06 02:27:40,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:57,031 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 02:27:57,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16779 [2022-12-06 02:27:57,032 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 394 transitions, 6664 flow [2022-12-06 02:27:57,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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:27:57,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:57,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] [2022-12-06 02:27:57,037 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:27:57,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:57,233 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:27:57,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash 104162307, now seen corresponding path program 1 times [2022-12-06 02:27:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:57,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830816820] [2022-12-06 02:27:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:27:57,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:57,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830816820] [2022-12-06 02:27:57,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830816820] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:57,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683401575] [2022-12-06 02:27:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:57,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:57,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:57,555 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:27:57,581 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:27:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:57,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:27:57,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:27:57,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:27:57,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683401575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:57,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:27:57,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-06 02:27:57,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426512346] [2022-12-06 02:27:57,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:57,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:27:57,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:57,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:27:57,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:27:57,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:27:57,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 394 transitions, 6664 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:57,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:57,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:27:57,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:58,452 INFO L130 PetriNetUnfolder]: 1737/3061 cut-off events. [2022-12-06 02:27:58,452 INFO L131 PetriNetUnfolder]: For 449/449 co-relation queries the response was YES. [2022-12-06 02:27:58,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28016 conditions, 3061 events. 1737/3061 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17893 event pairs, 481 based on Foata normal form. 0/2469 useless extension candidates. Maximal degree in co-relation 3134. Up to 2657 conditions per place. [2022-12-06 02:27:58,476 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 281 selfloop transitions, 17 changer transitions 222/520 dead transitions. [2022-12-06 02:27:58,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 520 transitions, 9828 flow [2022-12-06 02:27:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:27:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:27:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 02:27:58,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3212121212121212 [2022-12-06 02:27:58,479 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 36 predicate places. [2022-12-06 02:27:58,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:58,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 520 transitions, 9828 flow [2022-12-06 02:27:58,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 520 transitions, 9828 flow [2022-12-06 02:27:58,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:58,510 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:58,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 02:27:58,512 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 520 transitions, 9828 flow [2022-12-06 02:27:58,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:58,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:58,512 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:58,519 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:27:58,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:58,719 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:27:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash 208709575, now seen corresponding path program 1 times [2022-12-06 02:27:58,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:58,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370344182] [2022-12-06 02:27:58,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:58,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:27:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:59,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370344182] [2022-12-06 02:27:59,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370344182] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:59,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789654019] [2022-12-06 02:27:59,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:59,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:59,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:59,131 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:27:59,134 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:27:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:59,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:27:59,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:27:59,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:59,849 INFO L321 Elim1Store]: treesize reduction 38, result has 78.5 percent of original size [2022-12-06 02:27:59,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 634 treesize of output 692 [2022-12-06 02:28:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:00,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789654019] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:00,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:00,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 02:28:00,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007617034] [2022-12-06 02:28:00,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:00,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:28:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:00,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:28:00,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:28:00,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:28:00,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 520 transitions, 9828 flow. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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:28:00,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:00,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:28:00,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:01,629 INFO L130 PetriNetUnfolder]: 1674/2975 cut-off events. [2022-12-06 02:28:01,629 INFO L131 PetriNetUnfolder]: For 464/464 co-relation queries the response was YES. [2022-12-06 02:28:01,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30211 conditions, 2975 events. 1674/2975 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17367 event pairs, 481 based on Foata normal form. 0/2420 useless extension candidates. Maximal degree in co-relation 3480. Up to 2569 conditions per place. [2022-12-06 02:28:01,648 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 230 selfloop transitions, 33 changer transitions 253/516 dead transitions. [2022-12-06 02:28:01,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 516 transitions, 10779 flow [2022-12-06 02:28:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:28:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:28:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2022-12-06 02:28:01,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 02:28:01,651 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 50 predicate places. [2022-12-06 02:28:01,653 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:01,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 516 transitions, 10779 flow [2022-12-06 02:28:01,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 516 transitions, 10779 flow [2022-12-06 02:28:01,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:01,686 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:01,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 02:28:01,687 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 516 transitions, 10779 flow [2022-12-06 02:28:01,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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:28:01,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:01,687 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:01,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:01,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:01,900 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:01,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:01,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1848806403, now seen corresponding path program 1 times [2022-12-06 02:28:01,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:01,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159698474] [2022-12-06 02:28:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:01,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:03,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:03,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159698474] [2022-12-06 02:28:03,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159698474] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:03,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646037141] [2022-12-06 02:28:03,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:03,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:03,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:03,129 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:28:03,131 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:28:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:03,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:28:03,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:03,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:04,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:04,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 438 treesize of output 617 [2022-12-06 02:28:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:10,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646037141] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:10,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:10,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 02:28:10,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499956273] [2022-12-06 02:28:10,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:10,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:28:10,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:10,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:28:10,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:28:10,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:28:10,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 516 transitions, 10779 flow. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:28:10,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:10,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:28:10,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:12,501 INFO L130 PetriNetUnfolder]: 2461/4258 cut-off events. [2022-12-06 02:28:12,502 INFO L131 PetriNetUnfolder]: For 601/601 co-relation queries the response was YES. [2022-12-06 02:28:12,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47440 conditions, 4258 events. 2461/4258 cut-off events. For 601/601 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 25791 event pairs, 555 based on Foata normal form. 7/3359 useless extension candidates. Maximal degree in co-relation 8602. Up to 3852 conditions per place. [2022-12-06 02:28:12,525 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 330 selfloop transitions, 64 changer transitions 317/711 dead transitions. [2022-12-06 02:28:12,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 711 transitions, 16263 flow [2022-12-06 02:28:12,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:28:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:28:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 181 transitions. [2022-12-06 02:28:12,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3917748917748918 [2022-12-06 02:28:12,528 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 63 predicate places. [2022-12-06 02:28:12,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:12,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 711 transitions, 16263 flow [2022-12-06 02:28:12,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 711 transitions, 16263 flow [2022-12-06 02:28:12,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:12,563 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:12,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 02:28:12,564 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 711 transitions, 16263 flow [2022-12-06 02:28:12,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:28:12,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:12,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:12,573 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:28:12,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:12,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:12,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:12,771 INFO L85 PathProgramCache]: Analyzing trace with hash 375949918, now seen corresponding path program 1 times [2022-12-06 02:28:12,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:12,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396100197] [2022-12-06 02:28:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:12,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:13,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:13,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396100197] [2022-12-06 02:28:13,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396100197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:13,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078033548] [2022-12-06 02:28:13,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:13,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:13,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:13,123 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:28:13,126 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:28:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:13,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:28:13,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:28:13,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:13,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:13,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 589 treesize of output 624 [2022-12-06 02:28:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:28:14,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078033548] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:14,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:14,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-06 02:28:14,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344078849] [2022-12-06 02:28:14,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:14,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 02:28:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 02:28:14,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:28:14,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:28:14,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 711 transitions, 16263 flow. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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:28:14,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:14,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:28:14,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:15,521 INFO L130 PetriNetUnfolder]: 2311/4079 cut-off events. [2022-12-06 02:28:15,522 INFO L131 PetriNetUnfolder]: For 621/621 co-relation queries the response was YES. [2022-12-06 02:28:15,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49544 conditions, 4079 events. 2311/4079 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 25002 event pairs, 555 based on Foata normal form. 0/3297 useless extension candidates. Maximal degree in co-relation 6488. Up to 3673 conditions per place. [2022-12-06 02:28:15,545 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 340 selfloop transitions, 26 changer transitions 325/691 dead transitions. [2022-12-06 02:28:15,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 691 transitions, 17196 flow [2022-12-06 02:28:15,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:28:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:28:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 02:28:15,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 02:28:15,549 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2022-12-06 02:28:15,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:15,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 691 transitions, 17196 flow [2022-12-06 02:28:15,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 691 transitions, 17196 flow [2022-12-06 02:28:15,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:15,590 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:15,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 02:28:15,590 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 691 transitions, 17196 flow [2022-12-06 02:28:15,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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:28:15,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:15,591 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:15,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:15,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:15,796 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:15,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1625505403, now seen corresponding path program 1 times [2022-12-06 02:28:15,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:15,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732241862] [2022-12-06 02:28:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:15,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:16,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:16,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732241862] [2022-12-06 02:28:16,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732241862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:16,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269391548] [2022-12-06 02:28:16,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:16,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:16,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:16,169 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:28:16,171 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:28:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:16,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:28:16,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:16,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:17,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:17,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 557 treesize of output 648 [2022-12-06 02:28:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:19,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269391548] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:19,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:19,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 02:28:19,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564582147] [2022-12-06 02:28:19,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:19,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:28:19,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:19,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:28:19,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:28:19,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:28:19,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 691 transitions, 17196 flow. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 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:28:19,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:19,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:28:19,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:21,150 INFO L130 PetriNetUnfolder]: 2823/5111 cut-off events. [2022-12-06 02:28:21,151 INFO L131 PetriNetUnfolder]: For 758/758 co-relation queries the response was YES. [2022-12-06 02:28:21,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67229 conditions, 5111 events. 2823/5111 cut-off events. For 758/758 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 33688 event pairs, 764 based on Foata normal form. 0/4267 useless extension candidates. Maximal degree in co-relation 7494. Up to 4543 conditions per place. [2022-12-06 02:28:21,204 INFO L137 encePairwiseOnDemand]: 17/33 looper letters, 315 selfloop transitions, 36 changer transitions 532/883 dead transitions. [2022-12-06 02:28:21,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 883 transitions, 23759 flow [2022-12-06 02:28:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:28:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:28:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2022-12-06 02:28:21,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28484848484848485 [2022-12-06 02:28:21,206 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2022-12-06 02:28:21,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:21,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 883 transitions, 23759 flow [2022-12-06 02:28:21,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 883 transitions, 23759 flow [2022-12-06 02:28:21,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:33,099 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 02:28:33,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11893 [2022-12-06 02:28:33,100 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 881 transitions, 23707 flow [2022-12-06 02:28:33,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 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:28:33,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:33,100 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:33,121 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:28:33,313 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,SelfDestructingSolverStorable11 [2022-12-06 02:28:33,313 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:33,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2051828662, now seen corresponding path program 2 times [2022-12-06 02:28:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:33,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600148079] [2022-12-06 02:28:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:34,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:34,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600148079] [2022-12-06 02:28:34,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600148079] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:34,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849566576] [2022-12-06 02:28:34,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:28:34,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:34,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:34,611 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:28:34,614 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:28:34,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:28:34,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:34,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 02:28:34,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:34,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:28:34,794 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 22 treesize of output 20 [2022-12-06 02:28:34,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 02:28:34,906 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:28:34,976 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:28:35,041 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:28:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:35,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:42,103 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (= c_~node_state~0 0))) (let ((.cse3 (<= c_~node_size~0 c_~node_front~0)) (.cse4 (<= c_~node_back~0 c_~node_front~0)) (.cse23 (not .cse5)) (.cse2 (< c_~node_front~0 0)) (.cse17 (+ (* c_~node_back~0 4) c_~node~0.offset)) (.cse21 (= c_~node_state~0 1))) (let ((.cse0 (= c_~manager_state~0 1)) (.cse10 (or .cse21 .cse5)) (.cse7 (= 3 c_~manager_state~0)) (.cse9 (or .cse23 .cse2 (<= (+ c_~node_back~0 1) c_~node_front~0) (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_714 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_714) c_~node~0.base))) (= (select .cse24 (+ (* c_~node_front~0 4) c_~node~0.offset)) (select .cse24 .cse17)))))) (.cse8 (not (< c_~node_back~0 c_~node_size~0))) (.cse1 (= c_~manager_state~0 0)) (.cse13 (not (<= 0 c_~node_back~0))) (.cse12 (not .cse21)) (.cse14 (or .cse23 .cse2 .cse3 .cse4)) (.cse6 (= 2 c_~manager_state~0))) (and (or .cse0 .cse1 (and (or .cse2 .cse3 .cse4) .cse5) .cse6 .cse7) (or .cse8 (and .cse9 .cse10 (or (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (~manager_back~0 Int) (v_~manager_front~0_163 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_163) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_714) c_~manager~0.base))) (= (select .cse11 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse11 (+ ~manager~0.offset (* v_~manager_front~0_163 4))))) (< v_~manager_front~0_163 0))) .cse12)) (not .cse0) .cse13) (or (and .cse14 (or (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (~manager_back~0 Int) (v_~client_back~0_152 Int) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (<= 1 v_~client_back~0_152)) (< ~manager_back~0 1) (not (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_714))) (= (select (select .cse15 c_~client~0.base) (+ (- 4) ~client~0.offset (* v_~client_back~0_152 4))) (select (select .cse15 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))))) .cse12) .cse10) (not .cse7)) (or (and .cse9 (or (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_~manager_front~0_163 Int) (~manager~0.offset Int)) (or (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_714))) (= (select (select .cse16 c_~manager~0.base) (+ ~manager~0.offset (* v_~manager_front~0_163 4) (- 4))) (select (select .cse16 c_~node~0.base) .cse17))) (< v_~manager_front~0_163 1))) .cse5)) .cse8 (not .cse1) .cse13) (or (and (or (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (~manager_back~0 Int) (v_~client_back~0_152 Int) (v_~manager_front~0_163 Int) (~client~0.offset Int) (~manager~0.offset Int)) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_714))) (let ((.cse19 (select .cse20 c_~manager~0.base)) (.cse18 (select (select .cse20 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_152 4))))) (or (not (<= 0 v_~client_back~0_152)) (<= (+ ~manager_back~0 1) v_~manager_front~0_163) (not (= .cse18 (select .cse19 (+ ~manager~0.offset (* ~manager_back~0 4))))) (= (select .cse19 (+ ~manager~0.offset (* v_~manager_front~0_163 4) (- 4))) .cse18) (< v_~manager_front~0_163 1))))) .cse12) .cse14 (or .cse21 (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_~client_back~0_152 Int) (v_~manager_front~0_163 Int) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (<= 0 v_~client_back~0_152)) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_714))) (= (select (select .cse22 c_~manager~0.base) (+ ~manager~0.offset (* v_~manager_front~0_163 4) (- 4))) (select (select .cse22 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_152 4))))) (< v_~manager_front~0_163 1))) .cse5)) (not .cse6)))))) is different from false [2022-12-06 02:28:44,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:44,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 52 [2022-12-06 02:28:44,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:44,748 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 28150 treesize of output 25995 [2022-12-06 02:28:44,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:44,822 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 25974 treesize of output 19336 [2022-12-06 02:28:44,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:44,891 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 19318 treesize of output 16008 [2022-12-06 02:28:44,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:44,958 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 15990 treesize of output 14344 [2022-12-06 02:28:46,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:46,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2022-12-06 02:28:46,206 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-12-06 02:28:46,206 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 1686 treesize of output 1566 [2022-12-06 02:28:46,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:46,226 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 1550 treesize of output 1151 [2022-12-06 02:28:46,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:46,244 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 1134 treesize of output 943 [2022-12-06 02:28:46,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:46,261 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 926 treesize of output 839 [2022-12-06 02:28:47,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:47,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-12-06 02:28:47,759 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 02:28:47,759 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 1622 treesize of output 1501 [2022-12-06 02:28:47,780 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:28:47,780 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 1494 treesize of output 1398 [2022-12-06 02:28:47,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:28:47,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 699 treesize of output 507 [2022-12-06 02:28:47,831 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:28:47,831 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 1206 treesize of output 822 [2022-12-06 02:28:48,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:48,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-12-06 02:28:48,202 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:28:48,205 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 806 treesize of output 742 [2022-12-06 02:28:48,217 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:28:48,217 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 742 treesize of output 550 [2022-12-06 02:28:48,229 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:28:48,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 550 treesize of output 454 [2022-12-06 02:28:48,242 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:28:48,246 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 454 treesize of output 406 [2022-12-06 02:28:48,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:48,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-12-06 02:28:48,331 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 02:28:48,331 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 1622 treesize of output 1501 [2022-12-06 02:28:48,349 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:28:48,349 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 1494 treesize of output 1110 [2022-12-06 02:28:48,364 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:28:48,364 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 1110 treesize of output 918 [2022-12-06 02:28:48,375 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:28:48,376 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 918 treesize of output 822 [2022-12-06 02:28:48,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:48,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2022-12-06 02:28:48,630 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-12-06 02:28:48,631 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 27126 treesize of output 24966 [2022-12-06 02:28:48,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:48,708 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 24950 treesize of output 23303 [2022-12-06 02:28:48,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:48,804 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 23286 treesize of output 19975 [2022-12-06 02:28:48,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:48,894 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 19958 treesize of output 13319 Received shutdown request... [2022-12-06 02:40:54,065 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-12-06 02:40:54,067 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 02:40:54,071 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:40:54,071 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:40:54,072 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:40:54,267 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,SelfDestructingSolverStorable12 [2022-12-06 02:40:54,268 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-12-06 02:40:54,269 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 02:40:54,270 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 02:40:54,270 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 02:40:54,270 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:54,272 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:40:54,272 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:40:54,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:40:54 BasicIcfg [2022-12-06 02:40:54,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:40:54,275 INFO L158 Benchmark]: Toolchain (without parser) took 835702.31ms. Allocated memory was 201.3MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 177.5MB in the beginning and 568.2MB in the end (delta: -390.7MB). Peak memory consumption was 815.4MB. Max. memory is 8.0GB. [2022-12-06 02:40:54,275 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory was 177.6MB in the beginning and 177.5MB in the end (delta: 86.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:40:54,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.62ms. Allocated memory is still 201.3MB. Free memory was 177.5MB in the beginning and 162.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 02:40:54,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.77ms. Allocated memory is still 201.3MB. Free memory was 162.8MB in the beginning and 159.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 02:40:54,278 INFO L158 Benchmark]: Boogie Preprocessor took 56.62ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 157.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:40:54,278 INFO L158 Benchmark]: RCFGBuilder took 837.62ms. Allocated memory is still 201.3MB. Free memory was 157.6MB in the beginning and 110.9MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-12-06 02:40:54,279 INFO L158 Benchmark]: TraceAbstraction took 834497.98ms. Allocated memory was 201.3MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 110.4MB in the beginning and 568.2MB in the end (delta: -457.8MB). Peak memory consumption was 748.3MB. Max. memory is 8.0GB. [2022-12-06 02:40:54,281 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 201.3MB. Free memory was 177.6MB in the beginning and 177.5MB in the end (delta: 86.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.62ms. Allocated memory is still 201.3MB. Free memory was 177.5MB in the beginning and 162.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.77ms. Allocated memory is still 201.3MB. Free memory was 162.8MB in the beginning and 159.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.62ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 157.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 837.62ms. Allocated memory is still 201.3MB. Free memory was 157.6MB in the beginning and 110.9MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 834497.98ms. Allocated memory was 201.3MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 110.4MB in the beginning and 568.2MB in the end (delta: -457.8MB). Peak memory consumption was 748.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.5s, 223 PlacesBefore, 29 PlacesAfterwards, 240 TransitionsBefore, 25 TransitionsAfterwards, 2442 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 154 TrivialYvCompositions, 40 ConcurrentYvCompositions, 16 ChoiceCompositions, 210 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1539, independent: 1539, independent conditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1164, independent: 1164, independent conditional: 0, independent unconditional: 1164, 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: 1164, independent: 1164, independent conditional: 0, independent unconditional: 1164, 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: 1539, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1164, unknown conditional: 0, unknown unconditional: 1164] , Statistics on independence cache: Total cache size (in pairs): 2182, Positive cache size: 2182, Positive conditional cache size: 0, Positive unconditional cache size: 2182, 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, 31 PlacesBefore, 31 PlacesAfterwards, 41 TransitionsBefore, 41 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: 4.0s, 34 PlacesBefore, 33 PlacesAfterwards, 79 TransitionsBefore, 78 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, 36 PlacesBefore, 36 PlacesAfterwards, 117 TransitionsBefore, 117 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, 41 PlacesBefore, 41 PlacesAfterwards, 116 TransitionsBefore, 116 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, 44 PlacesBefore, 44 PlacesAfterwards, 127 TransitionsBefore, 127 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: 13.1s, 54 PlacesBefore, 51 PlacesAfterwards, 214 TransitionsBefore, 211 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.8s, 63 PlacesBefore, 61 PlacesAfterwards, 396 TransitionsBefore, 394 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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, 65 PlacesBefore, 65 PlacesAfterwards, 520 TransitionsBefore, 520 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, 79 PlacesBefore, 79 PlacesAfterwards, 516 TransitionsBefore, 516 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, 92 PlacesBefore, 92 PlacesAfterwards, 711 TransitionsBefore, 711 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, 93 PlacesBefore, 93 PlacesAfterwards, 691 TransitionsBefore, 691 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: 11.8s, 105 PlacesBefore, 103 PlacesAfterwards, 883 TransitionsBefore, 881 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 162]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 155]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 264 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 834.3s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1497 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1497 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2067 IncrementalHoareTripleChecker+Invalid, 2319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 0 mSDtfsCounter, 2067 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23759occurred in iteration=12, InterpolantAutomatonStates: 99, 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.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 405 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 522 ConstructedInterpolants, 11 QuantifiedInterpolants, 9873 SizeOfPredicates, 313 NumberOfNonLiveVariables, 2344 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 40/78 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