/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/triangular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:31:53,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:31:53,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:31:53,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:31:53,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:31:53,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:31:53,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:31:53,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:31:53,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:31:53,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:31:53,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:31:53,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:31:53,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:31:53,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:31:53,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:31:53,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:31:53,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:31:53,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:31:53,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:31:53,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:31:53,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:31:53,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:31:53,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:31:53,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:31:53,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:31:53,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:31:53,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:31:53,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:31:53,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:31:53,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:31:53,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:31:53,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:31:53,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:31:53,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:31:53,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:31:53,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:31:53,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:31:53,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:31:53,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:31:53,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:31:53,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:31:53,606 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-13 00:31:53,642 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:31:53,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:31:53,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:31:53,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:31:53,645 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:31:53,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:31:53,646 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:31:53,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:31:53,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:31:53,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:31:53,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:31:53,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:31:53,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:31:53,648 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:31:53,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:31:53,648 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:31:53,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:31:53,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:31:53,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:31:53,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:31:53,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:31:53,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:31:53,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:31:53,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:31:53,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:31:53,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:31:53,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:31:53,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:31:53,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:31:54,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:31:54,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:31:54,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:31:54,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:31:54,082 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:31:54,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2022-12-13 00:31:55,391 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:31:55,669 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:31:55,670 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2022-12-13 00:31:55,685 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3fcbd419/8a7613ebf529401f8e5abb14f7bac91a/FLAG38bdfddb7 [2022-12-13 00:31:55,700 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3fcbd419/8a7613ebf529401f8e5abb14f7bac91a [2022-12-13 00:31:55,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:31:55,704 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:31:55,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:31:55,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:31:55,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:31:55,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:31:55" (1/1) ... [2022-12-13 00:31:55,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62416ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:55, skipping insertion in model container [2022-12-13 00:31:55,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:31:55" (1/1) ... [2022-12-13 00:31:55,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:31:55,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:31:56,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:31:56,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:31:56,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:31:56,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:31:56,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:31:56,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:31:56,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:31:56,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:31:56,141 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i[30952,30965] [2022-12-13 00:31:56,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:31:56,154 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:31:56,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:31:56,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:31:56,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:31:56,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:31:56,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:31:56,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:31:56,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:31:56,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:31:56,213 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i[30952,30965] [2022-12-13 00:31:56,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:31:56,258 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:31:56,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56 WrapperNode [2022-12-13 00:31:56,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:31:56,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:31:56,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:31:56,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:31:56,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (1/1) ... [2022-12-13 00:31:56,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (1/1) ... [2022-12-13 00:31:56,323 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-12-13 00:31:56,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:31:56,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:31:56,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:31:56,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:31:56,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (1/1) ... [2022-12-13 00:31:56,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (1/1) ... [2022-12-13 00:31:56,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (1/1) ... [2022-12-13 00:31:56,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (1/1) ... [2022-12-13 00:31:56,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (1/1) ... [2022-12-13 00:31:56,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (1/1) ... [2022-12-13 00:31:56,363 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (1/1) ... [2022-12-13 00:31:56,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (1/1) ... [2022-12-13 00:31:56,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:31:56,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:31:56,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:31:56,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:31:56,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (1/1) ... [2022-12-13 00:31:56,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:31:56,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:31:56,409 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-13 00:31:56,447 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-13 00:31:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 00:31:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 00:31:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 00:31:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 00:31:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:31:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:31:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:31:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:31:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:31:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:31:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:31:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:31:56,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:31:56,465 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:31:56,637 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:31:56,656 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:31:56,822 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:31:56,826 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:31:56,831 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 00:31:56,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:31:56 BoogieIcfgContainer [2022-12-13 00:31:56,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:31:56,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:31:56,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:31:56,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:31:56,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:31:55" (1/3) ... [2022-12-13 00:31:56,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c81d0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:31:56, skipping insertion in model container [2022-12-13 00:31:56,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:56" (2/3) ... [2022-12-13 00:31:56,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c81d0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:31:56, skipping insertion in model container [2022-12-13 00:31:56,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:31:56" (3/3) ... [2022-12-13 00:31:56,847 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2022-12-13 00:31:56,864 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:31:56,864 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:31:56,865 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:31:56,904 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:31:56,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 66 transitions, 142 flow [2022-12-13 00:31:56,988 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-13 00:31:56,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:31:56,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-13 00:31:56,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 66 transitions, 142 flow [2022-12-13 00:31:56,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 64 transitions, 134 flow [2022-12-13 00:31:56,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:57,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-13 00:31:57,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 134 flow [2022-12-13 00:31:57,056 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-13 00:31:57,057 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:31:57,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-13 00:31:57,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-13 00:31:57,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-13 00:31:59,596 INFO L241 LiptonReduction]: Total number of compositions: 51 [2022-12-13 00:31:59,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:31:59,619 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;@6d94ed87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:31:59,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 00:31:59,625 INFO L130 PetriNetUnfolder]: 2/25 cut-off events. [2022-12-13 00:31:59,625 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:31:59,627 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:59,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 00:31:59,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:31:59,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1005742466, now seen corresponding path program 1 times [2022-12-13 00:31:59,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:59,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230947315] [2022-12-13 00:31:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:59,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:00,116 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-13 00:32:00,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:00,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230947315] [2022-12-13 00:32:00,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230947315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:00,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:00,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:32:00,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737237136] [2022-12-13 00:32:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:00,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:32:00,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:00,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:32:00,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:32:00,152 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:32:00,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-13 00:32:00,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:00,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:32:00,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:00,389 INFO L130 PetriNetUnfolder]: 681/1079 cut-off events. [2022-12-13 00:32:00,389 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 00:32:00,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2143 conditions, 1079 events. 681/1079 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5102 event pairs, 66 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 2133. Up to 713 conditions per place. [2022-12-13 00:32:00,397 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 38 selfloop transitions, 10 changer transitions 8/60 dead transitions. [2022-12-13 00:32:00,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 60 transitions, 238 flow [2022-12-13 00:32:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:32:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:32:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-13 00:32:00,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2022-12-13 00:32:00,409 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 60 flow. Second operand 4 states and 73 transitions. [2022-12-13 00:32:00,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 60 transitions, 238 flow [2022-12-13 00:32:00,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:32:00,414 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 117 flow [2022-12-13 00:32:00,416 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2022-12-13 00:32:00,419 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-12-13 00:32:00,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:00,420 INFO L89 Accepts]: Start accepts. Operand has 35 places, 35 transitions, 117 flow [2022-12-13 00:32:00,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:00,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:00,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 35 transitions, 117 flow [2022-12-13 00:32:00,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 35 transitions, 117 flow [2022-12-13 00:32:00,428 INFO L130 PetriNetUnfolder]: 13/53 cut-off events. [2022-12-13 00:32:00,429 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:32:00,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 53 events. 13/53 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 164 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 87. Up to 17 conditions per place. [2022-12-13 00:32:00,432 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 35 transitions, 117 flow [2022-12-13 00:32:00,432 INFO L226 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-13 00:32:00,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [220] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (<= 16 v_~i~0_30) 1 0)) InVars {~i~0=v_~i~0_30} OutVars{~i~0=v_~i~0_30, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [181] L704-5-->L707: Formula: (and (< v_t2Thread1of1ForFork1_~k~1_15 5) (= (+ v_~i~0_5 1) v_~j~0_5)) InVars {~i~0=v_~i~0_5, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_15} OutVars{~j~0=v_~j~0_5, ~i~0=v_~i~0_5, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_15} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:32:00,486 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [220] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (<= 16 v_~i~0_30) 1 0)) InVars {~i~0=v_~i~0_30} OutVars{~i~0=v_~i~0_30, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [210] L704-5-->L704-3: Formula: (and (< v_t2Thread1of1ForFork1_~k~1_31 5) (= (+ v_~i~0_20 1) v_~j~0_26) (= v_t2Thread1of1ForFork1_~k~1_31 |v_t2Thread1of1ForFork1_#t~post4_15|)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_31} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4] [2022-12-13 00:32:00,515 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [220] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (<= 16 v_~i~0_30) 1 0)) InVars {~i~0=v_~i~0_30} OutVars{~i~0=v_~i~0_30, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-4: Formula: (and (= (+ |v_t2Thread1of1ForFork1_#t~post4_17| 1) v_t2Thread1of1ForFork1_~k~1_33) (< v_t2Thread1of1ForFork1_~k~1_34 5) (= v_t2Thread1of1ForFork1_~k~1_34 |v_t2Thread1of1ForFork1_#t~post4_17|) (= v_~j~0_28 (+ v_~i~0_22 1))) InVars {~i~0=v_~i~0_22, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_28, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_17|, ~i~0=v_~i~0_22, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-13 00:32:00,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [220] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (<= 16 v_~i~0_30) 1 0)) InVars {~i~0=v_~i~0_30} OutVars{~i~0=v_~i~0_30, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [212] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_37 (+ v_t2Thread1of1ForFork1_~k~1_38 1)) (< v_t2Thread1of1ForFork1_~k~1_38 5) (= v_~j~0_30 (+ v_~i~0_24 1))) InVars {~i~0=v_~i~0_24, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_38} OutVars{~j~0=v_~j~0_30, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_19|, ~i~0=v_~i~0_24, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_37} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-13 00:32:00,601 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:32:00,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-13 00:32:00,608 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 35 transitions, 133 flow [2022-12-13 00:32:00,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-13 00:32:00,611 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:00,611 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:00,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:32:00,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:32:00,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1113282763, now seen corresponding path program 1 times [2022-12-13 00:32:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:00,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215754902] [2022-12-13 00:32:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:00,755 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-13 00:32:00,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:00,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215754902] [2022-12-13 00:32:00,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215754902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:00,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:00,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:32:00,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273576241] [2022-12-13 00:32:00,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:00,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:32:00,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:00,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:32:00,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:32:00,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-13 00:32:00,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 35 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:00,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:00,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-13 00:32:00,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:00,965 INFO L130 PetriNetUnfolder]: 901/1435 cut-off events. [2022-12-13 00:32:00,965 INFO L131 PetriNetUnfolder]: For 420/420 co-relation queries the response was YES. [2022-12-13 00:32:00,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3617 conditions, 1435 events. 901/1435 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 7600 event pairs, 241 based on Foata normal form. 84/679 useless extension candidates. Maximal degree in co-relation 3605. Up to 798 conditions per place. [2022-12-13 00:32:00,973 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 57 selfloop transitions, 14 changer transitions 17/92 dead transitions. [2022-12-13 00:32:00,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 92 transitions, 497 flow [2022-12-13 00:32:00,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:32:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:32:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-13 00:32:00,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:32:00,975 INFO L175 Difference]: Start difference. First operand has 34 places, 35 transitions, 133 flow. Second operand 5 states and 100 transitions. [2022-12-13 00:32:00,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 92 transitions, 497 flow [2022-12-13 00:32:00,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 92 transitions, 481 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-13 00:32:00,978 INFO L231 Difference]: Finished difference. Result has 41 places, 47 transitions, 241 flow [2022-12-13 00:32:00,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=41, PETRI_TRANSITIONS=47} [2022-12-13 00:32:00,979 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-13 00:32:00,979 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:00,979 INFO L89 Accepts]: Start accepts. Operand has 41 places, 47 transitions, 241 flow [2022-12-13 00:32:00,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:00,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:00,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 47 transitions, 241 flow [2022-12-13 00:32:00,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 47 transitions, 241 flow [2022-12-13 00:32:00,998 INFO L130 PetriNetUnfolder]: 125/253 cut-off events. [2022-12-13 00:32:00,999 INFO L131 PetriNetUnfolder]: For 100/128 co-relation queries the response was YES. [2022-12-13 00:32:01,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 253 events. 125/253 cut-off events. For 100/128 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1149 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 706. Up to 105 conditions per place. [2022-12-13 00:32:01,003 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 47 transitions, 241 flow [2022-12-13 00:32:01,004 INFO L226 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-13 00:32:01,011 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:32:01,013 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 00:32:01,014 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 47 transitions, 241 flow [2022-12-13 00:32:01,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:01,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:01,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:01,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:32:01,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:32:01,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash -152054754, now seen corresponding path program 1 times [2022-12-13 00:32:01,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:01,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382876526] [2022-12-13 00:32:01,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:01,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:01,145 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-13 00:32:01,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:01,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382876526] [2022-12-13 00:32:01,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382876526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:01,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:01,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:32:01,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773116729] [2022-12-13 00:32:01,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:01,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:32:01,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:01,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:32:01,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:32:01,153 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-13 00:32:01,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 47 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:01,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:01,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-13 00:32:01,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:01,408 INFO L130 PetriNetUnfolder]: 819/1365 cut-off events. [2022-12-13 00:32:01,409 INFO L131 PetriNetUnfolder]: For 956/956 co-relation queries the response was YES. [2022-12-13 00:32:01,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4318 conditions, 1365 events. 819/1365 cut-off events. For 956/956 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 7458 event pairs, 108 based on Foata normal form. 84/698 useless extension candidates. Maximal degree in co-relation 4301. Up to 652 conditions per place. [2022-12-13 00:32:01,417 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 50 selfloop transitions, 33 changer transitions 33/120 dead transitions. [2022-12-13 00:32:01,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 120 transitions, 757 flow [2022-12-13 00:32:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:32:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:32:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2022-12-13 00:32:01,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-13 00:32:01,422 INFO L175 Difference]: Start difference. First operand has 40 places, 47 transitions, 241 flow. Second operand 7 states and 134 transitions. [2022-12-13 00:32:01,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 120 transitions, 757 flow [2022-12-13 00:32:01,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 120 transitions, 730 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 00:32:01,434 INFO L231 Difference]: Finished difference. Result has 48 places, 66 transitions, 448 flow [2022-12-13 00:32:01,434 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=448, PETRI_PLACES=48, PETRI_TRANSITIONS=66} [2022-12-13 00:32:01,436 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2022-12-13 00:32:01,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:01,436 INFO L89 Accepts]: Start accepts. Operand has 48 places, 66 transitions, 448 flow [2022-12-13 00:32:01,437 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:01,437 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:01,437 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 66 transitions, 448 flow [2022-12-13 00:32:01,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 66 transitions, 448 flow [2022-12-13 00:32:01,497 INFO L130 PetriNetUnfolder]: 162/297 cut-off events. [2022-12-13 00:32:01,498 INFO L131 PetriNetUnfolder]: For 258/258 co-relation queries the response was YES. [2022-12-13 00:32:01,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 297 events. 162/297 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 1350 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 1006. Up to 117 conditions per place. [2022-12-13 00:32:01,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 66 transitions, 448 flow [2022-12-13 00:32:01,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 788 [2022-12-13 00:32:01,545 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:32:01,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 00:32:01,547 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 66 transitions, 448 flow [2022-12-13 00:32:01,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:01,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:01,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:01,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:32:01,548 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:32:01,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:01,548 INFO L85 PathProgramCache]: Analyzing trace with hash -163887203, now seen corresponding path program 1 times [2022-12-13 00:32:01,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:01,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918491918] [2022-12-13 00:32:01,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:01,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:01,664 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-13 00:32:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:01,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918491918] [2022-12-13 00:32:01,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918491918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:01,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:01,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:32:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156487827] [2022-12-13 00:32:01,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:01,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:32:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:01,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:32:01,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:32:01,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-13 00:32:01,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 66 transitions, 448 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:01,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:01,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-13 00:32:01,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:01,905 INFO L130 PetriNetUnfolder]: 1137/1916 cut-off events. [2022-12-13 00:32:01,905 INFO L131 PetriNetUnfolder]: For 2893/2893 co-relation queries the response was YES. [2022-12-13 00:32:01,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6970 conditions, 1916 events. 1137/1916 cut-off events. For 2893/2893 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 11097 event pairs, 207 based on Foata normal form. 98/1001 useless extension candidates. Maximal degree in co-relation 6949. Up to 922 conditions per place. [2022-12-13 00:32:01,919 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 63 selfloop transitions, 32 changer transitions 23/122 dead transitions. [2022-12-13 00:32:01,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 122 transitions, 950 flow [2022-12-13 00:32:01,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:32:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:32:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-13 00:32:01,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2022-12-13 00:32:01,921 INFO L175 Difference]: Start difference. First operand has 49 places, 66 transitions, 448 flow. Second operand 6 states and 112 transitions. [2022-12-13 00:32:01,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 122 transitions, 950 flow [2022-12-13 00:32:01,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 122 transitions, 922 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-12-13 00:32:01,939 INFO L231 Difference]: Finished difference. Result has 57 places, 70 transitions, 569 flow [2022-12-13 00:32:01,940 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=57, PETRI_TRANSITIONS=70} [2022-12-13 00:32:01,941 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2022-12-13 00:32:01,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:01,941 INFO L89 Accepts]: Start accepts. Operand has 57 places, 70 transitions, 569 flow [2022-12-13 00:32:01,944 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:01,944 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:01,944 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 70 transitions, 569 flow [2022-12-13 00:32:01,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 70 transitions, 569 flow [2022-12-13 00:32:01,981 INFO L130 PetriNetUnfolder]: 222/484 cut-off events. [2022-12-13 00:32:01,981 INFO L131 PetriNetUnfolder]: For 966/966 co-relation queries the response was YES. [2022-12-13 00:32:01,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 484 events. 222/484 cut-off events. For 966/966 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 2958 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 2035. Up to 191 conditions per place. [2022-12-13 00:32:02,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 70 transitions, 569 flow [2022-12-13 00:32:02,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 846 [2022-12-13 00:32:02,007 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:32:02,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 00:32:02,014 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 70 transitions, 569 flow [2022-12-13 00:32:02,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:02,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:02,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:02,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:32:02,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:32:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash -737182882, now seen corresponding path program 1 times [2022-12-13 00:32:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:02,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185562667] [2022-12-13 00:32:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:02,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:02,127 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-13 00:32:02,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:02,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185562667] [2022-12-13 00:32:02,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185562667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:02,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:02,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:32:02,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191332254] [2022-12-13 00:32:02,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:02,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:32:02,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:02,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:32:02,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:32:02,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:32:02,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 70 transitions, 569 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-13 00:32:02,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:02,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:32:02,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:02,385 INFO L130 PetriNetUnfolder]: 917/1595 cut-off events. [2022-12-13 00:32:02,386 INFO L131 PetriNetUnfolder]: For 4364/4364 co-relation queries the response was YES. [2022-12-13 00:32:02,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6671 conditions, 1595 events. 917/1595 cut-off events. For 4364/4364 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 9407 event pairs, 129 based on Foata normal form. 98/849 useless extension candidates. Maximal degree in co-relation 6645. Up to 703 conditions per place. [2022-12-13 00:32:02,396 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 49 selfloop transitions, 41 changer transitions 27/121 dead transitions. [2022-12-13 00:32:02,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 121 transitions, 1103 flow [2022-12-13 00:32:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:32:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:32:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-13 00:32:02,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:32:02,397 INFO L175 Difference]: Start difference. First operand has 56 places, 70 transitions, 569 flow. Second operand 6 states and 108 transitions. [2022-12-13 00:32:02,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 121 transitions, 1103 flow [2022-12-13 00:32:02,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 121 transitions, 1018 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-13 00:32:02,427 INFO L231 Difference]: Finished difference. Result has 59 places, 76 transitions, 699 flow [2022-12-13 00:32:02,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=699, PETRI_PLACES=59, PETRI_TRANSITIONS=76} [2022-12-13 00:32:02,430 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2022-12-13 00:32:02,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:02,430 INFO L89 Accepts]: Start accepts. Operand has 59 places, 76 transitions, 699 flow [2022-12-13 00:32:02,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:02,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:02,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 76 transitions, 699 flow [2022-12-13 00:32:02,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 76 transitions, 699 flow [2022-12-13 00:32:02,463 INFO L130 PetriNetUnfolder]: 219/497 cut-off events. [2022-12-13 00:32:02,463 INFO L131 PetriNetUnfolder]: For 748/748 co-relation queries the response was YES. [2022-12-13 00:32:02,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 497 events. 219/497 cut-off events. For 748/748 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 3161 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 2174. Up to 166 conditions per place. [2022-12-13 00:32:02,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 76 transitions, 699 flow [2022-12-13 00:32:02,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-13 00:32:02,471 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:32:02,472 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 00:32:02,472 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 76 transitions, 699 flow [2022-12-13 00:32:02,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-13 00:32:02,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:02,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:02,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:32:02,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:32:02,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:02,474 INFO L85 PathProgramCache]: Analyzing trace with hash -784203899, now seen corresponding path program 1 times [2022-12-13 00:32:02,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:02,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755097681] [2022-12-13 00:32:02,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:02,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:02,575 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-13 00:32:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:02,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755097681] [2022-12-13 00:32:02,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755097681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:02,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:02,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:32:02,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442169717] [2022-12-13 00:32:02,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:02,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:32:02,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:02,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:32:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:32:02,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:32:02,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 76 transitions, 699 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-13 00:32:02,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:02,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:32:02,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:02,876 INFO L130 PetriNetUnfolder]: 994/1777 cut-off events. [2022-12-13 00:32:02,877 INFO L131 PetriNetUnfolder]: For 5854/5854 co-relation queries the response was YES. [2022-12-13 00:32:02,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8035 conditions, 1777 events. 994/1777 cut-off events. For 5854/5854 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 11236 event pairs, 283 based on Foata normal form. 98/926 useless extension candidates. Maximal degree in co-relation 8008. Up to 1291 conditions per place. [2022-12-13 00:32:02,890 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 72 selfloop transitions, 17 changer transitions 39/132 dead transitions. [2022-12-13 00:32:02,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 132 transitions, 1273 flow [2022-12-13 00:32:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:32:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:32:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2022-12-13 00:32:02,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6455026455026455 [2022-12-13 00:32:02,892 INFO L175 Difference]: Start difference. First operand has 59 places, 76 transitions, 699 flow. Second operand 7 states and 122 transitions. [2022-12-13 00:32:02,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 132 transitions, 1273 flow [2022-12-13 00:32:02,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 132 transitions, 1160 flow, removed 42 selfloop flow, removed 2 redundant places. [2022-12-13 00:32:02,914 INFO L231 Difference]: Finished difference. Result has 65 places, 78 transitions, 690 flow [2022-12-13 00:32:02,914 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=690, PETRI_PLACES=65, PETRI_TRANSITIONS=78} [2022-12-13 00:32:02,915 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2022-12-13 00:32:02,915 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:02,915 INFO L89 Accepts]: Start accepts. Operand has 65 places, 78 transitions, 690 flow [2022-12-13 00:32:02,916 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:02,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:02,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 78 transitions, 690 flow [2022-12-13 00:32:02,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 78 transitions, 690 flow [2022-12-13 00:32:02,959 INFO L130 PetriNetUnfolder]: 232/558 cut-off events. [2022-12-13 00:32:02,959 INFO L131 PetriNetUnfolder]: For 1158/1158 co-relation queries the response was YES. [2022-12-13 00:32:02,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2375 conditions, 558 events. 232/558 cut-off events. For 1158/1158 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 3650 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 2349. Up to 178 conditions per place. [2022-12-13 00:32:02,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 78 transitions, 690 flow [2022-12-13 00:32:02,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 920 [2022-12-13 00:32:02,967 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:32:02,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 00:32:02,968 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 78 transitions, 690 flow [2022-12-13 00:32:02,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-13 00:32:02,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:02,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:02,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:32:02,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:32:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1448716263, now seen corresponding path program 1 times [2022-12-13 00:32:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:02,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445628048] [2022-12-13 00:32:02,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:02,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:03,081 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-13 00:32:03,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:03,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445628048] [2022-12-13 00:32:03,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445628048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:03,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594077089] [2022-12-13 00:32:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:03,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:03,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:03,095 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-13 00:32:03,152 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-13 00:32:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:03,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 00:32:03,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:03,317 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-13 00:32:03,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:32:03,411 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-13 00:32:03,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594077089] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:32:03,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:32:03,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 00:32:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669457023] [2022-12-13 00:32:03,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:32:03,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 00:32:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:03,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 00:32:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-13 00:32:03,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:32:03,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 78 transitions, 690 flow. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-13 00:32:03,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:03,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:32:03,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:04,024 INFO L130 PetriNetUnfolder]: 1647/2945 cut-off events. [2022-12-13 00:32:04,025 INFO L131 PetriNetUnfolder]: For 9940/9940 co-relation queries the response was YES. [2022-12-13 00:32:04,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13098 conditions, 2945 events. 1647/2945 cut-off events. For 9940/9940 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 19159 event pairs, 108 based on Foata normal form. 196/1625 useless extension candidates. Maximal degree in co-relation 13069. Up to 785 conditions per place. [2022-12-13 00:32:04,042 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 48 selfloop transitions, 50 changer transitions 132/234 dead transitions. [2022-12-13 00:32:04,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 234 transitions, 2280 flow [2022-12-13 00:32:04,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 00:32:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 00:32:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 240 transitions. [2022-12-13 00:32:04,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6837606837606838 [2022-12-13 00:32:04,044 INFO L175 Difference]: Start difference. First operand has 65 places, 78 transitions, 690 flow. Second operand 13 states and 240 transitions. [2022-12-13 00:32:04,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 234 transitions, 2280 flow [2022-12-13 00:32:04,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 234 transitions, 2139 flow, removed 58 selfloop flow, removed 4 redundant places. [2022-12-13 00:32:04,082 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 898 flow [2022-12-13 00:32:04,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=898, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2022-12-13 00:32:04,083 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 00:32:04,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:04,083 INFO L89 Accepts]: Start accepts. Operand has 78 places, 81 transitions, 898 flow [2022-12-13 00:32:04,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:04,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:04,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 81 transitions, 898 flow [2022-12-13 00:32:04,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 81 transitions, 898 flow [2022-12-13 00:32:04,118 INFO L130 PetriNetUnfolder]: 158/480 cut-off events. [2022-12-13 00:32:04,118 INFO L131 PetriNetUnfolder]: For 1988/1988 co-relation queries the response was YES. [2022-12-13 00:32:04,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2232 conditions, 480 events. 158/480 cut-off events. For 1988/1988 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3225 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 2201. Up to 157 conditions per place. [2022-12-13 00:32:04,125 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 81 transitions, 898 flow [2022-12-13 00:32:04,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 952 [2022-12-13 00:32:04,169 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:32:04,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 00:32:04,170 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 864 flow [2022-12-13 00:32:04,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-13 00:32:04,170 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:04,170 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:04,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 00:32:04,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:04,379 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:32:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1862433850, now seen corresponding path program 1 times [2022-12-13 00:32:04,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:04,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149563387] [2022-12-13 00:32:04,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:04,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:04,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149563387] [2022-12-13 00:32:04,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149563387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:04,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737000146] [2022-12-13 00:32:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:04,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:04,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:04,584 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-13 00:32:04,600 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-13 00:32:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:04,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 00:32:04,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:04,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:32:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:04,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737000146] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:32:04,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:32:04,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 00:32:04,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014615309] [2022-12-13 00:32:04,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:32:04,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 00:32:04,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:04,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 00:32:04,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-13 00:32:04,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:32:04,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 864 flow. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-13 00:32:04,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:04,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:32:04,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:05,621 INFO L130 PetriNetUnfolder]: 1664/3302 cut-off events. [2022-12-13 00:32:05,622 INFO L131 PetriNetUnfolder]: For 29467/29467 co-relation queries the response was YES. [2022-12-13 00:32:05,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15925 conditions, 3302 events. 1664/3302 cut-off events. For 29467/29467 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 23202 event pairs, 505 based on Foata normal form. 392/1950 useless extension candidates. Maximal degree in co-relation 15891. Up to 1754 conditions per place. [2022-12-13 00:32:05,645 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 76 selfloop transitions, 26 changer transitions 139/245 dead transitions. [2022-12-13 00:32:05,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 245 transitions, 2736 flow [2022-12-13 00:32:05,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 00:32:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 00:32:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 260 transitions. [2022-12-13 00:32:05,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2022-12-13 00:32:05,648 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 864 flow. Second operand 15 states and 260 transitions. [2022-12-13 00:32:05,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 245 transitions, 2736 flow [2022-12-13 00:32:05,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 245 transitions, 2217 flow, removed 244 selfloop flow, removed 6 redundant places. [2022-12-13 00:32:05,706 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 837 flow [2022-12-13 00:32:05,706 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=837, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2022-12-13 00:32:05,707 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 63 predicate places. [2022-12-13 00:32:05,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:05,707 INFO L89 Accepts]: Start accepts. Operand has 95 places, 81 transitions, 837 flow [2022-12-13 00:32:05,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:05,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:05,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 81 transitions, 837 flow [2022-12-13 00:32:05,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 81 transitions, 837 flow [2022-12-13 00:32:05,767 INFO L130 PetriNetUnfolder]: 187/779 cut-off events. [2022-12-13 00:32:05,767 INFO L131 PetriNetUnfolder]: For 4232/4232 co-relation queries the response was YES. [2022-12-13 00:32:05,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 779 events. 187/779 cut-off events. For 4232/4232 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5827 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 3968. Up to 197 conditions per place. [2022-12-13 00:32:05,785 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 81 transitions, 837 flow [2022-12-13 00:32:05,785 INFO L226 LiptonReduction]: Number of co-enabled transitions 848 [2022-12-13 00:32:05,793 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:32:05,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 00:32:05,794 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 837 flow [2022-12-13 00:32:05,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-13 00:32:05,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:05,795 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:05,807 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-13 00:32:06,002 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,SelfDestructingSolverStorable7 [2022-12-13 00:32:06,003 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:32:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2118647590, now seen corresponding path program 1 times [2022-12-13 00:32:06,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:06,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450251603] [2022-12-13 00:32:06,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:06,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:06,154 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-13 00:32:06,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:06,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450251603] [2022-12-13 00:32:06,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450251603] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:06,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998271392] [2022-12-13 00:32:06,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:06,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:06,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:06,156 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-13 00:32:06,189 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-13 00:32:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:06,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 00:32:06,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:06,269 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-13 00:32:06,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:32:06,404 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-13 00:32:06,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998271392] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:32:06,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:32:06,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-13 00:32:06,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088960083] [2022-12-13 00:32:06,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:32:06,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 00:32:06,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:06,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 00:32:06,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-13 00:32:06,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:32:06,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 837 flow. Second operand has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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-13 00:32:06,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:06,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:32:06,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:07,014 INFO L130 PetriNetUnfolder]: 1491/3232 cut-off events. [2022-12-13 00:32:07,015 INFO L131 PetriNetUnfolder]: For 45899/45899 co-relation queries the response was YES. [2022-12-13 00:32:07,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17220 conditions, 3232 events. 1491/3232 cut-off events. For 45899/45899 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 24072 event pairs, 264 based on Foata normal form. 196/1694 useless extension candidates. Maximal degree in co-relation 17180. Up to 999 conditions per place. [2022-12-13 00:32:07,040 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 65 selfloop transitions, 44 changer transitions 114/227 dead transitions. [2022-12-13 00:32:07,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 227 transitions, 2724 flow [2022-12-13 00:32:07,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 00:32:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 00:32:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 226 transitions. [2022-12-13 00:32:07,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5978835978835979 [2022-12-13 00:32:07,042 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 837 flow. Second operand 14 states and 226 transitions. [2022-12-13 00:32:07,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 227 transitions, 2724 flow [2022-12-13 00:32:07,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 227 transitions, 2458 flow, removed 104 selfloop flow, removed 16 redundant places. [2022-12-13 00:32:07,155 INFO L231 Difference]: Finished difference. Result has 98 places, 94 transitions, 1045 flow [2022-12-13 00:32:07,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1045, PETRI_PLACES=98, PETRI_TRANSITIONS=94} [2022-12-13 00:32:07,156 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 66 predicate places. [2022-12-13 00:32:07,156 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:07,156 INFO L89 Accepts]: Start accepts. Operand has 98 places, 94 transitions, 1045 flow [2022-12-13 00:32:07,157 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:07,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:07,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 94 transitions, 1045 flow [2022-12-13 00:32:07,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 94 transitions, 1045 flow [2022-12-13 00:32:07,248 INFO L130 PetriNetUnfolder]: 234/1032 cut-off events. [2022-12-13 00:32:07,248 INFO L131 PetriNetUnfolder]: For 6731/6731 co-relation queries the response was YES. [2022-12-13 00:32:07,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5968 conditions, 1032 events. 234/1032 cut-off events. For 6731/6731 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8767 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 5929. Up to 219 conditions per place. [2022-12-13 00:32:07,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 94 transitions, 1045 flow [2022-12-13 00:32:07,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 928 [2022-12-13 00:32:07,310 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:32:07,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 00:32:07,311 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 1046 flow [2022-12-13 00:32:07,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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-13 00:32:07,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:07,312 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:07,322 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-13 00:32:07,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:07,518 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:32:07,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:07,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1836199222, now seen corresponding path program 1 times [2022-12-13 00:32:07,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:07,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996379865] [2022-12-13 00:32:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:07,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:07,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:07,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996379865] [2022-12-13 00:32:07,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996379865] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:07,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40910613] [2022-12-13 00:32:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:07,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:07,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:07,644 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-13 00:32:07,670 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-13 00:32:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:07,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 00:32:07,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:07,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:32:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:07,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40910613] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:32:07,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:32:07,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-13 00:32:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211319913] [2022-12-13 00:32:07,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:32:07,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:32:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:07,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:32:07,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:32:07,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:32:07,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 1046 flow. Second operand has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 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-13 00:32:07,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:07,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:32:07,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:09,085 INFO L130 PetriNetUnfolder]: 2563/5223 cut-off events. [2022-12-13 00:32:09,086 INFO L131 PetriNetUnfolder]: For 81962/81962 co-relation queries the response was YES. [2022-12-13 00:32:09,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32601 conditions, 5223 events. 2563/5223 cut-off events. For 81962/81962 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 41373 event pairs, 99 based on Foata normal form. 392/2735 useless extension candidates. Maximal degree in co-relation 32559. Up to 1219 conditions per place. [2022-12-13 00:32:09,132 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 71 selfloop transitions, 92 changer transitions 240/407 dead transitions. [2022-12-13 00:32:09,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 407 transitions, 5767 flow [2022-12-13 00:32:09,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 00:32:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 00:32:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 449 transitions. [2022-12-13 00:32:09,135 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6167582417582418 [2022-12-13 00:32:09,135 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 1046 flow. Second operand 26 states and 449 transitions. [2022-12-13 00:32:09,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 407 transitions, 5767 flow [2022-12-13 00:32:09,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 407 transitions, 5543 flow, removed 94 selfloop flow, removed 6 redundant places. [2022-12-13 00:32:09,409 INFO L231 Difference]: Finished difference. Result has 133 places, 123 transitions, 1969 flow [2022-12-13 00:32:09,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1969, PETRI_PLACES=133, PETRI_TRANSITIONS=123} [2022-12-13 00:32:09,411 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2022-12-13 00:32:09,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:09,412 INFO L89 Accepts]: Start accepts. Operand has 133 places, 123 transitions, 1969 flow [2022-12-13 00:32:09,417 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:09,417 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:09,417 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 123 transitions, 1969 flow [2022-12-13 00:32:09,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 123 transitions, 1969 flow [2022-12-13 00:32:09,604 INFO L130 PetriNetUnfolder]: 405/1643 cut-off events. [2022-12-13 00:32:09,604 INFO L131 PetriNetUnfolder]: For 24516/24516 co-relation queries the response was YES. [2022-12-13 00:32:09,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15147 conditions, 1643 events. 405/1643 cut-off events. For 24516/24516 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 15944 event pairs, 36 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 15092. Up to 437 conditions per place. [2022-12-13 00:32:09,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 123 transitions, 1969 flow [2022-12-13 00:32:09,646 INFO L226 LiptonReduction]: Number of co-enabled transitions 1272 [2022-12-13 00:32:09,832 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:32:09,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 421 [2022-12-13 00:32:09,833 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 120 transitions, 1951 flow [2022-12-13 00:32:09,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 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-13 00:32:09,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:09,834 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:09,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 00:32:10,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:10,042 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:32:10,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1152652338, now seen corresponding path program 1 times [2022-12-13 00:32:10,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:10,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731176136] [2022-12-13 00:32:10,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:32:10,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:32:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:32:10,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:32:10,123 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:32:10,124 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 00:32:10,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 00:32:10,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 00:32:10,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:32:10,126 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:10,133 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:32:10,134 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:32:10,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:32:10 BasicIcfg [2022-12-13 00:32:10,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:32:10,211 INFO L158 Benchmark]: Toolchain (without parser) took 14507.06ms. Allocated memory was 178.3MB in the beginning and 425.7MB in the end (delta: 247.5MB). Free memory was 152.7MB in the beginning and 155.7MB in the end (delta: -3.0MB). Peak memory consumption was 245.4MB. Max. memory is 8.0GB. [2022-12-13 00:32:10,211 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 178.3MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:32:10,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.77ms. Allocated memory is still 178.3MB. Free memory was 152.6MB in the beginning and 132.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 00:32:10,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.50ms. Allocated memory is still 178.3MB. Free memory was 132.1MB in the beginning and 130.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 00:32:10,211 INFO L158 Benchmark]: Boogie Preprocessor took 41.55ms. Allocated memory is still 178.3MB. Free memory was 130.5MB in the beginning and 129.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:32:10,212 INFO L158 Benchmark]: RCFGBuilder took 467.78ms. Allocated memory is still 178.3MB. Free memory was 129.0MB in the beginning and 115.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 00:32:10,212 INFO L158 Benchmark]: TraceAbstraction took 13368.12ms. Allocated memory was 178.3MB in the beginning and 425.7MB in the end (delta: 247.5MB). Free memory was 114.3MB in the beginning and 155.7MB in the end (delta: -41.4MB). Peak memory consumption was 206.6MB. Max. memory is 8.0GB. [2022-12-13 00:32:10,213 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.22ms. Allocated memory is still 178.3MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 554.77ms. Allocated memory is still 178.3MB. Free memory was 152.6MB in the beginning and 132.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.50ms. Allocated memory is still 178.3MB. Free memory was 132.1MB in the beginning and 130.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.55ms. Allocated memory is still 178.3MB. Free memory was 130.5MB in the beginning and 129.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 467.78ms. Allocated memory is still 178.3MB. Free memory was 129.0MB in the beginning and 115.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13368.12ms. Allocated memory was 178.3MB in the beginning and 425.7MB in the end (delta: 247.5MB). Free memory was 114.3MB in the beginning and 155.7MB in the end (delta: -41.4MB). Peak memory consumption was 206.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 66 PlacesBefore, 32 PlacesAfterwards, 64 TransitionsBefore, 27 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 30 ConcurrentYvCompositions, 3 ChoiceCompositions, 51 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1048, independent: 1025, independent conditional: 1025, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1048, independent: 1025, independent conditional: 0, independent unconditional: 1025, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1048, independent: 1025, independent conditional: 0, independent unconditional: 1025, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1048, independent: 1025, independent conditional: 0, independent unconditional: 1025, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 824, independent: 814, independent conditional: 0, independent unconditional: 814, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 824, independent: 814, independent conditional: 0, independent unconditional: 814, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1048, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 824, unknown conditional: 0, unknown unconditional: 824] , Statistics on independence cache: Total cache size (in pairs): 1517, Positive cache size: 1507, Positive conditional cache size: 0, Positive unconditional cache size: 1507, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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.2s, 34 PlacesBefore, 34 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 72, independent conditional: 64, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 72, independent conditional: 64, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 72, independent conditional: 64, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 52, independent conditional: 48, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 22, unknown conditional: 16, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 20, Positive conditional cache size: 16, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 20, Positive conditional cache size: 16, Positive unconditional cache size: 4, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 49 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 788 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 11, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 21, independent conditional: 11, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 11, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, independent: 11, independent conditional: 4, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 11, unknown conditional: 7, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 30, Positive conditional cache size: 23, Positive unconditional cache size: 7, Negative cache size: 4, Negative conditional cache size: 1, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 846 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 30, Positive conditional cache size: 23, Positive unconditional cache size: 7, Negative cache size: 4, Negative conditional cache size: 1, Negative unconditional cache size: 3, 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, 59 PlacesBefore, 59 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 30, Positive conditional cache size: 23, Positive unconditional cache size: 7, Negative cache size: 4, Negative conditional cache size: 1, Negative unconditional cache size: 3, 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, 78 TransitionsBefore, 78 TransitionsAfterwards, 920 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): 34, Positive cache size: 30, Positive conditional cache size: 23, Positive unconditional cache size: 7, Negative cache size: 4, Negative conditional cache size: 1, Negative unconditional cache size: 3, 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, 78 PlacesBefore, 79 PlacesAfterwards, 81 TransitionsBefore, 78 TransitionsAfterwards, 952 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 70, Positive conditional cache size: 63, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 3, Negative unconditional cache size: 3, 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, 94 PlacesBefore, 94 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 848 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 70, Positive conditional cache size: 63, Positive unconditional cache size: 7, Negative cache size: 9, Negative conditional cache size: 5, Negative unconditional cache size: 4, 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, 98 PlacesBefore, 98 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 928 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 79, Positive conditional cache size: 71, Positive unconditional cache size: 8, Negative cache size: 9, Negative conditional cache size: 5, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 133 PlacesBefore, 134 PlacesAfterwards, 123 TransitionsBefore, 120 TransitionsAfterwards, 1272 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 128, Positive conditional cache size: 119, Positive unconditional cache size: 9, Negative cache size: 9, Negative conditional cache size: 5, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=51, arg={0:0}, argc=51, argv={49:50}, argv={49:50}, i=3, id1={5:0}, id2={3:0}, j=6, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-2] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, argv={49:50}, i=3, id1={5:0}, id2={3:0}, j=6, k=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=-1] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 5 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L716] 0 int condI = i >= (2*5 +6); [L704] COND TRUE 0 k < 5 [L706] 0 j = i + 1 [L704] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 5 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 5 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4] [L719] 0 int condJ = j >= (2*5 +6); [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, argv={49:50}, condI=0, condJ=1, i=15, id1={5:0}, id2={3:0}, j=16, k=4, k=5] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 84 locations, 3 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: 13.2s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2154 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2154 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 547 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2263 IncrementalHoareTripleChecker+Invalid, 2810 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 547 mSolverCounterUnsat, 0 mSDtfsCounter, 2263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=10, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 819 SizeOfPredicates, 19 NumberOfNonLiveVariables, 548 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 9/54 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 proved your program to be incorrect! [2022-12-13 00:32:10,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...