/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/pthread/triangular-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:14:31,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:14:31,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:14:31,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:14:31,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:14:31,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:14:31,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:14:31,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:14:31,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:14:31,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:14:31,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:14:31,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:14:31,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:14:31,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:14:31,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:14:31,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:14:31,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:14:31,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:14:31,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:14:31,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:14:31,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:14:31,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:14:31,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:14:31,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:14:31,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:14:31,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:14:31,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:14:31,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:14:31,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:14:31,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:14:31,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:14:31,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:14:31,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:14:31,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:14:31,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:14:31,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:14:31,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:14:31,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:14:31,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:14:31,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:14:31,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:14:31,770 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-06 16:14:31,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:14:31,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:14:31,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:14:31,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:14:31,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:14:31,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:14:31,787 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:14:31,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:14:31,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:14:31,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:14:31,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:14:31,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:14:31,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:14:31,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:14:31,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:14:31,799 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:14:31,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:14:31,800 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:14:31,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:14:31,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:14:31,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:14:31,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:14:31,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:14:31,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:14:31,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:14:31,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:14:31,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:14:31,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:14:31,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:14:31,801 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:14:31,801 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:14:31,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:14:32,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:14:32,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:14:32,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:14:32,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:14:32,066 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:14:32,067 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2022-12-06 16:14:32,973 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:14:33,228 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:14:33,229 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2022-12-06 16:14:33,261 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec7b581d0/72375b4f96704337bbcd275b53deddbe/FLAG5f00db5d2 [2022-12-06 16:14:33,286 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec7b581d0/72375b4f96704337bbcd275b53deddbe [2022-12-06 16:14:33,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:14:33,290 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:14:33,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:14:33,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:14:33,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:14:33,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1046bec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33, skipping insertion in model container [2022-12-06 16:14:33,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:14:33,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:14:33,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:14:33,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:14:33,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:14:33,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:14:33,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:14:33,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:14:33,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:14:33,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:14:33,603 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2022-12-06 16:14:33,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:14:33,611 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:14:33,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:14:33,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:14:33,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:14:33,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:14:33,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:14:33,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:14:33,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:14:33,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:14:33,655 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2022-12-06 16:14:33,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:14:33,677 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:14:33,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33 WrapperNode [2022-12-06 16:14:33,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:14:33,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:14:33,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:14:33,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:14:33,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,709 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-12-06 16:14:33,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:14:33,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:14:33,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:14:33,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:14:33,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,725 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:14:33,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:14:33,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:14:33,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:14:33,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (1/1) ... [2022-12-06 16:14:33,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:14:33,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:14:33,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 16:14:33,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 16:14:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 16:14:33,787 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 16:14:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 16:14:33,787 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 16:14:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:14:33,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:14:33,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:14:33,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:14:33,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:14:33,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:14:33,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:14:33,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:14:33,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:14:33,790 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:14:33,927 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:14:33,928 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:14:34,091 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:14:34,095 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:14:34,095 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 16:14:34,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:34 BoogieIcfgContainer [2022-12-06 16:14:34,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:14:34,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:14:34,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:14:34,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:14:34,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:14:33" (1/3) ... [2022-12-06 16:14:34,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ad042d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:14:34, skipping insertion in model container [2022-12-06 16:14:34,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:33" (2/3) ... [2022-12-06 16:14:34,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ad042d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:14:34, skipping insertion in model container [2022-12-06 16:14:34,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:34" (3/3) ... [2022-12-06 16:14:34,114 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2022-12-06 16:14:34,127 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:14:34,127 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 16:14:34,127 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:14:34,190 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:14:34,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 66 transitions, 142 flow [2022-12-06 16:14:34,263 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-06 16:14:34,264 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:14:34,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-06 16:14:34,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 66 transitions, 142 flow [2022-12-06 16:14:34,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 64 transitions, 134 flow [2022-12-06 16:14:34,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:14:34,283 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;@28f23e39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:14:34,283 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 16:14:34,297 INFO L130 PetriNetUnfolder]: 4/54 cut-off events. [2022-12-06 16:14:34,297 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:14:34,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:34,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:34,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:34,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:34,304 INFO L85 PathProgramCache]: Analyzing trace with hash -869864902, now seen corresponding path program 1 times [2022-12-06 16:14:34,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:34,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230903250] [2022-12-06 16:14:34,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:34,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:34,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:34,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230903250] [2022-12-06 16:14:34,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230903250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:14:34,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:14:34,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:14:34,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105940137] [2022-12-06 16:14:34,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:14:34,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:14:34,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:34,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:14:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:14:34,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:34,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 52.333333333333336) internal successors, (314), 6 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:34,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:34,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:34,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:34,933 INFO L130 PetriNetUnfolder]: 46/204 cut-off events. [2022-12-06 16:14:34,933 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 16:14:34,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 204 events. 46/204 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 790 event pairs, 3 based on Foata normal form. 49/233 useless extension candidates. Maximal degree in co-relation 259. Up to 32 conditions per place. [2022-12-06 16:14:34,936 INFO L137 encePairwiseOnDemand]: 55/66 looper letters, 14 selfloop transitions, 9 changer transitions 23/88 dead transitions. [2022-12-06 16:14:34,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 88 transitions, 263 flow [2022-12-06 16:14:34,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:14:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:14:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 573 transitions. [2022-12-06 16:14:34,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8681818181818182 [2022-12-06 16:14:34,949 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places. [2022-12-06 16:14:34,949 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 88 transitions, 263 flow [2022-12-06 16:14:34,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.333333333333336) internal successors, (314), 6 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:34,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:34,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:34,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:14:34,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1673234708, now seen corresponding path program 1 times [2022-12-06 16:14:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:34,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519071843] [2022-12-06 16:14:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:35,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:35,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519071843] [2022-12-06 16:14:35,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519071843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:14:35,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:14:35,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:14:35,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542459627] [2022-12-06 16:14:35,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:14:35,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:14:35,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:35,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:14:35,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:14:35,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:35,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 88 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:35,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:35,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:35,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:35,154 INFO L130 PetriNetUnfolder]: 46/217 cut-off events. [2022-12-06 16:14:35,154 INFO L131 PetriNetUnfolder]: For 34/66 co-relation queries the response was YES. [2022-12-06 16:14:35,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 217 events. 46/217 cut-off events. For 34/66 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 887 event pairs, 0 based on Foata normal form. 5/204 useless extension candidates. Maximal degree in co-relation 343. Up to 35 conditions per place. [2022-12-06 16:14:35,156 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 19 selfloop transitions, 9 changer transitions 40/110 dead transitions. [2022-12-06 16:14:35,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 110 transitions, 473 flow [2022-12-06 16:14:35,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 16:14:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 16:14:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 443 transitions. [2022-12-06 16:14:35,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8390151515151515 [2022-12-06 16:14:35,158 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2022-12-06 16:14:35,159 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 473 flow [2022-12-06 16:14:35,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:35,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:35,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:35,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:14:35,159 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:35,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:35,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1128844342, now seen corresponding path program 1 times [2022-12-06 16:14:35,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:35,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286727311] [2022-12-06 16:14:35,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:35,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:35,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286727311] [2022-12-06 16:14:35,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286727311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:14:35,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:14:35,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:14:35,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396280143] [2022-12-06 16:14:35,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:14:35,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:14:35,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:35,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:14:35,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:14:35,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:35,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 110 transitions, 473 flow. Second operand has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:35,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:35,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:35,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:35,427 INFO L130 PetriNetUnfolder]: 68/321 cut-off events. [2022-12-06 16:14:35,428 INFO L131 PetriNetUnfolder]: For 141/233 co-relation queries the response was YES. [2022-12-06 16:14:35,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 321 events. 68/321 cut-off events. For 141/233 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1599 event pairs, 0 based on Foata normal form. 24/318 useless extension candidates. Maximal degree in co-relation 620. Up to 59 conditions per place. [2022-12-06 16:14:35,433 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 25 selfloop transitions, 11 changer transitions 60/138 dead transitions. [2022-12-06 16:14:35,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 138 transitions, 819 flow [2022-12-06 16:14:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:14:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:14:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 554 transitions. [2022-12-06 16:14:35,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8393939393939394 [2022-12-06 16:14:35,436 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places. [2022-12-06 16:14:35,436 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 138 transitions, 819 flow [2022-12-06 16:14:35,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:35,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:35,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:35,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:14:35,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:35,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:35,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1724335678, now seen corresponding path program 2 times [2022-12-06 16:14:35,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:35,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604917455] [2022-12-06 16:14:35,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:35,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:35,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:35,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604917455] [2022-12-06 16:14:35,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604917455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:14:35,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:14:35,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:14:35,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217673790] [2022-12-06 16:14:35,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:14:35,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:14:35,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:14:35,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:14:35,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:35,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 138 transitions, 819 flow. Second operand has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:35,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:35,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:35,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:35,653 INFO L130 PetriNetUnfolder]: 69/329 cut-off events. [2022-12-06 16:14:35,653 INFO L131 PetriNetUnfolder]: For 277/380 co-relation queries the response was YES. [2022-12-06 16:14:35,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 329 events. 69/329 cut-off events. For 277/380 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1664 event pairs, 0 based on Foata normal form. 25/329 useless extension candidates. Maximal degree in co-relation 741. Up to 57 conditions per place. [2022-12-06 16:14:35,655 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 22 selfloop transitions, 12 changer transitions 76/152 dead transitions. [2022-12-06 16:14:35,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 152 transitions, 1137 flow [2022-12-06 16:14:35,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:14:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:14:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 492 transitions. [2022-12-06 16:14:35,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8282828282828283 [2022-12-06 16:14:35,657 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 32 predicate places. [2022-12-06 16:14:35,657 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 152 transitions, 1137 flow [2022-12-06 16:14:35,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:35,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:35,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:35,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:14:35,658 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:35,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash 326321538, now seen corresponding path program 1 times [2022-12-06 16:14:35,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:35,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872326393] [2022-12-06 16:14:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:35,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:35,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:35,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872326393] [2022-12-06 16:14:35,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872326393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:14:35,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:14:35,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:14:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115426482] [2022-12-06 16:14:35,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:14:35,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:14:35,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:35,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:14:35,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:14:35,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:35,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 152 transitions, 1137 flow. Second operand has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:35,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:35,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:35,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:35,914 INFO L130 PetriNetUnfolder]: 91/441 cut-off events. [2022-12-06 16:14:35,914 INFO L131 PetriNetUnfolder]: For 574/685 co-relation queries the response was YES. [2022-12-06 16:14:35,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 441 events. 91/441 cut-off events. For 574/685 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2474 event pairs, 0 based on Foata normal form. 31/436 useless extension candidates. Maximal degree in co-relation 1130. Up to 76 conditions per place. [2022-12-06 16:14:35,916 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 22 selfloop transitions, 19 changer transitions 103/186 dead transitions. [2022-12-06 16:14:35,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 186 transitions, 1751 flow [2022-12-06 16:14:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 16:14:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 16:14:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 653 transitions. [2022-12-06 16:14:35,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8244949494949495 [2022-12-06 16:14:35,919 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 43 predicate places. [2022-12-06 16:14:35,919 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 186 transitions, 1751 flow [2022-12-06 16:14:35,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:35,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:35,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:35,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:14:35,920 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:35,921 INFO L85 PathProgramCache]: Analyzing trace with hash 661120386, now seen corresponding path program 2 times [2022-12-06 16:14:35,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:35,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521352713] [2022-12-06 16:14:35,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:35,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:36,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521352713] [2022-12-06 16:14:36,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521352713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:14:36,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:14:36,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:14:36,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498746155] [2022-12-06 16:14:36,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:14:36,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:14:36,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:36,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:14:36,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:14:36,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:36,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 186 transitions, 1751 flow. Second operand has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:36,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:36,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:36,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:36,167 INFO L130 PetriNetUnfolder]: 110/505 cut-off events. [2022-12-06 16:14:36,167 INFO L131 PetriNetUnfolder]: For 1000/1209 co-relation queries the response was YES. [2022-12-06 16:14:36,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 505 events. 110/505 cut-off events. For 1000/1209 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3012 event pairs, 0 based on Foata normal form. 60/528 useless extension candidates. Maximal degree in co-relation 1509. Up to 98 conditions per place. [2022-12-06 16:14:36,169 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 34 selfloop transitions, 16 changer transitions 123/215 dead transitions. [2022-12-06 16:14:36,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 215 transitions, 2431 flow [2022-12-06 16:14:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 16:14:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 16:14:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 607 transitions. [2022-12-06 16:14:36,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8360881542699724 [2022-12-06 16:14:36,173 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2022-12-06 16:14:36,173 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 215 transitions, 2431 flow [2022-12-06 16:14:36,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:36,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:36,174 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:36,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:14:36,174 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash 298308350, now seen corresponding path program 1 times [2022-12-06 16:14:36,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:36,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901458173] [2022-12-06 16:14:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:36,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:36,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901458173] [2022-12-06 16:14:36,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901458173] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:14:36,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010573255] [2022-12-06 16:14:36,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:36,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:36,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:14:36,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:14:36,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 16:14:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:36,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 16:14:36,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:14:36,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:36,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:14:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:36,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010573255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:14:36,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:14:36,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-12-06 16:14:36,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152699172] [2022-12-06 16:14:36,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:14:36,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 16:14:36,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:36,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 16:14:36,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-06 16:14:36,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:36,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 215 transitions, 2431 flow. Second operand has 13 states, 13 states have (on average 52.61538461538461) internal successors, (684), 13 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:36,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:36,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:36,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:36,900 INFO L130 PetriNetUnfolder]: 182/874 cut-off events. [2022-12-06 16:14:36,901 INFO L131 PetriNetUnfolder]: For 2185/2412 co-relation queries the response was YES. [2022-12-06 16:14:36,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2878 conditions, 874 events. 182/874 cut-off events. For 2185/2412 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5654 event pairs, 0 based on Foata normal form. 46/843 useless extension candidates. Maximal degree in co-relation 2818. Up to 168 conditions per place. [2022-12-06 16:14:36,905 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 34 selfloop transitions, 36 changer transitions 213/325 dead transitions. [2022-12-06 16:14:36,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 325 transitions, 4523 flow [2022-12-06 16:14:36,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 16:14:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 16:14:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1195 transitions. [2022-12-06 16:14:36,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8230027548209367 [2022-12-06 16:14:36,908 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 74 predicate places. [2022-12-06 16:14:36,908 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 325 transitions, 4523 flow [2022-12-06 16:14:36,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 52.61538461538461) internal successors, (684), 13 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:36,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:36,909 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:36,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 16:14:37,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:37,120 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:37,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:37,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2122461287, now seen corresponding path program 1 times [2022-12-06 16:14:37,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:37,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357190663] [2022-12-06 16:14:37,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:37,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 16:14:37,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:37,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357190663] [2022-12-06 16:14:37,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357190663] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:14:37,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947142951] [2022-12-06 16:14:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:37,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:37,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:14:37,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:14:37,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 16:14:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:37,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 16:14:37,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:14:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 16:14:37,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:14:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 16:14:37,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947142951] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:14:37,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:14:37,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2022-12-06 16:14:37,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663560304] [2022-12-06 16:14:37,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:14:37,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 16:14:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:37,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 16:14:37,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 16:14:37,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:37,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 325 transitions, 4523 flow. Second operand has 17 states, 17 states have (on average 52.588235294117645) internal successors, (894), 17 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:37,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:37,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:37,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:38,161 INFO L130 PetriNetUnfolder]: 372/1852 cut-off events. [2022-12-06 16:14:38,161 INFO L131 PetriNetUnfolder]: For 5835/6234 co-relation queries the response was YES. [2022-12-06 16:14:38,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6477 conditions, 1852 events. 372/1852 cut-off events. For 5835/6234 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 13639 event pairs, 0 based on Foata normal form. 68/1749 useless extension candidates. Maximal degree in co-relation 6412. Up to 358 conditions per place. [2022-12-06 16:14:38,169 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 71 selfloop transitions, 27 changer transitions 477/617 dead transitions. [2022-12-06 16:14:38,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 617 transitions, 10331 flow [2022-12-06 16:14:38,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 16:14:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 16:14:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1647 transitions. [2022-12-06 16:14:38,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8318181818181818 [2022-12-06 16:14:38,172 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 103 predicate places. [2022-12-06 16:14:38,172 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 617 transitions, 10331 flow [2022-12-06 16:14:38,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 52.588235294117645) internal successors, (894), 17 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:38,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:38,173 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:38,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 16:14:38,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-06 16:14:38,380 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash 865146735, now seen corresponding path program 2 times [2022-12-06 16:14:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:38,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323646900] [2022-12-06 16:14:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:38,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:14:38,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:38,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323646900] [2022-12-06 16:14:38,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323646900] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:14:38,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996008601] [2022-12-06 16:14:38,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 16:14:38,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:38,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:14:38,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:14:38,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 16:14:38,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 16:14:38,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:14:38,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 16:14:38,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:14:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:14:38,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:14:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:14:38,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996008601] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:14:38,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:14:38,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-12-06 16:14:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457527327] [2022-12-06 16:14:38,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:14:38,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 16:14:38,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:38,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 16:14:38,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-06 16:14:38,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:38,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 617 transitions, 10331 flow. Second operand has 18 states, 18 states have (on average 52.611111111111114) internal successors, (947), 18 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:38,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:38,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:38,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:39,665 INFO L130 PetriNetUnfolder]: 642/3147 cut-off events. [2022-12-06 16:14:39,665 INFO L131 PetriNetUnfolder]: For 12773/13830 co-relation queries the response was YES. [2022-12-06 16:14:39,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12129 conditions, 3147 events. 642/3147 cut-off events. For 12773/13830 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 28198 event pairs, 0 based on Foata normal form. 148/3009 useless extension candidates. Maximal degree in co-relation 12059. Up to 616 conditions per place. [2022-12-06 16:14:39,677 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 92 selfloop transitions, 78 changer transitions 825/1037 dead transitions. [2022-12-06 16:14:39,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 1037 transitions, 19867 flow [2022-12-06 16:14:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 16:14:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 16:14:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2118 transitions. [2022-12-06 16:14:39,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8228438228438228 [2022-12-06 16:14:39,682 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 141 predicate places. [2022-12-06 16:14:39,682 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 1037 transitions, 19867 flow [2022-12-06 16:14:39,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 52.611111111111114) internal successors, (947), 18 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:39,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:39,682 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:39,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 16:14:39,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:39,887 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1276573229, now seen corresponding path program 3 times [2022-12-06 16:14:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:39,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566592344] [2022-12-06 16:14:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:14:39,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:39,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566592344] [2022-12-06 16:14:39,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566592344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:14:39,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343710084] [2022-12-06 16:14:39,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 16:14:39,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:39,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:14:39,988 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:14:39,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 16:14:40,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 16:14:40,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:14:40,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 16:14:40,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:14:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:14:40,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:14:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:14:40,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343710084] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:14:40,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:14:40,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-12-06 16:14:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883399275] [2022-12-06 16:14:40,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:14:40,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 16:14:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 16:14:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-12-06 16:14:40,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:40,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 1037 transitions, 19867 flow. Second operand has 18 states, 18 states have (on average 52.611111111111114) internal successors, (947), 18 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:40,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:40,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:40,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:41,380 INFO L130 PetriNetUnfolder]: 861/4247 cut-off events. [2022-12-06 16:14:41,380 INFO L131 PetriNetUnfolder]: For 20881/21921 co-relation queries the response was YES. [2022-12-06 16:14:41,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17596 conditions, 4247 events. 861/4247 cut-off events. For 20881/21921 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 40945 event pairs, 0 based on Foata normal form. 160/4010 useless extension candidates. Maximal degree in co-relation 17521. Up to 833 conditions per place. [2022-12-06 16:14:41,398 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 109 selfloop transitions, 131 changer transitions 1092/1374 dead transitions. [2022-12-06 16:14:41,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 1374 transitions, 29257 flow [2022-12-06 16:14:41,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-06 16:14:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-06 16:14:41,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 2280 transitions. [2022-12-06 16:14:41,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8225108225108225 [2022-12-06 16:14:41,401 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 182 predicate places. [2022-12-06 16:14:41,401 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 1374 transitions, 29257 flow [2022-12-06 16:14:41,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 52.611111111111114) internal successors, (947), 18 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:41,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:41,402 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:41,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 16:14:41,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:41,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1253893827, now seen corresponding path program 4 times [2022-12-06 16:14:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:41,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527216021] [2022-12-06 16:14:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:41,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:41,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527216021] [2022-12-06 16:14:41,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527216021] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:14:41,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570821183] [2022-12-06 16:14:41,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 16:14:41,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:41,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:14:41,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:14:41,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 16:14:41,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 16:14:41,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:14:41,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 16:14:41,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:14:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:41,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:14:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:14:42,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570821183] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:14:42,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:14:42,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2022-12-06 16:14:42,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003962025] [2022-12-06 16:14:42,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:14:42,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 16:14:42,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:42,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 16:14:42,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2022-12-06 16:14:42,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:42,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 1374 transitions, 29257 flow. Second operand has 26 states, 26 states have (on average 52.30769230769231) internal successors, (1360), 26 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:42,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:42,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:42,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:44,173 INFO L130 PetriNetUnfolder]: 1347/6731 cut-off events. [2022-12-06 16:14:44,174 INFO L131 PetriNetUnfolder]: For 39949/41349 co-relation queries the response was YES. [2022-12-06 16:14:44,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29576 conditions, 6731 events. 1347/6731 cut-off events. For 39949/41349 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 66582 event pairs, 0 based on Foata normal form. 168/6259 useless extension candidates. Maximal degree in co-relation 29496. Up to 1317 conditions per place. [2022-12-06 16:14:44,196 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 153 selfloop transitions, 187 changer transitions 1734/2116 dead transitions. [2022-12-06 16:14:44,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 2116 transitions, 49715 flow [2022-12-06 16:14:44,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-06 16:14:44,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-12-06 16:14:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 3145 transitions. [2022-12-06 16:14:44,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8215778474399164 [2022-12-06 16:14:44,201 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 239 predicate places. [2022-12-06 16:14:44,201 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 2116 transitions, 49715 flow [2022-12-06 16:14:44,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 52.30769230769231) internal successors, (1360), 26 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:44,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:44,202 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:44,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 16:14:44,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 16:14:44,406 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:44,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:44,406 INFO L85 PathProgramCache]: Analyzing trace with hash -969560773, now seen corresponding path program 5 times [2022-12-06 16:14:44,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:44,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441435254] [2022-12-06 16:14:44,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:44,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:14:44,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:44,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441435254] [2022-12-06 16:14:44,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441435254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:14:44,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712330088] [2022-12-06 16:14:44,787 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 16:14:44,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:44,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:14:44,788 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:14:44,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 16:14:44,858 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-12-06 16:14:44,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:14:44,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 16:14:44,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:14:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:14:45,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:14:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:14:45,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712330088] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:14:45,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:14:45,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 41 [2022-12-06 16:14:45,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171449655] [2022-12-06 16:14:45,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:14:45,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-06 16:14:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:45,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-06 16:14:45,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2022-12-06 16:14:45,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:45,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 2116 transitions, 49715 flow. Second operand has 41 states, 41 states have (on average 52.24390243902439) internal successors, (2142), 41 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:45,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:45,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:45,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:47,693 INFO L130 PetriNetUnfolder]: 1587/7933 cut-off events. [2022-12-06 16:14:47,694 INFO L131 PetriNetUnfolder]: For 56473/58100 co-relation queries the response was YES. [2022-12-06 16:14:47,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37270 conditions, 7933 events. 1587/7933 cut-off events. For 56473/58100 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 78266 event pairs, 0 based on Foata normal form. 119/7294 useless extension candidates. Maximal degree in co-relation 37185. Up to 1557 conditions per place. [2022-12-06 16:14:47,718 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 325 selfloop transitions, 47 changer transitions 2070/2484 dead transitions. [2022-12-06 16:14:47,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 2484 transitions, 63417 flow [2022-12-06 16:14:47,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-06 16:14:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-06 16:14:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2735 transitions. [2022-12-06 16:14:47,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8287878787878787 [2022-12-06 16:14:47,721 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 288 predicate places. [2022-12-06 16:14:47,722 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 2484 transitions, 63417 flow [2022-12-06 16:14:47,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 52.24390243902439) internal successors, (2142), 41 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:47,722 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:47,722 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:47,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 16:14:47,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:47,929 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:47,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:47,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1128146485, now seen corresponding path program 6 times [2022-12-06 16:14:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:47,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072686799] [2022-12-06 16:14:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 16:14:48,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:48,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072686799] [2022-12-06 16:14:48,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072686799] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:14:48,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488645441] [2022-12-06 16:14:48,342 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 16:14:48,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:48,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:14:48,344 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:14:48,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 16:14:48,414 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-12-06 16:14:48,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:14:48,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 16:14:48,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:14:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 16:14:48,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:14:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 16:14:49,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488645441] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:14:49,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:14:49,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 41 [2022-12-06 16:14:49,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797592336] [2022-12-06 16:14:49,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:14:49,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-06 16:14:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:49,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-06 16:14:49,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2022-12-06 16:14:49,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:49,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 2484 transitions, 63417 flow. Second operand has 41 states, 41 states have (on average 52.24390243902439) internal successors, (2142), 41 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:49,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:49,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:49,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:14:53,562 INFO L130 PetriNetUnfolder]: 2683/13504 cut-off events. [2022-12-06 16:14:53,563 INFO L131 PetriNetUnfolder]: For 111666/114328 co-relation queries the response was YES. [2022-12-06 16:14:53,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67216 conditions, 13504 events. 2683/13504 cut-off events. For 111666/114328 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 150629 event pairs, 0 based on Foata normal form. 224/12425 useless extension candidates. Maximal degree in co-relation 67126. Up to 2635 conditions per place. [2022-12-06 16:14:53,609 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 342 selfloop transitions, 202 changer transitions 3585/4171 dead transitions. [2022-12-06 16:14:53,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 4171 transitions, 115523 flow [2022-12-06 16:14:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-12-06 16:14:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2022-12-06 16:14:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 4670 transitions. [2022-12-06 16:14:53,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8227625088090205 [2022-12-06 16:14:53,614 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 373 predicate places. [2022-12-06 16:14:53,615 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 4171 transitions, 115523 flow [2022-12-06 16:14:53,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 52.24390243902439) internal successors, (2142), 41 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:53,615 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:14:53,616 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:14:53,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 16:14:53,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:53,821 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:14:53,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:14:53,821 INFO L85 PathProgramCache]: Analyzing trace with hash 354655595, now seen corresponding path program 7 times [2022-12-06 16:14:53,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:14:53,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578095992] [2022-12-06 16:14:53,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:14:53,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:14:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 16:14:54,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:14:54,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578095992] [2022-12-06 16:14:54,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578095992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:14:54,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546749809] [2022-12-06 16:14:54,148 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 16:14:54,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:14:54,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:14:54,149 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:14:54,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 16:14:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:14:54,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 16:14:54,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:14:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 16:14:54,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:14:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 16:14:54,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546749809] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:14:54,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:14:54,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 41 [2022-12-06 16:14:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542012787] [2022-12-06 16:14:54,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:14:54,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-06 16:14:54,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:14:54,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-06 16:14:54,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1375, Unknown=0, NotChecked=0, Total=1640 [2022-12-06 16:14:54,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:14:54,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 4171 transitions, 115523 flow. Second operand has 41 states, 41 states have (on average 52.24390243902439) internal successors, (2142), 41 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:14:54,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:14:54,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:14:54,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:15:03,132 INFO L130 PetriNetUnfolder]: 3517/17536 cut-off events. [2022-12-06 16:15:03,133 INFO L131 PetriNetUnfolder]: For 172806/178138 co-relation queries the response was YES. [2022-12-06 16:15:03,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93509 conditions, 17536 events. 3517/17536 cut-off events. For 172806/178138 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 206459 event pairs, 0 based on Foata normal form. 522/16387 useless extension candidates. Maximal degree in co-relation 93414. Up to 3465 conditions per place. [2022-12-06 16:15:03,198 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 368 selfloop transitions, 352 changer transitions 4704/5466 dead transitions. [2022-12-06 16:15:03,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 5466 transitions, 162617 flow [2022-12-06 16:15:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-12-06 16:15:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2022-12-06 16:15:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 4776 transitions. [2022-12-06 16:15:03,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8223140495867769 [2022-12-06 16:15:03,203 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 460 predicate places. [2022-12-06 16:15:03,203 INFO L495 AbstractCegarLoop]: Abstraction has has 526 places, 5466 transitions, 162617 flow [2022-12-06 16:15:03,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 52.24390243902439) internal successors, (2142), 41 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:15:03,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:15:03,204 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:15:03,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 16:15:03,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 16:15:03,420 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:15:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:15:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2003515795, now seen corresponding path program 8 times [2022-12-06 16:15:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:15:03,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881496547] [2022-12-06 16:15:03,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:15:03,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:15:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:15:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:15:03,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:15:03,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881496547] [2022-12-06 16:15:03,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881496547] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:15:03,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882836610] [2022-12-06 16:15:03,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 16:15:03,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:15:03,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:15:03,799 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:15:03,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 16:15:03,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 16:15:03,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:15:03,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 16:15:03,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:15:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:15:04,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:15:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:15:04,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882836610] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:15:04,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:15:04,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2022-12-06 16:15:04,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183771600] [2022-12-06 16:15:04,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:15:04,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-06 16:15:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:15:04,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-06 16:15:04,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1470, Unknown=0, NotChecked=0, Total=1722 [2022-12-06 16:15:04,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:15:04,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 5466 transitions, 162617 flow. Second operand has 42 states, 42 states have (on average 52.26190476190476) internal successors, (2195), 42 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:15:04,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:15:04,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:15:04,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:15:16,165 INFO L130 PetriNetUnfolder]: 3949/19897 cut-off events. [2022-12-06 16:15:16,166 INFO L131 PetriNetUnfolder]: For 224198/230022 co-relation queries the response was YES. [2022-12-06 16:15:16,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111496 conditions, 19897 events. 3949/19897 cut-off events. For 224198/230022 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 242576 event pairs, 0 based on Foata normal form. 482/18492 useless extension candidates. Maximal degree in co-relation 111396. Up to 3912 conditions per place. [2022-12-06 16:15:16,244 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 431 selfloop transitions, 462 changer transitions 5211/6146 dead transitions. [2022-12-06 16:15:16,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 6146 transitions, 195211 flow [2022-12-06 16:15:16,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-12-06 16:15:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2022-12-06 16:15:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 4494 transitions. [2022-12-06 16:15:16,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8203723986856517 [2022-12-06 16:15:16,247 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 542 predicate places. [2022-12-06 16:15:16,247 INFO L495 AbstractCegarLoop]: Abstraction has has 608 places, 6146 transitions, 195211 flow [2022-12-06 16:15:16,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 52.26190476190476) internal successors, (2195), 42 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:15:16,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:15:16,248 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:15:16,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 16:15:16,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 16:15:16,453 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:15:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:15:16,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1925501467, now seen corresponding path program 9 times [2022-12-06 16:15:16,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:15:16,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509731526] [2022-12-06 16:15:16,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:15:16,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:15:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:15:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:15:16,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:15:16,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509731526] [2022-12-06 16:15:16,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509731526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:15:16,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65523819] [2022-12-06 16:15:16,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 16:15:16,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:15:16,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:15:16,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:15:16,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 16:15:16,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-06 16:15:16,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:15:16,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 16:15:16,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:15:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:15:17,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:15:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:15:17,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65523819] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:15:17,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:15:17,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 41 [2022-12-06 16:15:17,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489814497] [2022-12-06 16:15:17,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:15:17,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-06 16:15:17,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:15:17,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-06 16:15:17,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1279, Unknown=0, NotChecked=0, Total=1640 [2022-12-06 16:15:17,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:15:17,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 6146 transitions, 195211 flow. Second operand has 41 states, 41 states have (on average 52.24390243902439) internal successors, (2142), 41 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:15:17,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:15:17,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:15:17,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:15:32,005 INFO L130 PetriNetUnfolder]: 4136/20638 cut-off events. [2022-12-06 16:15:32,005 INFO L131 PetriNetUnfolder]: For 267034/274103 co-relation queries the response was YES. [2022-12-06 16:15:32,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123015 conditions, 20638 events. 4136/20638 cut-off events. For 267034/274103 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 253009 event pairs, 0 based on Foata normal form. 620/19308 useless extension candidates. Maximal degree in co-relation 122910. Up to 4113 conditions per place. [2022-12-06 16:15:32,070 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 455 selfloop transitions, 521 changer transitions 5408/6426 dead transitions. [2022-12-06 16:15:32,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 6426 transitions, 216925 flow [2022-12-06 16:15:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-12-06 16:15:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-12-06 16:15:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 4229 transitions. [2022-12-06 16:15:32,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8214840714840714 [2022-12-06 16:15:32,074 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 619 predicate places. [2022-12-06 16:15:32,074 INFO L495 AbstractCegarLoop]: Abstraction has has 685 places, 6426 transitions, 216925 flow [2022-12-06 16:15:32,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 52.24390243902439) internal successors, (2142), 41 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:15:32,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:15:32,075 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:15:32,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-06 16:15:32,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 16:15:32,279 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:15:32,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:15:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1367522679, now seen corresponding path program 10 times [2022-12-06 16:15:32,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:15:32,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546789441] [2022-12-06 16:15:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:15:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:15:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:15:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:15:32,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:15:32,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546789441] [2022-12-06 16:15:32,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546789441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 16:15:32,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008295714] [2022-12-06 16:15:32,580 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 16:15:32,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 16:15:32,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:15:32,581 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 16:15:32,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 16:15:32,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 16:15:32,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 16:15:32,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 16:15:32,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 16:15:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:15:32,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 16:15:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 16:15:33,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008295714] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 16:15:33,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 16:15:33,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 43 [2022-12-06 16:15:33,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341470133] [2022-12-06 16:15:33,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 16:15:33,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-06 16:15:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:15:33,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-06 16:15:33,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1413, Unknown=0, NotChecked=0, Total=1806 [2022-12-06 16:15:33,094 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-06 16:15:33,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 6426 transitions, 216925 flow. Second operand has 43 states, 43 states have (on average 52.23255813953488) internal successors, (2246), 43 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:15:33,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:15:33,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-06 16:15:33,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:15:49,635 INFO L130 PetriNetUnfolder]: 4365/21970 cut-off events. [2022-12-06 16:15:49,636 INFO L131 PetriNetUnfolder]: For 317454/323808 co-relation queries the response was YES. [2022-12-06 16:15:49,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136746 conditions, 21970 events. 4365/21970 cut-off events. For 317454/323808 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 270658 event pairs, 0 based on Foata normal form. 488/20373 useless extension candidates. Maximal degree in co-relation 136636. Up to 4347 conditions per place. [2022-12-06 16:15:49,710 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 512 selfloop transitions, 517 changer transitions 5708/6779 dead transitions. [2022-12-06 16:15:49,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 6779 transitions, 242387 flow [2022-12-06 16:15:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-12-06 16:15:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2022-12-06 16:15:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 3680 transitions. [2022-12-06 16:15:49,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8199643493761141 [2022-12-06 16:15:49,713 INFO L294 CegarLoopForPetriNet]: 66 programPoint places, 686 predicate places. [2022-12-06 16:15:49,713 INFO L495 AbstractCegarLoop]: Abstraction has has 752 places, 6779 transitions, 242387 flow [2022-12-06 16:15:49,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 52.23255813953488) internal successors, (2246), 43 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:15:49,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:15:49,714 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:15:49,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 16:15:49,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 16:15:49,919 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 16:15:49,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:15:49,919 INFO L85 PathProgramCache]: Analyzing trace with hash 128580999, now seen corresponding path program 11 times [2022-12-06 16:15:49,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:15:49,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529089559] [2022-12-06 16:15:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:15:49,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:15:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:15:49,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:15:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:15:49,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:15:49,968 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:15:49,968 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 16:15:49,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 16:15:49,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 16:15:49,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 16:15:49,970 INFO L458 BasicCegarLoop]: Path program histogram: [11, 2, 2, 1, 1, 1] [2022-12-06 16:15:49,973 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:15:49,973 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:15:50,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:15:50 BasicIcfg [2022-12-06 16:15:50,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:15:50,045 INFO L158 Benchmark]: Toolchain (without parser) took 76755.48ms. Allocated memory was 201.3MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 175.5MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 782.3MB. Max. memory is 8.0GB. [2022-12-06 16:15:50,045 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory was 178.2MB in the beginning and 178.1MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:15:50,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.03ms. Allocated memory is still 201.3MB. Free memory was 175.5MB in the beginning and 155.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 16:15:50,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.79ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 153.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 16:15:50,046 INFO L158 Benchmark]: Boogie Preprocessor took 17.10ms. Allocated memory is still 201.3MB. Free memory was 153.6MB in the beginning and 152.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:15:50,046 INFO L158 Benchmark]: RCFGBuilder took 368.75ms. Allocated memory is still 201.3MB. Free memory was 152.0MB in the beginning and 139.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 16:15:50,046 INFO L158 Benchmark]: TraceAbstraction took 75946.43ms. Allocated memory was 201.3MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 138.9MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 745.6MB. Max. memory is 8.0GB. [2022-12-06 16:15:50,047 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory was 178.2MB in the beginning and 178.1MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 385.03ms. Allocated memory is still 201.3MB. Free memory was 175.5MB in the beginning and 155.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.79ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 153.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.10ms. Allocated memory is still 201.3MB. Free memory was 153.6MB in the beginning and 152.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 368.75ms. Allocated memory is still 201.3MB. Free memory was 152.0MB in the beginning and 139.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 75946.43ms. Allocated memory was 201.3MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 138.9MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 745.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; VAL [i=3, j=6] [L712] 0 pthread_t id1, id2; VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, i=3, id1={5:0}, id2={3:0}, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, i=3, id1={5:0}, id2={3:0}, j=6, pthread_create(&id1, ((void *)0), t1, ((void *)0))=6] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, i=3, id1={5:0}, id2={3:0}, j=6, pthread_create(&id2, ((void *)0), t2, ((void *)0))=7] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1] [L716] 0 int condI = i >= (2*10 +6); VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, i=7, id1={5:0}, id2={3:0}, j=6, k=1] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=0, k=1] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=1] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=1] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=1] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=1, k=2] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=2] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=2] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=3] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=3] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=3] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, k=3] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=3, k=5] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, k=4] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=4] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=6, k=4] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=4, k=6] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=5] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=6] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=7] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=7, k=5] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=7, k=6] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=6] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=6, k=7] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=7] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=7] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=7, k=8] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=8] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=8] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=8, k=9] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9, k=9] [L722] 0 reach_error() VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9, k=9] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 84 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 75.8s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 63.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5143 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5143 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 585 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3617 IncrementalHoareTripleChecker+Invalid, 4202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 585 mSolverCounterUnsat, 88 mSDtfsCounter, 3617 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2853 GetRequests, 1902 SyntacticMatches, 4 SemanticMatches, 947 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28998 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242387occurred in iteration=17, InterpolantAutomatonStates: 704, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2400 NumberOfCodeBlocks, 2395 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 3256 ConstructedInterpolants, 0 QuantifiedInterpolants, 13553 SizeOfPredicates, 141 NumberOfNonLiveVariables, 2303 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 39 InterpolantComputations, 6 PerfectInterpolantSequences, 99/6207 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 16:15:50,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...