/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:41:53,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:41:53,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:41:53,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:41:53,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:41:53,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:41:53,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:41:53,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:41:53,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:41:53,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:41:53,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:41:53,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:41:53,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:41:53,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:41:53,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:41:53,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:41:53,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:41:53,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:41:53,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:41:53,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:41:53,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:41:53,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:41:53,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:41:53,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:41:53,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:41:53,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:41:53,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:41:53,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:41:53,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:41:53,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:41:53,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:41:53,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:41:53,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:41:53,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:41:53,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:41:53,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:41:53,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:41:53,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:41:53,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:41:53,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:41:53,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:41:53,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 02:41:53,275 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:41:53,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:41:53,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:41:53,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:41:53,278 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:41:53,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:41:53,278 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:41:53,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:41:53,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:41:53,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:41:53,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:41:53,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:41:53,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:41:53,280 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:41:53,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:41:53,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:41:53,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:41:53,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:41:53,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:41:53,281 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:41:53,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:41:53,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:41:53,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:41:53,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:41:53,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:41:53,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:41:53,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:41:53,282 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:41:53,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:41:53,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:41:53,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:41:53,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:41:53,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:41:53,646 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:41:53,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2022-12-06 02:41:54,788 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:41:54,979 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:41:54,979 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2022-12-06 02:41:54,993 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7705733bf/d62dc31758ec40edb17531a4fb63112e/FLAG0dd41b616 [2022-12-06 02:41:55,353 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7705733bf/d62dc31758ec40edb17531a4fb63112e [2022-12-06 02:41:55,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:41:55,356 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:41:55,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:41:55,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:41:55,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:41:55,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f6346d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55, skipping insertion in model container [2022-12-06 02:41:55,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:41:55,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:41:55,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,507 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c[3271,3284] [2022-12-06 02:41:55,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:41:55,523 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:41:55,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:55,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:55,544 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c[3271,3284] [2022-12-06 02:41:55,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:41:55,556 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:41:55,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55 WrapperNode [2022-12-06 02:41:55,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:41:55,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:41:55,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:41:55,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:41:55,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,586 INFO L138 Inliner]: procedures = 27, calls = 75, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 174 [2022-12-06 02:41:55,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:41:55,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:41:55,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:41:55,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:41:55,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,630 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:41:55,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:41:55,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:41:55,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:41:55,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (1/1) ... [2022-12-06 02:41:55,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:41:55,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:55,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 02:41:55,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 02:41:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:41:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:41:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:41:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:41:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:41:55,716 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:41:55,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:41:55,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:41:55,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:41:55,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:41:55,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 02:41:55,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 02:41:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:41:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 02:41:55,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 02:41:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:41:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:41:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:41:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:41:55,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:41:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:41:55,721 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:41:55,861 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:41:55,863 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:41:56,158 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:41:56,267 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:41:56,268 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 02:41:56,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:41:56 BoogieIcfgContainer [2022-12-06 02:41:56,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:41:56,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:41:56,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:41:56,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:41:56,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:41:55" (1/3) ... [2022-12-06 02:41:56,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205fadd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:41:56, skipping insertion in model container [2022-12-06 02:41:56,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:55" (2/3) ... [2022-12-06 02:41:56,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205fadd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:41:56, skipping insertion in model container [2022-12-06 02:41:56,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:41:56" (3/3) ... [2022-12-06 02:41:56,283 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc-dec.wvr.c [2022-12-06 02:41:56,297 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:41:56,297 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:41:56,297 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:41:56,373 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2022-12-06 02:41:56,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 183 transitions, 406 flow [2022-12-06 02:41:56,498 INFO L130 PetriNetUnfolder]: 14/178 cut-off events. [2022-12-06 02:41:56,498 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 02:41:56,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 178 events. 14/178 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 131 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2022-12-06 02:41:56,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 183 transitions, 406 flow [2022-12-06 02:41:56,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 164 transitions, 358 flow [2022-12-06 02:41:56,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:56,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 164 transitions, 358 flow [2022-12-06 02:41:56,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 164 transitions, 358 flow [2022-12-06 02:41:56,641 INFO L130 PetriNetUnfolder]: 14/164 cut-off events. [2022-12-06 02:41:56,641 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 02:41:56,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 164 events. 14/164 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 130 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2022-12-06 02:41:56,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 164 transitions, 358 flow [2022-12-06 02:41:56,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 3806 [2022-12-06 02:42:06,429 INFO L203 LiptonReduction]: Total number of compositions: 126 [2022-12-06 02:42:06,452 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:42:06,457 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;@4f78b558, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:42:06,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 02:42:06,476 INFO L130 PetriNetUnfolder]: 5/37 cut-off events. [2022-12-06 02:42:06,476 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 02:42:06,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:06,477 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:06,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 02:42:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:06,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1329809375, now seen corresponding path program 1 times [2022-12-06 02:42:06,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:06,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189133687] [2022-12-06 02:42:06,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:06,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:06,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:06,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189133687] [2022-12-06 02:42:06,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189133687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:42:06,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:42:06,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:42:06,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625480177] [2022-12-06 02:42:06,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:42:06,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:42:06,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:06,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:42:06,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:42:06,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-06 02:42:06,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:06,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:06,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-06 02:42:06,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:07,629 INFO L130 PetriNetUnfolder]: 6110/7594 cut-off events. [2022-12-06 02:42:07,630 INFO L131 PetriNetUnfolder]: For 287/287 co-relation queries the response was YES. [2022-12-06 02:42:07,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15782 conditions, 7594 events. 6110/7594 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 30199 event pairs, 2980 based on Foata normal form. 0/5304 useless extension candidates. Maximal degree in co-relation 13404. Up to 6012 conditions per place. [2022-12-06 02:42:07,689 INFO L137 encePairwiseOnDemand]: 34/38 looper letters, 52 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-12-06 02:42:07,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 266 flow [2022-12-06 02:42:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:42:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:42:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 02:42:07,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-06 02:42:07,702 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2022-12-06 02:42:07,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:07,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 57 transitions, 266 flow [2022-12-06 02:42:07,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 57 transitions, 266 flow [2022-12-06 02:42:07,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 02:42:07,740 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:42:07,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 02:42:07,742 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 266 flow [2022-12-06 02:42:07,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:07,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:07,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:07,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:42:07,742 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 02:42:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash 200545949, now seen corresponding path program 1 times [2022-12-06 02:42:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:07,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616816370] [2022-12-06 02:42:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:42:07,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:07,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616816370] [2022-12-06 02:42:07,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616816370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:42:07,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:42:07,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:42:07,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036746053] [2022-12-06 02:42:07,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:42:07,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:42:07,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:07,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:42:07,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:42:07,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-06 02:42:07,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:07,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:07,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-06 02:42:07,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:08,630 INFO L130 PetriNetUnfolder]: 7646/9442 cut-off events. [2022-12-06 02:42:08,630 INFO L131 PetriNetUnfolder]: For 520/708 co-relation queries the response was YES. [2022-12-06 02:42:08,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29053 conditions, 9442 events. 7646/9442 cut-off events. For 520/708 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 38763 event pairs, 3057 based on Foata normal form. 3/6608 useless extension candidates. Maximal degree in co-relation 25548. Up to 7726 conditions per place. [2022-12-06 02:42:08,680 INFO L137 encePairwiseOnDemand]: 34/38 looper letters, 83 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2022-12-06 02:42:08,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 90 transitions, 595 flow [2022-12-06 02:42:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:42:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:42:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 02:42:08,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-06 02:42:08,682 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2022-12-06 02:42:08,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:08,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 90 transitions, 595 flow [2022-12-06 02:42:08,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 90 transitions, 595 flow [2022-12-06 02:42:08,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 02:42:08,726 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:42:08,727 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 02:42:08,727 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 90 transitions, 595 flow [2022-12-06 02:42:08,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:08,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:08,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:08,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:42:08,728 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 02:42:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash -462492978, now seen corresponding path program 1 times [2022-12-06 02:42:08,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:08,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404688414] [2022-12-06 02:42:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:42:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:08,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404688414] [2022-12-06 02:42:08,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404688414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:42:08,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:42:08,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:42:08,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464959994] [2022-12-06 02:42:08,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:42:08,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:42:08,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:08,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:42:08,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:42:08,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 02:42:08,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 90 transitions, 595 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:08,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:08,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 02:42:08,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:09,751 INFO L130 PetriNetUnfolder]: 9416/11784 cut-off events. [2022-12-06 02:42:09,751 INFO L131 PetriNetUnfolder]: For 4694/4925 co-relation queries the response was YES. [2022-12-06 02:42:09,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46952 conditions, 11784 events. 9416/11784 cut-off events. For 4694/4925 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 49384 event pairs, 2613 based on Foata normal form. 11/9000 useless extension candidates. Maximal degree in co-relation 41372. Up to 9190 conditions per place. [2022-12-06 02:42:09,829 INFO L137 encePairwiseOnDemand]: 34/38 looper letters, 145 selfloop transitions, 6 changer transitions 0/152 dead transitions. [2022-12-06 02:42:09,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 152 transitions, 1302 flow [2022-12-06 02:42:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:42:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:42:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 02:42:09,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4144736842105263 [2022-12-06 02:42:09,832 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2022-12-06 02:42:09,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:09,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 152 transitions, 1302 flow [2022-12-06 02:42:09,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 152 transitions, 1302 flow [2022-12-06 02:42:09,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 02:42:09,889 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:42:09,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 02:42:09,891 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 152 transitions, 1302 flow [2022-12-06 02:42:09,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:09,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:09,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:09,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:42:09,891 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 02:42:09,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:09,892 INFO L85 PathProgramCache]: Analyzing trace with hash 174833201, now seen corresponding path program 1 times [2022-12-06 02:42:09,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:09,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737118380] [2022-12-06 02:42:09,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:09,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:42:09,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:10,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737118380] [2022-12-06 02:42:10,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737118380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:42:10,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:42:10,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:42:10,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515046548] [2022-12-06 02:42:10,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:42:10,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:42:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:10,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:42:10,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:42:10,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 02:42:10,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 152 transitions, 1302 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:10,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:10,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 02:42:10,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:11,180 INFO L130 PetriNetUnfolder]: 12120/15187 cut-off events. [2022-12-06 02:42:11,181 INFO L131 PetriNetUnfolder]: For 23976/24150 co-relation queries the response was YES. [2022-12-06 02:42:11,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73978 conditions, 15187 events. 12120/15187 cut-off events. For 23976/24150 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 61511 event pairs, 2813 based on Foata normal form. 174/12724 useless extension candidates. Maximal degree in co-relation 65335. Up to 11595 conditions per place. [2022-12-06 02:42:11,259 INFO L137 encePairwiseOnDemand]: 34/38 looper letters, 247 selfloop transitions, 10 changer transitions 0/258 dead transitions. [2022-12-06 02:42:11,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 258 transitions, 2709 flow [2022-12-06 02:42:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:42:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:42:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 02:42:11,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4144736842105263 [2022-12-06 02:42:11,263 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2022-12-06 02:42:11,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:11,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 258 transitions, 2709 flow [2022-12-06 02:42:11,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 258 transitions, 2709 flow [2022-12-06 02:42:11,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-06 02:42:11,337 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:42:11,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 02:42:11,344 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 258 transitions, 2709 flow [2022-12-06 02:42:11,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:11,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:11,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:11,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:42:11,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 02:42:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash -660413667, now seen corresponding path program 1 times [2022-12-06 02:42:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:11,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398093100] [2022-12-06 02:42:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 02:42:11,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:11,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398093100] [2022-12-06 02:42:11,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398093100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:42:11,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:42:11,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:42:11,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138954118] [2022-12-06 02:42:11,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:42:11,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:42:11,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:11,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:42:11,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:42:11,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-06 02:42:11,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 258 transitions, 2709 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:11,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:11,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-06 02:42:11,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:12,644 INFO L130 PetriNetUnfolder]: 12120/15188 cut-off events. [2022-12-06 02:42:12,645 INFO L131 PetriNetUnfolder]: For 48807/48981 co-relation queries the response was YES. [2022-12-06 02:42:12,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88074 conditions, 15188 events. 12120/15188 cut-off events. For 48807/48981 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 61550 event pairs, 3165 based on Foata normal form. 174/12725 useless extension candidates. Maximal degree in co-relation 77800. Up to 14090 conditions per place. [2022-12-06 02:42:12,873 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 255 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2022-12-06 02:42:12,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 259 transitions, 3233 flow [2022-12-06 02:42:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:42:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:42:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 02:42:12,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38596491228070173 [2022-12-06 02:42:12,878 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2022-12-06 02:42:12,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:12,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 259 transitions, 3233 flow [2022-12-06 02:42:12,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 259 transitions, 3233 flow [2022-12-06 02:42:12,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-06 02:42:14,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:42:14,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2008 [2022-12-06 02:42:14,886 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 258 transitions, 3221 flow [2022-12-06 02:42:14,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:14,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:14,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:14,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:42:14,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 02:42:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1284598036, now seen corresponding path program 1 times [2022-12-06 02:42:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:14,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057210756] [2022-12-06 02:42:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:14,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:15,845 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-06 02:42:15,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:15,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057210756] [2022-12-06 02:42:15,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057210756] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:42:15,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261396608] [2022-12-06 02:42:15,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:15,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:42:15,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:42:15,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:42:15,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 02:42:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:16,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 02:42:16,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:42:16,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 02:42:16,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:42:16,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:42:16,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 02:42:16,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:42:16,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-12-06 02:42:16,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-06 02:42:16,393 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-06 02:42:16,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:42:16,646 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_282 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) (forall ((v_ArrVal_282 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse1) (< (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (< c_~min~0 (+ .cse1 3)))))) is different from false [2022-12-06 02:42:16,965 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (or (not (< c_~min~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_282 (Array Int Int))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1)))))))) (forall ((v_ArrVal_281 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse2) (forall ((v_ArrVal_282 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282) c_~A~0.base) c_~A~0.offset))) (or (<= .cse2 (+ .cse3 1)) (<= 2147483647 .cse3))))))))) is different from false [2022-12-06 02:42:16,987 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (<= 2147483647 .cse1))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282) c_~A~0.base) c_~A~0.offset))) (or (< .cse2 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (<= 2147483647 .cse3) (< .cse2 (+ 3 .cse3))))))) is different from false [2022-12-06 02:42:17,018 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280))) (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 (+ 3 .cse1)) (<= 2147483647 .cse1) (< .cse0 (+ (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse5 1)) (<= 2147483647 .cse5)))))) is different from false [2022-12-06 02:42:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:42:17,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261396608] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:42:17,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:42:17,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 28 [2022-12-06 02:42:17,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223786513] [2022-12-06 02:42:17,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:42:17,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 02:42:17,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:17,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 02:42:17,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=548, Unknown=10, NotChecked=204, Total=870 [2022-12-06 02:42:17,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-06 02:42:17,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 258 transitions, 3221 flow. Second operand has 30 states, 30 states have (on average 5.1) internal successors, (153), 30 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:17,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:17,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-06 02:42:17,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:47,803 INFO L130 PetriNetUnfolder]: 187521/236674 cut-off events. [2022-12-06 02:42:47,804 INFO L131 PetriNetUnfolder]: For 889929/891724 co-relation queries the response was YES. [2022-12-06 02:42:48,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598457 conditions, 236674 events. 187521/236674 cut-off events. For 889929/891724 co-relation queries the response was YES. Maximal size of possible extension queue 6487. Compared 1353806 event pairs, 2631 based on Foata normal form. 1822/184299 useless extension candidates. Maximal degree in co-relation 1584209. Up to 221501 conditions per place. [2022-12-06 02:42:49,418 INFO L137 encePairwiseOnDemand]: 18/38 looper letters, 2365 selfloop transitions, 1079 changer transitions 4004/7450 dead transitions. [2022-12-06 02:42:49,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 7450 transitions, 107682 flow [2022-12-06 02:42:49,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-12-06 02:42:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2022-12-06 02:42:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 2007 transitions. [2022-12-06 02:42:49,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5281578947368422 [2022-12-06 02:42:49,448 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 112 predicate places. [2022-12-06 02:42:49,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:49,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 7450 transitions, 107682 flow [2022-12-06 02:42:51,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 7450 transitions, 107682 flow [2022-12-06 02:42:51,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-06 02:42:51,180 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:42:51,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1733 [2022-12-06 02:42:51,182 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 7450 transitions, 107682 flow [2022-12-06 02:42:51,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.1) internal successors, (153), 30 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:51,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:51,182 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:51,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 02:42:51,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 02:42:51,393 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 02:42:51,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1605396820, now seen corresponding path program 2 times [2022-12-06 02:42:51,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:51,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879638105] [2022-12-06 02:42:51,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 02:42:51,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:51,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879638105] [2022-12-06 02:42:51,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879638105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:42:51,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:42:51,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:42:51,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776264557] [2022-12-06 02:42:51,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:42:51,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:42:51,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:51,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:42:51,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:42:51,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-06 02:42:51,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 7450 transitions, 107682 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:51,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:51,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-06 02:42:51,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:06,058 INFO L130 PetriNetUnfolder]: 225480/285976 cut-off events. [2022-12-06 02:46:06,058 INFO L131 PetriNetUnfolder]: For 1408088/1410328 co-relation queries the response was YES. [2022-12-06 02:46:06,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194672 conditions, 285976 events. 225480/285976 cut-off events. For 1408088/1410328 co-relation queries the response was YES. Maximal size of possible extension queue 8062. Compared 1689237 event pairs, 584 based on Foata normal form. 2267/220831 useless extension candidates. Maximal degree in co-relation 2174476. Up to 267225 conditions per place. [2022-12-06 02:46:07,940 INFO L137 encePairwiseOnDemand]: 34/38 looper letters, 2772 selfloop transitions, 53 changer transitions 12108/14935 dead transitions. [2022-12-06 02:46:07,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 14935 transitions, 244999 flow [2022-12-06 02:46:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:46:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:46:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-06 02:46:07,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5157894736842106 [2022-12-06 02:46:07,943 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 116 predicate places. [2022-12-06 02:46:07,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:07,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 14935 transitions, 244999 flow [2022-12-06 02:46:10,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 14935 transitions, 244999 flow [2022-12-06 02:46:10,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-06 02:46:10,355 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:46:10,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2412 [2022-12-06 02:46:10,355 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 14935 transitions, 244999 flow [2022-12-06 02:46:10,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:46:10,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:10,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:10,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 02:46:10,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 02:46:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:10,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1176200762, now seen corresponding path program 3 times [2022-12-06 02:46:10,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:10,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199384254] [2022-12-06 02:46:10,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:10,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:46:11,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:11,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199384254] [2022-12-06 02:46:11,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199384254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:46:11,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559233245] [2022-12-06 02:46:11,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:46:11,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:11,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:46:11,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:46:11,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 02:46:11,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:46:11,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:46:11,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 02:46:11,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:46:11,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:11,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 02:46:11,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-06 02:46:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:46:12,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:46:12,170 WARN L837 $PredicateComparison]: unable to prove that (or (= c_~b1~0 (* 256 (div c_~b1~0 256))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_412) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse0)) (< 2147483646 .cse0))))) is different from false [2022-12-06 02:46:16,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2022-12-06 02:46:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-12-06 02:46:16,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559233245] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:46:16,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:46:16,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2022-12-06 02:46:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531465521] [2022-12-06 02:46:16,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:46:16,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:46:16,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:46:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:46:16,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=401, Unknown=6, NotChecked=42, Total=552 [2022-12-06 02:46:16,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-06 02:46:16,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 14935 transitions, 244999 flow. Second operand has 24 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:46:16,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:46:16,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-06 02:46:16,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:54:33,204 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:54:33,205 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:54:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-06 02:54:33,888 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 02:54:33,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 02:54:34,094 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-06 02:54:34,094 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 2/38 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 2765361 conditions, 320718 events (259315/320717 cut-off events. For 2884830/2889050 co-relation queries the response was YES. Maximal size of possible extension queue 31063. Compared 2023750 event pairs, 1757 based on Foata normal form. 4220/283239 useless extension candidates. Maximal degree in co-relation 2758921. Up to 298661 conditions per place.). [2022-12-06 02:54:34,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-06 02:54:34,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 02:54:34,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 02:54:34,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 02:54:34,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2022-12-06 02:54:34,096 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-12-06 02:54:34,099 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:54:34,099 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:54:34,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:54:34 BasicIcfg [2022-12-06 02:54:34,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:54:34,101 INFO L158 Benchmark]: Toolchain (without parser) took 758744.82ms. Allocated memory was 233.8MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 209.7MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 6.8GB. Max. memory is 8.0GB. [2022-12-06 02:54:34,101 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 233.8MB. Free memory was 209.7MB in the beginning and 209.6MB in the end (delta: 83.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:54:34,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.77ms. Allocated memory is still 233.8MB. Free memory was 209.2MB in the beginning and 195.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 02:54:34,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.23ms. Allocated memory is still 233.8MB. Free memory was 195.0MB in the beginning and 192.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:54:34,110 INFO L158 Benchmark]: Boogie Preprocessor took 46.58ms. Allocated memory is still 233.8MB. Free memory was 192.9MB in the beginning and 191.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 02:54:34,110 INFO L158 Benchmark]: RCFGBuilder took 635.55ms. Allocated memory is still 233.8MB. Free memory was 191.4MB in the beginning and 163.6MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 02:54:34,110 INFO L158 Benchmark]: TraceAbstraction took 757829.54ms. Allocated memory was 233.8MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 163.0MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 6.8GB. Max. memory is 8.0GB. [2022-12-06 02:54:34,111 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.09ms. Allocated memory is still 233.8MB. Free memory was 209.7MB in the beginning and 209.6MB in the end (delta: 83.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.77ms. Allocated memory is still 233.8MB. Free memory was 209.2MB in the beginning and 195.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.23ms. Allocated memory is still 233.8MB. Free memory was 195.0MB in the beginning and 192.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.58ms. Allocated memory is still 233.8MB. Free memory was 192.9MB in the beginning and 191.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 635.55ms. Allocated memory is still 233.8MB. Free memory was 191.4MB in the beginning and 163.6MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 757829.54ms. Allocated memory was 233.8MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 163.0MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 6.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.8s, 166 PlacesBefore, 49 PlacesAfterwards, 164 TransitionsBefore, 38 TransitionsAfterwards, 3806 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 67 TrivialYvCompositions, 50 ConcurrentYvCompositions, 9 ChoiceCompositions, 126 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2032, independent: 2009, independent conditional: 2009, 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: 2032, independent: 2009, independent conditional: 0, independent unconditional: 2009, 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: 2032, independent: 2009, independent conditional: 0, independent unconditional: 2009, 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: 2032, independent: 2009, independent conditional: 0, independent unconditional: 2009, 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: 1969, independent: 1953, independent conditional: 0, independent unconditional: 1953, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1969, independent: 1953, independent conditional: 0, independent unconditional: 1953, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2032, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1969, unknown conditional: 0, unknown unconditional: 1969] , Statistics on independence cache: Total cache size (in pairs): 3077, Positive cache size: 3061, Positive conditional cache size: 0, Positive unconditional cache size: 3061, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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, 52 PlacesBefore, 52 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 152 TransitionsBefore, 152 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 258 TransitionsBefore, 258 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 63 PlacesBefore, 62 PlacesAfterwards, 259 TransitionsBefore, 258 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 161 PlacesBefore, 161 PlacesAfterwards, 7450 TransitionsBefore, 7450 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 165 PlacesBefore, 165 PlacesAfterwards, 14935 TransitionsBefore, 14935 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 134]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 2/38 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 2765361 conditions, 320718 events (259315/320717 cut-off events. For 2884830/2889050 co-relation queries the response was YES. Maximal size of possible extension queue 31063. Compared 2023750 event pairs, 1757 based on Foata normal form. 4220/283239 useless extension candidates. Maximal degree in co-relation 2758921. Up to 298661 conditions per place.). - TimeoutResultAtElement [Line: 125]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 2/38 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 2765361 conditions, 320718 events (259315/320717 cut-off events. For 2884830/2889050 co-relation queries the response was YES. Maximal size of possible extension queue 31063. Compared 2023750 event pairs, 1757 based on Foata normal form. 4220/283239 useless extension candidates. Maximal degree in co-relation 2758921. Up to 298661 conditions per place.). - TimeoutResultAtElement [Line: 124]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 2/38 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 2765361 conditions, 320718 events (259315/320717 cut-off events. For 2884830/2889050 co-relation queries the response was YES. Maximal size of possible extension queue 31063. Compared 2023750 event pairs, 1757 based on Foata normal form. 4220/283239 useless extension candidates. Maximal degree in co-relation 2758921. Up to 298661 conditions per place.). - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 2/38 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 2765361 conditions, 320718 events (259315/320717 cut-off events. For 2884830/2889050 co-relation queries the response was YES. Maximal size of possible extension queue 31063. Compared 2023750 event pairs, 1757 based on Foata normal form. 4220/283239 useless extension candidates. Maximal degree in co-relation 2758921. Up to 298661 conditions per place.). - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 2/38 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 2765361 conditions, 320718 events (259315/320717 cut-off events. For 2884830/2889050 co-relation queries the response was YES. Maximal size of possible extension queue 31063. Compared 2023750 event pairs, 1757 based on Foata normal form. 4220/283239 useless extension candidates. Maximal degree in co-relation 2758921. Up to 298661 conditions per place.). - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (24states, 2/38 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 2765361 conditions, 320718 events (259315/320717 cut-off events. For 2884830/2889050 co-relation queries the response was YES. Maximal size of possible extension queue 31063. Compared 2023750 event pairs, 1757 based on Foata normal form. 4220/283239 useless extension candidates. Maximal degree in co-relation 2758921. Up to 298661 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 219 locations, 6 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: 757.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 731.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2250 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2250 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1032 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5514 IncrementalHoareTripleChecker+Invalid, 6797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 251 mSolverCounterUnsat, 2 mSDtfsCounter, 5514 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 118 SyntacticMatches, 47 SemanticMatches, 210 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 8822 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244999occurred in iteration=7, InterpolantAutomatonStates: 124, 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.6s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 422 ConstructedInterpolants, 13 QuantifiedInterpolants, 3237 SizeOfPredicates, 31 NumberOfNonLiveVariables, 718 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 27/38 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown