/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 22:01:13,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 22:01:13,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 22:01:13,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 22:01:13,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 22:01:13,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 22:01:13,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 22:01:13,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 22:01:13,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 22:01:13,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 22:01:13,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 22:01:13,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 22:01:13,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 22:01:13,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 22:01:13,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 22:01:13,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 22:01:13,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 22:01:13,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 22:01:13,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 22:01:13,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 22:01:13,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 22:01:13,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 22:01:13,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 22:01:13,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 22:01:13,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 22:01:13,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 22:01:13,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 22:01:13,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 22:01:13,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 22:01:13,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 22:01:13,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 22:01:13,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 22:01:13,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 22:01:13,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 22:01:13,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 22:01:13,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 22:01:13,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 22:01:13,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 22:01:13,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 22:01:13,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 22:01:13,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 22:01:13,768 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-NoLbe.epf [2022-12-11 22:01:13,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 22:01:13,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 22:01:13,793 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 22:01:13,793 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 22:01:13,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 22:01:13,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 22:01:13,794 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 22:01:13,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 22:01:13,809 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 22:01:13,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 22:01:13,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 22:01:13,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 22:01:13,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 22:01:13,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 22:01:13,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 22:01:13,812 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 22:01:13,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 22:01:13,813 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 22:01:13,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 22:01:13,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 22:01:13,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 22:01:13,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 22:01:13,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 22:01:13,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:01:13,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 22:01:13,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 22:01:13,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 22:01:13,814 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 22:01:13,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 22:01:13,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 22:01:13,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 22:01:13,814 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-11 22:01:14,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 22:01:14,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 22:01:14,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 22:01:14,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 22:01:14,075 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 22:01:14,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2022-12-11 22:01:15,022 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 22:01:15,216 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 22:01:15,216 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2022-12-11 22:01:15,224 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f9a1404/55d2a7b3e98c419d85cc93a6e25c6270/FLAG99c8071a7 [2022-12-11 22:01:15,237 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f9a1404/55d2a7b3e98c419d85cc93a6e25c6270 [2022-12-11 22:01:15,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 22:01:15,239 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 22:01:15,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 22:01:15,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 22:01:15,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 22:01:15,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c615f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15, skipping insertion in model container [2022-12-11 22:01:15,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 22:01:15,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 22:01:15,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:01:15,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:01:15,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:01:15,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:01:15,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:01:15,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:01:15,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:01:15,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:01:15,362 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-counter-determinism.wvr.c[2476,2489] [2022-12-11 22:01:15,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:01:15,370 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 22:01:15,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:01:15,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:01:15,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:01:15,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:01:15,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:01:15,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:01:15,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:01:15,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:01:15,394 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-counter-determinism.wvr.c[2476,2489] [2022-12-11 22:01:15,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:01:15,403 INFO L208 MainTranslator]: Completed translation [2022-12-11 22:01:15,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15 WrapperNode [2022-12-11 22:01:15,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 22:01:15,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 22:01:15,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 22:01:15,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 22:01:15,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,438 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2022-12-11 22:01:15,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 22:01:15,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 22:01:15,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 22:01:15,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 22:01:15,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,468 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 22:01:15,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 22:01:15,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 22:01:15,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 22:01:15,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (1/1) ... [2022-12-11 22:01:15,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:01:15,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:01:15,503 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-11 22:01:15,524 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-11 22:01:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 22:01:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 22:01:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 22:01:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 22:01:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 22:01:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-11 22:01:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-11 22:01:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-11 22:01:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-11 22:01:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 22:01:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 22:01:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 22:01:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 22:01:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 22:01:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 22:01:15,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 22:01:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 22:01:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 22:01:15,536 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 22:01:15,623 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 22:01:15,624 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 22:01:15,831 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 22:01:15,872 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 22:01:15,872 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-11 22:01:15,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:01:15 BoogieIcfgContainer [2022-12-11 22:01:15,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 22:01:15,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 22:01:15,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 22:01:15,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 22:01:15,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 10:01:15" (1/3) ... [2022-12-11 22:01:15,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c19e8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:01:15, skipping insertion in model container [2022-12-11 22:01:15,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:01:15" (2/3) ... [2022-12-11 22:01:15,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c19e8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:01:15, skipping insertion in model container [2022-12-11 22:01:15,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:01:15" (3/3) ... [2022-12-11 22:01:15,880 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2022-12-11 22:01:15,893 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 22:01:15,893 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 22:01:15,893 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 22:01:15,964 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-11 22:01:15,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 119 transitions, 270 flow [2022-12-11 22:01:16,099 INFO L130 PetriNetUnfolder]: 9/115 cut-off events. [2022-12-11 22:01:16,100 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-11 22:01:16,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 115 events. 9/115 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-11 22:01:16,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 119 transitions, 270 flow [2022-12-11 22:01:16,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 103 transitions, 230 flow [2022-12-11 22:01:16,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 22:01:16,135 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=PETRI_NET, 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;@21d2eea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 22:01:16,135 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-11 22:01:16,155 INFO L130 PetriNetUnfolder]: 9/102 cut-off events. [2022-12-11 22:01:16,155 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-11 22:01:16,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:01:16,157 INFO L214 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, 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, 1, 1, 1] [2022-12-11 22:01:16,157 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 2 more)] === [2022-12-11 22:01:16,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:01:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash 360089710, now seen corresponding path program 1 times [2022-12-11 22:01:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:01:16,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895186853] [2022-12-11 22:01:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:01:16,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:01:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:01:16,693 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-11 22:01:16,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:01:16,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895186853] [2022-12-11 22:01:16,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895186853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:01:16,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:01:16,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 22:01:16,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653451343] [2022-12-11 22:01:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:01:16,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 22:01:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:01:16,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 22:01:16,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 22:01:16,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 119 [2022-12-11 22:01:16,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 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-11 22:01:16,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:01:16,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 119 [2022-12-11 22:01:16,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:01:16,947 INFO L130 PetriNetUnfolder]: 107/474 cut-off events. [2022-12-11 22:01:16,947 INFO L131 PetriNetUnfolder]: For 115/116 co-relation queries the response was YES. [2022-12-11 22:01:16,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 474 events. 107/474 cut-off events. For 115/116 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2087 event pairs, 26 based on Foata normal form. 135/549 useless extension candidates. Maximal degree in co-relation 510. Up to 124 conditions per place. [2022-12-11 22:01:16,954 INFO L137 encePairwiseOnDemand]: 104/119 looper letters, 32 selfloop transitions, 5 changer transitions 8/124 dead transitions. [2022-12-11 22:01:16,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 124 transitions, 398 flow [2022-12-11 22:01:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 22:01:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 22:01:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 816 transitions. [2022-12-11 22:01:16,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-12-11 22:01:16,979 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 7 predicate places. [2022-12-11 22:01:16,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 124 transitions, 398 flow [2022-12-11 22:01:16,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 116 transitions, 360 flow [2022-12-11 22:01:16,982 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 116 transitions, 360 flow [2022-12-11 22:01:16,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 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-11 22:01:16,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:01:16,983 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:01:16,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 22:01:16,985 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 2 more)] === [2022-12-11 22:01:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:01:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1134279214, now seen corresponding path program 1 times [2022-12-11 22:01:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:01:16,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604144318] [2022-12-11 22:01:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:01:16,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:01:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:01:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:01:17,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:01:17,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604144318] [2022-12-11 22:01:17,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604144318] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:01:17,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679923206] [2022-12-11 22:01:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:01:17,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:01:17,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:01:17,140 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-11 22:01:17,142 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-11 22:01:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:01:17,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-11 22:01:17,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:01:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:01:17,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:01:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:01:17,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679923206] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:01:17,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:01:17,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-12-11 22:01:17,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798856823] [2022-12-11 22:01:17,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:01:17,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 22:01:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:01:17,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 22:01:17,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-11 22:01:17,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:01:17,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 116 transitions, 360 flow. Second operand has 9 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 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-11 22:01:17,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:01:17,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:01:17,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:01:18,388 INFO L130 PetriNetUnfolder]: 6948/10627 cut-off events. [2022-12-11 22:01:18,388 INFO L131 PetriNetUnfolder]: For 4012/4615 co-relation queries the response was YES. [2022-12-11 22:01:18,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23949 conditions, 10627 events. 6948/10627 cut-off events. For 4012/4615 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 72607 event pairs, 282 based on Foata normal form. 17/8274 useless extension candidates. Maximal degree in co-relation 23354. Up to 2111 conditions per place. [2022-12-11 22:01:18,476 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 198 selfloop transitions, 24 changer transitions 0/295 dead transitions. [2022-12-11 22:01:18,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 295 transitions, 1462 flow [2022-12-11 22:01:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 22:01:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 22:01:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1382 transitions. [2022-12-11 22:01:18,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.82953181272509 [2022-12-11 22:01:18,483 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 15 predicate places. [2022-12-11 22:01:18,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 295 transitions, 1462 flow [2022-12-11 22:01:18,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 295 transitions, 1462 flow [2022-12-11 22:01:18,531 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 295 transitions, 1462 flow [2022-12-11 22:01:18,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 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-11 22:01:18,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:01:18,532 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:01:18,548 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-11 22:01:18,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:01:18,740 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 2 more)] === [2022-12-11 22:01:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:01:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash 307942766, now seen corresponding path program 2 times [2022-12-11 22:01:18,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:01:18,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725285456] [2022-12-11 22:01:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:01:18,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:01:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:01:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:01:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:01:18,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725285456] [2022-12-11 22:01:18,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725285456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:01:18,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:01:18,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:01:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960376443] [2022-12-11 22:01:18,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:01:18,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:01:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:01:18,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:01:18,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:01:18,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:01:18,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 295 transitions, 1462 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:01:18,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:01:18,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:01:18,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:01:20,664 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][524], [65#L73true, 4#L51-2true, 652#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0)), 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 66#L62-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:01:20,664 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-11 22:01:20,664 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:01:20,664 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:01:20,664 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:01:20,664 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][525], [4#L51-2true, 652#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0)), 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), thread2Thread1of1ForFork1InUse, 41#L72-5true, thread4Thread1of1ForFork0InUse, 66#L62-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:01:20,664 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-11 22:01:20,665 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:01:20,665 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:01:20,665 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:01:20,887 INFO L130 PetriNetUnfolder]: 17605/28768 cut-off events. [2022-12-11 22:01:20,888 INFO L131 PetriNetUnfolder]: For 18372/30186 co-relation queries the response was YES. [2022-12-11 22:01:20,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80210 conditions, 28768 events. 17605/28768 cut-off events. For 18372/30186 co-relation queries the response was YES. Maximal size of possible extension queue 1478. Compared 237591 event pairs, 2720 based on Foata normal form. 141/23603 useless extension candidates. Maximal degree in co-relation 78821. Up to 11917 conditions per place. [2022-12-11 22:01:21,098 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 443 selfloop transitions, 15 changer transitions 36/581 dead transitions. [2022-12-11 22:01:21,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 581 transitions, 4027 flow [2022-12-11 22:01:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:01:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 22:01:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2022-12-11 22:01:21,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8179271708683473 [2022-12-11 22:01:21,101 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 20 predicate places. [2022-12-11 22:01:21,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 581 transitions, 4027 flow [2022-12-11 22:01:21,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 545 transitions, 3741 flow [2022-12-11 22:01:21,297 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 545 transitions, 3741 flow [2022-12-11 22:01:21,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:01:21,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:01:21,298 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:01:21,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 22:01:21,298 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 2 more)] === [2022-12-11 22:01:21,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:01:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1696637604, now seen corresponding path program 3 times [2022-12-11 22:01:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:01:21,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948640113] [2022-12-11 22:01:21,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:01:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:01:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:01:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:01:21,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:01:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948640113] [2022-12-11 22:01:21,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948640113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:01:21,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:01:21,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:01:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007777142] [2022-12-11 22:01:21,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:01:21,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:01:21,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:01:21,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:01:21,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:01:21,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:01:21,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 545 transitions, 3741 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:01:21,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:01:21,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:01:21,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:01:24,242 INFO L130 PetriNetUnfolder]: 23494/37555 cut-off events. [2022-12-11 22:01:24,242 INFO L131 PetriNetUnfolder]: For 42955/95212 co-relation queries the response was YES. [2022-12-11 22:01:24,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134438 conditions, 37555 events. 23494/37555 cut-off events. For 42955/95212 co-relation queries the response was YES. Maximal size of possible extension queue 1744. Compared 310006 event pairs, 3074 based on Foata normal form. 471/30896 useless extension candidates. Maximal degree in co-relation 115904. Up to 16181 conditions per place. [2022-12-11 22:01:24,478 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 876 selfloop transitions, 29 changer transitions 4/984 dead transitions. [2022-12-11 22:01:24,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 984 transitions, 8933 flow [2022-12-11 22:01:24,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:01:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 22:01:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 590 transitions. [2022-12-11 22:01:24,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8263305322128851 [2022-12-11 22:01:24,480 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 24 predicate places. [2022-12-11 22:01:24,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 984 transitions, 8933 flow [2022-12-11 22:01:24,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 980 transitions, 8896 flow [2022-12-11 22:01:24,634 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 980 transitions, 8896 flow [2022-12-11 22:01:24,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:01:24,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:01:24,635 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:01:24,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 22:01:24,635 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 2 more)] === [2022-12-11 22:01:24,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:01:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash -42273692, now seen corresponding path program 1 times [2022-12-11 22:01:24,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:01:24,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867167697] [2022-12-11 22:01:24,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:01:24,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:01:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:01:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:01:24,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:01:24,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867167697] [2022-12-11 22:01:24,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867167697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:01:24,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:01:24,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:01:24,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774388542] [2022-12-11 22:01:24,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:01:24,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:01:24,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:01:24,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:01:24,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:01:24,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:01:24,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 980 transitions, 8896 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:01:24,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:01:24,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:01:24,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:01:30,425 INFO L130 PetriNetUnfolder]: 38389/58293 cut-off events. [2022-12-11 22:01:30,426 INFO L131 PetriNetUnfolder]: For 111499/293008 co-relation queries the response was YES. [2022-12-11 22:01:30,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242485 conditions, 58293 events. 38389/58293 cut-off events. For 111499/293008 co-relation queries the response was YES. Maximal size of possible extension queue 2556. Compared 472798 event pairs, 5657 based on Foata normal form. 1409/50353 useless extension candidates. Maximal degree in co-relation 204783. Up to 21659 conditions per place. [2022-12-11 22:01:30,858 INFO L137 encePairwiseOnDemand]: 113/119 looper letters, 1140 selfloop transitions, 32 changer transitions 0/1342 dead transitions. [2022-12-11 22:01:30,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 1342 transitions, 14664 flow [2022-12-11 22:01:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-11 22:01:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-11 22:01:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2022-12-11 22:01:30,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8504201680672269 [2022-12-11 22:01:30,861 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 28 predicate places. [2022-12-11 22:01:30,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 1342 transitions, 14664 flow [2022-12-11 22:01:31,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 1342 transitions, 14664 flow [2022-12-11 22:01:31,150 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 1342 transitions, 14664 flow [2022-12-11 22:01:31,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:01:31,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:01:31,150 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:01:31,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 22:01:31,151 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 2 more)] === [2022-12-11 22:01:31,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:01:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1841777828, now seen corresponding path program 2 times [2022-12-11 22:01:31,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:01:31,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131127104] [2022-12-11 22:01:31,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:01:31,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:01:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:01:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:01:31,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:01:31,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131127104] [2022-12-11 22:01:31,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131127104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:01:31,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:01:31,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:01:31,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873258912] [2022-12-11 22:01:31,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:01:31,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:01:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:01:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:01:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:01:31,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:01:31,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 1342 transitions, 14664 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:01:31,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:01:31,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:01:31,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:01:34,327 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][709], [33#L51-3true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 41#L72-5true, 79#L41-2true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 665#true, 681#(= thread1Thread1of1ForFork3_~i~0 0), 143#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= (+ thread1Thread1of1ForFork3_~i~0 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:34,327 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-11 22:01:34,327 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:34,327 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:34,327 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:34,327 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][710], [33#L51-3true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 79#L41-2true, 66#L62-4true, 665#true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 681#(= thread1Thread1of1ForFork3_~i~0 0), 143#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= (+ thread1Thread1of1ForFork3_~i~0 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:34,327 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-11 22:01:34,327 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:34,327 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:34,328 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:37,952 INFO L130 PetriNetUnfolder]: 38577/58683 cut-off events. [2022-12-11 22:01:37,952 INFO L131 PetriNetUnfolder]: For 158883/320847 co-relation queries the response was YES. [2022-12-11 22:01:38,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287773 conditions, 58683 events. 38577/58683 cut-off events. For 158883/320847 co-relation queries the response was YES. Maximal size of possible extension queue 2527. Compared 477160 event pairs, 5493 based on Foata normal form. 1387/50750 useless extension candidates. Maximal degree in co-relation 271824. Up to 29912 conditions per place. [2022-12-11 22:01:38,493 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 1309 selfloop transitions, 44 changer transitions 80/1534 dead transitions. [2022-12-11 22:01:38,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 1534 transitions, 19704 flow [2022-12-11 22:01:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:01:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 22:01:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2022-12-11 22:01:38,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.819327731092437 [2022-12-11 22:01:38,501 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 33 predicate places. [2022-12-11 22:01:38,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 1534 transitions, 19704 flow [2022-12-11 22:01:38,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 1454 transitions, 18568 flow [2022-12-11 22:01:38,839 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 1454 transitions, 18568 flow [2022-12-11 22:01:38,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:01:38,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:01:38,840 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:01:38,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 22:01:38,840 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 2 more)] === [2022-12-11 22:01:38,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:01:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1918583816, now seen corresponding path program 3 times [2022-12-11 22:01:38,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:01:38,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36067416] [2022-12-11 22:01:38,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:01:38,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:01:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:01:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:01:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:01:38,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36067416] [2022-12-11 22:01:38,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36067416] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:01:38,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674416592] [2022-12-11 22:01:38,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 22:01:38,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:01:38,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:01:38,926 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-11 22:01:38,928 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-11 22:01:39,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-11 22:01:39,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:01:39,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-11 22:01:39,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:01:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:01:39,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:01:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:01:39,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674416592] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:01:39,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:01:39,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-12-11 22:01:39,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090322398] [2022-12-11 22:01:39,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:01:39,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 22:01:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:01:39,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 22:01:39,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-11 22:01:39,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:01:39,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 1454 transitions, 18568 flow. Second operand has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 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-11 22:01:39,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:01:39,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:01:39,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:01:45,562 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1481], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:01:45,563 INFO L382 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-11 22:01:45,563 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-11 22:01:45,563 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-11 22:01:45,563 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-11 22:01:45,563 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1482], [690#(= thread3Thread1of1ForFork2_~i~2 0), 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:01:45,564 INFO L382 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-11 22:01:45,564 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-11 22:01:45,564 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-11 22:01:45,564 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-11 22:01:46,899 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1908], [44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 65#L73true, 679#true, 1191#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 677#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true, 23#L62-2true]) [2022-12-11 22:01:46,899 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-11 22:01:46,899 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:01:46,899 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:01:46,899 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:01:46,899 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1909], [691#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 677#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true, 23#L62-2true]) [2022-12-11 22:01:46,900 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-11 22:01:46,900 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:01:46,900 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:01:46,900 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:01:47,183 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][2265], [99#L62-3true, 44#L92-2true, 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 1195#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (<= 1 ~N~0)), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:01:47,183 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-11 22:01:47,183 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-11 22:01:47,183 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-11 22:01:47,183 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-11 22:01:47,183 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][2266], [99#L62-3true, 44#L92-2true, 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 692#(<= 1 ~N~0), 41#L72-5true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:01:47,183 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-11 22:01:47,183 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-11 22:01:47,183 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-11 22:01:47,183 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-11 22:01:47,996 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][2265], [44#L92-2true, 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 1195#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (<= 1 ~N~0)), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true, 23#L62-2true]) [2022-12-11 22:01:47,997 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 22:01:47,997 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:01:47,997 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:01:47,997 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 22:01:47,997 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][2266], [44#L92-2true, 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 692#(<= 1 ~N~0), 41#L72-5true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true, 23#L62-2true]) [2022-12-11 22:01:47,997 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 22:01:47,997 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:01:47,997 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:01:47,997 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 22:01:48,249 INFO L130 PetriNetUnfolder]: 45293/67971 cut-off events. [2022-12-11 22:01:48,250 INFO L131 PetriNetUnfolder]: For 169601/284668 co-relation queries the response was YES. [2022-12-11 22:01:48,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390330 conditions, 67971 events. 45293/67971 cut-off events. For 169601/284668 co-relation queries the response was YES. Maximal size of possible extension queue 2856. Compared 544421 event pairs, 2254 based on Foata normal form. 1487/59592 useless extension candidates. Maximal degree in co-relation 328933. Up to 35474 conditions per place. [2022-12-11 22:01:49,005 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 2339 selfloop transitions, 361 changer transitions 21/2891 dead transitions. [2022-12-11 22:01:49,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 2891 transitions, 42939 flow [2022-12-11 22:01:49,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 22:01:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 22:01:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1385 transitions. [2022-12-11 22:01:49,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8313325330132053 [2022-12-11 22:01:49,008 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 45 predicate places. [2022-12-11 22:01:49,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 2891 transitions, 42939 flow [2022-12-11 22:01:49,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 2870 transitions, 42645 flow [2022-12-11 22:01:49,413 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 2870 transitions, 42645 flow [2022-12-11 22:01:49,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 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-11 22:01:49,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:01:49,413 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:01:49,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-11 22:01:49,619 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,SelfDestructingSolverStorable6 [2022-12-11 22:01:49,620 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 2 more)] === [2022-12-11 22:01:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:01:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1103861302, now seen corresponding path program 4 times [2022-12-11 22:01:49,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:01:49,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688742001] [2022-12-11 22:01:49,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:01:49,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:01:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:01:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:01:49,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:01:49,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688742001] [2022-12-11 22:01:49,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688742001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:01:49,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:01:49,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:01:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914120589] [2022-12-11 22:01:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:01:49,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:01:49,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:01:49,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:01:49,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:01:49,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:01:49,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 2870 transitions, 42645 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:01:49,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:01:49,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:01:49,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:01:54,752 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1466], [690#(= thread3Thread1of1ForFork2_~i~2 0), 83#L42true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:54,753 INFO L382 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2022-12-11 22:01:54,753 INFO L385 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2022-12-11 22:01:54,753 INFO L385 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-11 22:01:54,753 INFO L385 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2022-12-11 22:01:54,753 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1467], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 83#L42true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:54,753 INFO L382 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2022-12-11 22:01:54,753 INFO L385 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2022-12-11 22:01:54,753 INFO L385 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-12-11 22:01:54,753 INFO L385 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2022-12-11 22:01:55,652 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1466], [690#(= thread3Thread1of1ForFork2_~i~2 0), 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 63#L44true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:55,652 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-11 22:01:55,652 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,653 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-11 22:01:55,653 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,653 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1467], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 63#L44true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:55,653 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-11 22:01:55,653 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,653 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-11 22:01:55,653 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,797 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][922], [33#L51-3true, 690#(= thread3Thread1of1ForFork2_~i~2 0), 658#(= thread3Thread1of1ForFork2_~i~2 0), 79#L41-2true, 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 665#true, 681#(= thread1Thread1of1ForFork3_~i~0 0), 1200#(= thread1Thread1of1ForFork3_~i~0 0), 143#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= (+ thread1Thread1of1ForFork3_~i~0 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:55,797 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-11 22:01:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,797 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][923], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 33#L51-3true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 79#L41-2true, 66#L62-4true, 665#true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 681#(= thread1Thread1of1ForFork3_~i~0 0), 1200#(= thread1Thread1of1ForFork3_~i~0 0), 143#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= (+ thread1Thread1of1ForFork3_~i~0 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:55,797 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-11 22:01:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,797 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,798 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1062], [111#L41-3true, 33#L51-3true, 1198#true, 1035#(< |thread4Thread1of1ForFork0_~i~3#1| ~N~0), 665#true, 10#$Ultimate##0true, 65#L73true, 679#true, 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 144#(<= 1 ~N~0), 126#true]) [2022-12-11 22:01:55,798 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-11 22:01:55,798 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,798 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,798 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-11 22:01:55,798 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1063], [111#L41-3true, 33#L51-3true, 1198#true, 688#true, 41#L72-5true, 665#true, 10#$Ultimate##0true, 679#true, 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true, 144#(<= 1 ~N~0)]) [2022-12-11 22:01:55,798 INFO L382 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2022-12-11 22:01:55,798 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,798 INFO L385 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-11 22:01:55,798 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-11 22:01:56,314 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1239], [111#L41-3true, 1198#true, 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 688#true, 10#$Ultimate##0true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, 656#true, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:56,314 INFO L382 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-12-11 22:01:56,314 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-11 22:01:56,314 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-11 22:01:56,314 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-11 22:01:56,314 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1240], [111#L41-3true, 1198#true, 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 1035#(< |thread4Thread1of1ForFork0_~i~3#1| ~N~0), 10#$Ultimate##0true, 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:56,314 INFO L382 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-12-11 22:01:56,314 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-11 22:01:56,314 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-11 22:01:56,314 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-11 22:01:56,371 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1466], [690#(= thread3Thread1of1ForFork2_~i~2 0), 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 79#L41-2true, 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:56,371 INFO L382 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-12-11 22:01:56,371 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-11 22:01:56,371 INFO L385 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-12-11 22:01:56,371 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-11 22:01:56,372 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1467], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 79#L41-2true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 7#L91-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-11 22:01:56,372 INFO L382 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-12-11 22:01:56,372 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-11 22:01:56,372 INFO L385 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-12-11 22:01:56,372 INFO L385 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-11 22:02:01,681 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1900], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 44#L92-2true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 65#L73true, 679#true, 4#L51-2true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:02:01,681 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-11 22:02:01,681 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:02:01,681 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:02:01,681 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:02:01,681 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1901], [690#(= thread3Thread1of1ForFork2_~i~2 0), 1198#true, 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 679#true, 4#L51-2true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:02:01,681 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-11 22:02:01,681 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:02:01,681 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:02:01,681 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:02:01,698 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][2417], [691#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 44#L92-2true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 677#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true, 23#L62-2true]) [2022-12-11 22:02:01,698 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-11 22:02:01,698 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:02:01,698 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:02:01,698 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:02:01,698 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][2418], [44#L92-2true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 65#L73true, 679#true, 1191#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 677#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true, 23#L62-2true]) [2022-12-11 22:02:01,698 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-11 22:02:01,698 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:02:01,698 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:02:01,698 INFO L385 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-11 22:02:02,079 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][2869], [99#L62-3true, 44#L92-2true, 1198#true, 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 1195#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (<= 1 ~N~0)), 65#L73true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:02:02,079 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-11 22:02:02,079 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-11 22:02:02,079 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-11 22:02:02,079 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-11 22:02:02,080 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][2870], [99#L62-3true, 44#L92-2true, 1198#true, 692#(<= 1 ~N~0), 650#(and (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 41#L72-5true, 679#true, 667#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 674#true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, 656#true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:02:02,080 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-11 22:02:02,080 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-11 22:02:02,080 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-11 22:02:02,080 INFO L385 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-11 22:02:03,120 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L72-4-->L73: Formula: (< |v_thread4Thread1of1ForFork0_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][3220], [1189#(and (< |thread4Thread1of1ForFork0_~i~3#1| ~N~0) (= thread3Thread1of1ForFork2_~i~2 0)), 652#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0)), 44#L92-2true, 1198#true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 665#true, 65#L73true, 679#true, 4#L51-2true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:02:03,120 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 22:02:03,120 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:02:03,120 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 22:02:03,120 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:02:03,120 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L72-4-->L72-5: Formula: (not (< |v_thread4Thread1of1ForFork0_~i~3#1_5| v_~N~0_7)) InVars {thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][3221], [690#(= thread3Thread1of1ForFork2_~i~2 0), 652#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 0 thread1Thread1of1ForFork3_~i~0) (<= 1 ~N~0)), 1198#true, 44#L92-2true, 658#(= thread3Thread1of1ForFork2_~i~2 0), 41#L72-5true, 66#L62-4true, 676#(= thread3Thread1of1ForFork2_~i~2 0), 665#true, 679#true, 4#L51-2true, thread2Thread1of1ForFork1InUse, thread4Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3NotInUse, 126#true]) [2022-12-11 22:02:03,120 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 22:02:03,120 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:02:03,120 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 22:02:03,120 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-11 22:02:03,479 INFO L130 PetriNetUnfolder]: 52778/78113 cut-off events. [2022-12-11 22:02:03,480 INFO L131 PetriNetUnfolder]: For 298738/980809 co-relation queries the response was YES. [2022-12-11 22:02:03,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508974 conditions, 78113 events. 52778/78113 cut-off events. For 298738/980809 co-relation queries the response was YES. Maximal size of possible extension queue 3149. Compared 621149 event pairs, 2283 based on Foata normal form. 2626/68926 useless extension candidates. Maximal degree in co-relation 433042. Up to 37429 conditions per place. [2022-12-11 22:02:04,227 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 3279 selfloop transitions, 123 changer transitions 7/3537 dead transitions. [2022-12-11 22:02:04,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 3537 transitions, 59750 flow [2022-12-11 22:02:04,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:02:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 22:02:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 609 transitions. [2022-12-11 22:02:04,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8529411764705882 [2022-12-11 22:02:04,230 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 50 predicate places. [2022-12-11 22:02:04,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 3537 transitions, 59750 flow [2022-12-11 22:02:04,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 3530 transitions, 59633 flow [2022-12-11 22:02:04,877 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 3530 transitions, 59633 flow [2022-12-11 22:02:04,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:02:04,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:02:04,878 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:02:04,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 22:02:04,878 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 22:02:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:02:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1805359546, now seen corresponding path program 5 times [2022-12-11 22:02:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:02:04,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308794064] [2022-12-11 22:02:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:02:04,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:02:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:02:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:02:04,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:02:04,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308794064] [2022-12-11 22:02:04,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308794064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:02:04,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:02:04,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:02:04,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015409530] [2022-12-11 22:02:04,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:02:04,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:02:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:02:04,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:02:04,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:02:04,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:02:04,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 3530 transitions, 59633 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:02:04,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:02:04,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:02:04,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:02:29,729 INFO L130 PetriNetUnfolder]: 67959/103861 cut-off events. [2022-12-11 22:02:29,729 INFO L131 PetriNetUnfolder]: For 480497/880231 co-relation queries the response was YES. [2022-12-11 22:02:30,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724932 conditions, 103861 events. 67959/103861 cut-off events. For 480497/880231 co-relation queries the response was YES. Maximal size of possible extension queue 4240. Compared 884955 event pairs, 3119 based on Foata normal form. 1559/91879 useless extension candidates. Maximal degree in co-relation 623931. Up to 45931 conditions per place. [2022-12-11 22:02:30,949 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 5046 selfloop transitions, 325 changer transitions 86/5590 dead transitions. [2022-12-11 22:02:30,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 5590 transitions, 104605 flow [2022-12-11 22:02:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:02:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 22:02:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2022-12-11 22:02:30,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8543417366946778 [2022-12-11 22:02:30,951 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 55 predicate places. [2022-12-11 22:02:30,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 5590 transitions, 104605 flow [2022-12-11 22:02:31,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 5504 transitions, 102930 flow [2022-12-11 22:02:31,645 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 5504 transitions, 102930 flow [2022-12-11 22:02:31,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:02:31,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:02:31,645 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:02:31,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 22:02:31,645 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 22:02:31,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:02:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash -257685268, now seen corresponding path program 6 times [2022-12-11 22:02:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:02:31,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575834158] [2022-12-11 22:02:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:02:31,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:02:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:02:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:02:31,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:02:31,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575834158] [2022-12-11 22:02:31,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575834158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:02:31,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:02:31,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 22:02:31,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519984418] [2022-12-11 22:02:31,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:02:31,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 22:02:31,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:02:31,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 22:02:31,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-11 22:02:31,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:02:31,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 5504 transitions, 102930 flow. Second operand has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 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-11 22:02:31,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:02:31,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:02:31,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:03:08,881 INFO L130 PetriNetUnfolder]: 79313/121018 cut-off events. [2022-12-11 22:03:08,881 INFO L131 PetriNetUnfolder]: For 702915/1215277 co-relation queries the response was YES. [2022-12-11 22:03:09,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928554 conditions, 121018 events. 79313/121018 cut-off events. For 702915/1215277 co-relation queries the response was YES. Maximal size of possible extension queue 5086. Compared 1056462 event pairs, 3516 based on Foata normal form. 1906/108161 useless extension candidates. Maximal degree in co-relation 793684. Up to 52971 conditions per place. [2022-12-11 22:03:10,374 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 5662 selfloop transitions, 194 changer transitions 0/6046 dead transitions. [2022-12-11 22:03:10,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 6046 transitions, 125071 flow [2022-12-11 22:03:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:03:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 22:03:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 617 transitions. [2022-12-11 22:03:10,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8641456582633054 [2022-12-11 22:03:10,376 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 60 predicate places. [2022-12-11 22:03:10,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 6046 transitions, 125071 flow [2022-12-11 22:03:11,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 6046 transitions, 125071 flow [2022-12-11 22:03:11,280 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 6046 transitions, 125071 flow [2022-12-11 22:03:11,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 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-11 22:03:11,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:03:11,281 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:03:11,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 22:03:11,281 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 22:03:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:03:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1890089476, now seen corresponding path program 4 times [2022-12-11 22:03:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:03:11,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928746780] [2022-12-11 22:03:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:03:11,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:03:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:03:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:03:11,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:03:11,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928746780] [2022-12-11 22:03:11,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928746780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:03:11,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:03:11,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:03:11,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062028890] [2022-12-11 22:03:11,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:03:11,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:03:11,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:03:11,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:03:11,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:03:11,329 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:03:11,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 6046 transitions, 125071 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:03:11,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:03:11,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:03:11,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:03:56,698 INFO L130 PetriNetUnfolder]: 81532/123742 cut-off events. [2022-12-11 22:03:56,699 INFO L131 PetriNetUnfolder]: For 871971/2008545 co-relation queries the response was YES. [2022-12-11 22:03:57,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028785 conditions, 123742 events. 81532/123742 cut-off events. For 871971/2008545 co-relation queries the response was YES. Maximal size of possible extension queue 5142. Compared 1074097 event pairs, 4056 based on Foata normal form. 3369/112658 useless extension candidates. Maximal degree in co-relation 878920. Up to 53430 conditions per place. [2022-12-11 22:03:58,198 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 5617 selfloop transitions, 204 changer transitions 90/6285 dead transitions. [2022-12-11 22:03:58,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 6285 transitions, 141172 flow [2022-12-11 22:03:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:03:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 22:03:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 589 transitions. [2022-12-11 22:03:58,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8249299719887955 [2022-12-11 22:03:58,200 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 65 predicate places. [2022-12-11 22:03:58,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 6285 transitions, 141172 flow [2022-12-11 22:03:59,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 6195 transitions, 139012 flow [2022-12-11 22:03:59,180 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 6195 transitions, 139012 flow [2022-12-11 22:03:59,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:03:59,181 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:03:59,181 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:03:59,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 22:03:59,181 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 22:03:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:03:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash 644368384, now seen corresponding path program 5 times [2022-12-11 22:03:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:03:59,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542632544] [2022-12-11 22:03:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:03:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:03:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:03:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:03:59,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:03:59,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542632544] [2022-12-11 22:03:59,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542632544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:03:59,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:03:59,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:03:59,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252034532] [2022-12-11 22:03:59,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:03:59,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:03:59,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:03:59,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:03:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:03:59,237 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:03:59,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 6195 transitions, 139012 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:03:59,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:03:59,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:03:59,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:05:02,817 INFO L130 PetriNetUnfolder]: 104795/159918 cut-off events. [2022-12-11 22:05:02,818 INFO L131 PetriNetUnfolder]: For 1290728/2802437 co-relation queries the response was YES. [2022-12-11 22:05:03,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434200 conditions, 159918 events. 104795/159918 cut-off events. For 1290728/2802437 co-relation queries the response was YES. Maximal size of possible extension queue 6698. Compared 1436228 event pairs, 4450 based on Foata normal form. 3722/145101 useless extension candidates. Maximal degree in co-relation 1225795. Up to 71557 conditions per place. [2022-12-11 22:05:04,764 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 7413 selfloop transitions, 320 changer transitions 135/8242 dead transitions. [2022-12-11 22:05:04,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 8242 transitions, 201262 flow [2022-12-11 22:05:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:05:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 22:05:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 614 transitions. [2022-12-11 22:05:04,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8599439775910365 [2022-12-11 22:05:04,766 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 70 predicate places. [2022-12-11 22:05:04,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 8242 transitions, 201262 flow [2022-12-11 22:05:06,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 8107 transitions, 197821 flow [2022-12-11 22:05:06,091 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 8107 transitions, 197821 flow [2022-12-11 22:05:06,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:05:06,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:05:06,091 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:05:06,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 22:05:06,091 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 22:05:06,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:05:06,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1311067828, now seen corresponding path program 6 times [2022-12-11 22:05:06,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:05:06,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807768421] [2022-12-11 22:05:06,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:05:06,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:05:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:05:06,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:05:06,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807768421] [2022-12-11 22:05:06,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807768421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:05:06,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:05:06,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:05:06,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807863431] [2022-12-11 22:05:06,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:05:06,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:05:06,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:05:06,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:05:06,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:05:06,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:05:06,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 8107 transitions, 197821 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:05:06,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:05:06,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:05:06,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:07:14,871 INFO L130 PetriNetUnfolder]: 140095/214642 cut-off events. [2022-12-11 22:07:14,872 INFO L131 PetriNetUnfolder]: For 1605580/2149155 co-relation queries the response was YES. [2022-12-11 22:07:15,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066991 conditions, 214642 events. 140095/214642 cut-off events. For 1605580/2149155 co-relation queries the response was YES. Maximal size of possible extension queue 8484. Compared 1987311 event pairs, 5500 based on Foata normal form. 2522/191330 useless extension candidates. Maximal degree in co-relation 1756149. Up to 97141 conditions per place. [2022-12-11 22:07:17,606 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 12099 selfloop transitions, 533 changer transitions 269/13332 dead transitions. [2022-12-11 22:07:17,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 13332 transitions, 353367 flow [2022-12-11 22:07:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:07:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 22:07:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 586 transitions. [2022-12-11 22:07:17,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8207282913165266 [2022-12-11 22:07:17,608 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 75 predicate places. [2022-12-11 22:07:17,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 13332 transitions, 353367 flow [2022-12-11 22:07:19,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 13063 transitions, 346069 flow [2022-12-11 22:07:19,586 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 13063 transitions, 346069 flow [2022-12-11 22:07:19,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:07:19,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:07:19,587 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:07:19,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 22:07:19,587 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 22:07:19,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:07:19,587 INFO L85 PathProgramCache]: Analyzing trace with hash 167612080, now seen corresponding path program 7 times [2022-12-11 22:07:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:07:19,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305264719] [2022-12-11 22:07:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:07:19,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:07:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:07:19,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:07:19,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:07:19,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305264719] [2022-12-11 22:07:19,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305264719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:07:19,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:07:19,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:07:19,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122501349] [2022-12-11 22:07:19,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:07:19,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:07:19,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:07:19,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:07:19,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:07:19,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:07:19,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 13063 transitions, 346069 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:07:19,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:07:19,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:07:19,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:11:38,421 INFO L130 PetriNetUnfolder]: 139144/214355 cut-off events. [2022-12-11 22:11:38,421 INFO L131 PetriNetUnfolder]: For 1872523/3906671 co-relation queries the response was YES. [2022-12-11 22:11:39,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199779 conditions, 214355 events. 139144/214355 cut-off events. For 1872523/3906671 co-relation queries the response was YES. Maximal size of possible extension queue 8514. Compared 2004207 event pairs, 5139 based on Foata normal form. 6257/195493 useless extension candidates. Maximal degree in co-relation 1875668. Up to 97668 conditions per place. [2022-12-11 22:11:41,207 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 12018 selfloop transitions, 368 changer transitions 257/13029 dead transitions. [2022-12-11 22:11:41,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 13029 transitions, 370456 flow [2022-12-11 22:11:41,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:11:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 22:11:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 617 transitions. [2022-12-11 22:11:41,208 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8641456582633054 [2022-12-11 22:11:41,209 INFO L295 CegarLoopForPetriNet]: 107 programPoint places, 80 predicate places. [2022-12-11 22:11:41,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 13029 transitions, 370456 flow [2022-12-11 22:11:43,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 12772 transitions, 363055 flow [2022-12-11 22:11:43,345 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 12772 transitions, 363055 flow [2022-12-11 22:11:43,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:11:43,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:11:43,345 INFO L214 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:11:43,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 22:11:43,346 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 22:11:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:11:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1924709598, now seen corresponding path program 8 times [2022-12-11 22:11:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:11:43,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721147074] [2022-12-11 22:11:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:11:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:11:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:11:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:11:43,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:11:43,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721147074] [2022-12-11 22:11:43,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721147074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:11:43,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:11:43,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:11:43,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757564372] [2022-12-11 22:11:43,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:11:43,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:11:43,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:11:43,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:11:43,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:11:43,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-12-11 22:11:43,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 12772 transitions, 363055 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-11 22:11:43,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:11:43,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-12-11 22:11:43,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-11 22:14:34,106 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-11 22:14:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:14:34,617 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-11 22:14:34,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 22:14:34,617 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 85/119 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 1472245 conditions, 134094 events (85166/134093 cut-off events. For 1374834/3121546 co-relation queries the response was YES. Maximal size of possible extension queue 10847. Compared 1349895 event pairs, 2265 based on Foata normal form. 3848/130510 useless extension candidates. Maximal degree in co-relation 1471850. Up to 68389 conditions per place.). [2022-12-11 22:14:34,618 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-11 22:14:34,618 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-11 22:14:34,618 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-11 22:14:34,618 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-11 22:14:34,619 INFO L445 BasicCegarLoop]: Path program histogram: [8, 6, 1] [2022-12-11 22:14:34,621 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 22:14:34,621 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 22:14:34,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 10:14:34 BasicIcfg [2022-12-11 22:14:34,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 22:14:34,624 INFO L158 Benchmark]: Toolchain (without parser) took 799384.71ms. Allocated memory was 206.6MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 182.6MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 7.8GB. Max. memory is 8.0GB. [2022-12-11 22:14:34,624 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory was 182.5MB in the beginning and 182.4MB in the end (delta: 83.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 22:14:34,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.91ms. Allocated memory is still 206.6MB. Free memory was 182.3MB in the beginning and 170.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-11 22:14:34,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.03ms. Allocated memory is still 206.6MB. Free memory was 170.0MB in the beginning and 168.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 22:14:34,624 INFO L158 Benchmark]: Boogie Preprocessor took 30.80ms. Allocated memory is still 206.6MB. Free memory was 168.3MB in the beginning and 166.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 22:14:34,625 INFO L158 Benchmark]: RCFGBuilder took 403.56ms. Allocated memory is still 206.6MB. Free memory was 166.9MB in the beginning and 149.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-11 22:14:34,625 INFO L158 Benchmark]: TraceAbstraction took 798747.69ms. Allocated memory was 206.6MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 148.4MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 7.8GB. Max. memory is 8.0GB. [2022-12-11 22:14:34,626 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 206.6MB. Free memory was 182.5MB in the beginning and 182.4MB in the end (delta: 83.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 163.91ms. Allocated memory is still 206.6MB. Free memory was 182.3MB in the beginning and 170.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.03ms. Allocated memory is still 206.6MB. Free memory was 170.0MB in the beginning and 168.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.80ms. Allocated memory is still 206.6MB. Free memory was 168.3MB in the beginning and 166.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 403.56ms. Allocated memory is still 206.6MB. Free memory was 166.9MB in the beginning and 149.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 798747.69ms. Allocated memory was 206.6MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 148.4MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 7.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 85/119 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 1472245 conditions, 134094 events (85166/134093 cut-off events. For 1374834/3121546 co-relation queries the response was YES. Maximal size of possible extension queue 10847. Compared 1349895 event pairs, 2265 based on Foata normal form. 3848/130510 useless extension candidates. Maximal degree in co-relation 1471850. Up to 68389 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 85/119 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 1472245 conditions, 134094 events (85166/134093 cut-off events. For 1374834/3121546 co-relation queries the response was YES. Maximal size of possible extension queue 10847. Compared 1349895 event pairs, 2265 based on Foata normal form. 3848/130510 useless extension candidates. Maximal degree in co-relation 1471850. Up to 68389 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 85/119 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 1472245 conditions, 134094 events (85166/134093 cut-off events. For 1374834/3121546 co-relation queries the response was YES. Maximal size of possible extension queue 10847. Compared 1349895 event pairs, 2265 based on Foata normal form. 3848/130510 useless extension candidates. Maximal degree in co-relation 1471850. Up to 68389 conditions per place.). - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 85/119 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 1472245 conditions, 134094 events (85166/134093 cut-off events. For 1374834/3121546 co-relation queries the response was YES. Maximal size of possible extension queue 10847. Compared 1349895 event pairs, 2265 based on Foata normal form. 3848/130510 useless extension candidates. Maximal degree in co-relation 1471850. Up to 68389 conditions per place.). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 85/119 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 1472245 conditions, 134094 events (85166/134093 cut-off events. For 1374834/3121546 co-relation queries the response was YES. Maximal size of possible extension queue 10847. Compared 1349895 event pairs, 2265 based on Foata normal form. 3848/130510 useless extension candidates. Maximal degree in co-relation 1471850. Up to 68389 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 151 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 10.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 798.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 785.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1032 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1032 mSDsluCounter, 702 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 347 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2544 IncrementalHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 355 mSDtfsCounter, 2544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 363 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=363055occurred in iteration=14, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 23883 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1389 NumberOfCodeBlocks, 1389 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1534 ConstructedInterpolants, 0 QuantifiedInterpolants, 2689 SizeOfPredicates, 8 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 12/18 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