/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -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-a802222-m [2022-12-12 11:38:34,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:38:34,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:38:34,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:38:34,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:38:34,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:38:34,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:38:34,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:38:34,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:38:34,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:38:34,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:38:34,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:38:34,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:38:34,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:38:34,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:38:34,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:38:34,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:38:34,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:38:34,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:38:34,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:38:34,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:38:34,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:38:34,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:38:34,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:38:34,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:38:34,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:38:34,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:38:34,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:38:34,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:38:34,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:38:34,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:38:34,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:38:34,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:38:34,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:38:34,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:38:34,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:38:34,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:38:34,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:38:34,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:38:34,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:38:34,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:38:34,276 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-12 11:38:34,301 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:38:34,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:38:34,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:38:34,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:38:34,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:38:34,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:38:34,317 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:38:34,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:38:34,317 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:38:34,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:38:34,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:38:34,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:38:34,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:38:34,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:38:34,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:38:34,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:38:34,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:38:34,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:38:34,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:38:34,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:38:34,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:38:34,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:38:34,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:38:34,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:38:34,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:38:34,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:38:34,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:38:34,319 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:38:34,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:38:34,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:38:34,320 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:38:34,320 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 11:38:34,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:38:34,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:38:34,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:38:34,585 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:38:34,585 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:38:34,586 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-12 11:38:35,450 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:38:35,668 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:38:35,668 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2022-12-12 11:38:35,680 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cabfbd2/5e3eb7061f0c45ee9cb673bc4825f94a/FLAG02634ff89 [2022-12-12 11:38:35,689 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cabfbd2/5e3eb7061f0c45ee9cb673bc4825f94a [2022-12-12 11:38:35,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:38:35,692 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:38:35,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:38:35,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:38:35,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:38:35,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:38:35" (1/1) ... [2022-12-12 11:38:35,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcb53d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:35, skipping insertion in model container [2022-12-12 11:38:35,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:38:35" (1/1) ... [2022-12-12 11:38:35,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:38:35,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:38:35,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:38:35,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:38:35,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:38:35,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:38:35,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:38:35,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:38:35,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:38:35,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:38:35,944 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-12 11:38:35,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:38:35,952 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:38:35,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:38:35,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:38:35,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:38:35,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:38:35,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:38:35,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:38:35,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:38:35,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:38:35,995 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-12 11:38:35,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:38:36,028 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:38:36,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36 WrapperNode [2022-12-12 11:38:36,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:38:36,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:38:36,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:38:36,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:38:36,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (1/1) ... [2022-12-12 11:38:36,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (1/1) ... [2022-12-12 11:38:36,073 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-12-12 11:38:36,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:38:36,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:38:36,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:38:36,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:38:36,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (1/1) ... [2022-12-12 11:38:36,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (1/1) ... [2022-12-12 11:38:36,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (1/1) ... [2022-12-12 11:38:36,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (1/1) ... [2022-12-12 11:38:36,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (1/1) ... [2022-12-12 11:38:36,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (1/1) ... [2022-12-12 11:38:36,103 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (1/1) ... [2022-12-12 11:38:36,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (1/1) ... [2022-12-12 11:38:36,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:38:36,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:38:36,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:38:36,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:38:36,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (1/1) ... [2022-12-12 11:38:36,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:38:36,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:38:36,145 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-12 11:38:36,146 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-12 11:38:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-12 11:38:36,175 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-12 11:38:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-12 11:38:36,175 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-12 11:38:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:38:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 11:38:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:38:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:38:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:38:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:38:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 11:38:36,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:38:36,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:38:36,176 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 11:38:36,253 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:38:36,254 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:38:36,409 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:38:36,414 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:38:36,414 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-12 11:38:36,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:38:36 BoogieIcfgContainer [2022-12-12 11:38:36,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:38:36,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:38:36,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:38:36,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:38:36,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:38:35" (1/3) ... [2022-12-12 11:38:36,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9efa911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:38:36, skipping insertion in model container [2022-12-12 11:38:36,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:38:36" (2/3) ... [2022-12-12 11:38:36,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9efa911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:38:36, skipping insertion in model container [2022-12-12 11:38:36,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:38:36" (3/3) ... [2022-12-12 11:38:36,421 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2022-12-12 11:38:36,434 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:38:36,434 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 11:38:36,434 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:38:36,497 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 11:38:36,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 66 transitions, 142 flow [2022-12-12 11:38:36,567 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-12 11:38:36,567 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:38:36,573 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-12 11:38:36,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 66 transitions, 142 flow [2022-12-12 11:38:36,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 64 transitions, 134 flow [2022-12-12 11:38:36,588 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:38:36,594 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;@5041a82e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:38:36,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 11:38:36,620 INFO L130 PetriNetUnfolder]: 4/54 cut-off events. [2022-12-12 11:38:36,621 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:38:36,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:36,621 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:38:36,622 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-12 11:38:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash -869864902, now seen corresponding path program 1 times [2022-12-12 11:38:36,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:36,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871834973] [2022-12-12 11:38:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:36,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:37,093 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-12 11:38:37,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:37,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871834973] [2022-12-12 11:38:37,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871834973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:38:37,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:38:37,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:38:37,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299141834] [2022-12-12 11:38:37,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:38:37,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:38:37,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:37,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:38:37,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:38:37,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:37,134 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-12 11:38:37,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:37,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:37,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:37,296 INFO L130 PetriNetUnfolder]: 46/204 cut-off events. [2022-12-12 11:38:37,297 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 11:38:37,298 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-12 11:38:37,301 INFO L137 encePairwiseOnDemand]: 55/66 looper letters, 14 selfloop transitions, 9 changer transitions 23/88 dead transitions. [2022-12-12 11:38:37,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 88 transitions, 263 flow [2022-12-12 11:38:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:38:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:38:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 573 transitions. [2022-12-12 11:38:37,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8681818181818182 [2022-12-12 11:38:37,320 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places. [2022-12-12 11:38:37,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 88 transitions, 263 flow [2022-12-12 11:38:37,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 256 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-12 11:38:37,326 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 88 transitions, 256 flow [2022-12-12 11:38:37,327 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-12 11:38:37,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:37,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:38:37,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:38:37,327 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-12 11:38:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1673234708, now seen corresponding path program 1 times [2022-12-12 11:38:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:37,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483791151] [2022-12-12 11:38:37,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:37,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:37,504 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-12 11:38:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:37,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483791151] [2022-12-12 11:38:37,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483791151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:38:37,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:38:37,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:38:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713262508] [2022-12-12 11:38:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:38:37,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:38:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:37,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:38:37,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:38:37,510 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:37,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 88 transitions, 256 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-12 11:38:37,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:37,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:37,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:37,607 INFO L130 PetriNetUnfolder]: 46/218 cut-off events. [2022-12-12 11:38:37,607 INFO L131 PetriNetUnfolder]: For 27/55 co-relation queries the response was YES. [2022-12-12 11:38:37,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 218 events. 46/218 cut-off events. For 27/55 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 879 event pairs, 0 based on Foata normal form. 3/203 useless extension candidates. Maximal degree in co-relation 344. Up to 35 conditions per place. [2022-12-12 11:38:37,612 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 19 selfloop transitions, 9 changer transitions 40/110 dead transitions. [2022-12-12 11:38:37,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 110 transitions, 466 flow [2022-12-12 11:38:37,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 11:38:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 11:38:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 443 transitions. [2022-12-12 11:38:37,614 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8390151515151515 [2022-12-12 11:38:37,614 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2022-12-12 11:38:37,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 110 transitions, 466 flow [2022-12-12 11:38:37,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 110 transitions, 438 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-12-12 11:38:37,618 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 110 transitions, 438 flow [2022-12-12 11:38:37,618 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-12 11:38:37,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:37,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:38:37,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:38:37,619 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-12 11:38:37,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1128844342, now seen corresponding path program 1 times [2022-12-12 11:38:37,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:37,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507025345] [2022-12-12 11:38:37,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:37,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:37,805 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-12 11:38:37,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:37,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507025345] [2022-12-12 11:38:37,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507025345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:38:37,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:38:37,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:38:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454217448] [2022-12-12 11:38:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:38:37,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:38:37,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:37,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:38:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:38:37,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:37,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 110 transitions, 438 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-12 11:38:37,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:37,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:37,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:37,926 INFO L130 PetriNetUnfolder]: 68/322 cut-off events. [2022-12-12 11:38:37,927 INFO L131 PetriNetUnfolder]: For 124/198 co-relation queries the response was YES. [2022-12-12 11:38:37,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 322 events. 68/322 cut-off events. For 124/198 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1606 event pairs, 0 based on Foata normal form. 26/322 useless extension candidates. Maximal degree in co-relation 594. Up to 44 conditions per place. [2022-12-12 11:38:37,929 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 25 selfloop transitions, 11 changer transitions 60/138 dead transitions. [2022-12-12 11:38:37,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 138 transitions, 768 flow [2022-12-12 11:38:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:38:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:38:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 554 transitions. [2022-12-12 11:38:37,931 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8393939393939394 [2022-12-12 11:38:37,932 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 22 predicate places. [2022-12-12 11:38:37,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 138 transitions, 768 flow [2022-12-12 11:38:37,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 138 transitions, 728 flow, removed 20 selfloop flow, removed 0 redundant places. [2022-12-12 11:38:37,936 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 138 transitions, 728 flow [2022-12-12 11:38:37,937 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-12 11:38:37,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:37,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:38:37,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:38:37,937 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-12 11:38:37,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:37,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1724335678, now seen corresponding path program 2 times [2022-12-12 11:38:37,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:37,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773906248] [2022-12-12 11:38:37,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:37,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:38,095 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-12 11:38:38,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:38,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773906248] [2022-12-12 11:38:38,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773906248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:38:38,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:38:38,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:38:38,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276066663] [2022-12-12 11:38:38,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:38:38,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:38:38,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:38,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:38:38,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:38:38,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:38,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 138 transitions, 728 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-12 11:38:38,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:38,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:38,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:38,203 INFO L130 PetriNetUnfolder]: 69/330 cut-off events. [2022-12-12 11:38:38,204 INFO L131 PetriNetUnfolder]: For 251/354 co-relation queries the response was YES. [2022-12-12 11:38:38,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 330 events. 69/330 cut-off events. For 251/354 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1689 event pairs, 0 based on Foata normal form. 34/339 useless extension candidates. Maximal degree in co-relation 703. Up to 46 conditions per place. [2022-12-12 11:38:38,205 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 22 selfloop transitions, 12 changer transitions 76/152 dead transitions. [2022-12-12 11:38:38,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 152 transitions, 1040 flow [2022-12-12 11:38:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:38:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:38:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 492 transitions. [2022-12-12 11:38:38,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8282828282828283 [2022-12-12 11:38:38,208 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 30 predicate places. [2022-12-12 11:38:38,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 152 transitions, 1040 flow [2022-12-12 11:38:38,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 152 transitions, 927 flow, removed 53 selfloop flow, removed 2 redundant places. [2022-12-12 11:38:38,211 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 152 transitions, 927 flow [2022-12-12 11:38:38,211 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-12 11:38:38,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:38,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:38:38,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:38:38,211 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-12 11:38:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1294261646, now seen corresponding path program 1 times [2022-12-12 11:38:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:38,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531174668] [2022-12-12 11:38:38,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:38,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:38,320 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-12 11:38:38,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:38,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531174668] [2022-12-12 11:38:38,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531174668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:38:38,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:38:38,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:38:38,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024515196] [2022-12-12 11:38:38,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:38:38,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:38:38,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:38,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:38:38,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:38:38,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:38,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 152 transitions, 927 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-12 11:38:38,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:38,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:38,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:38,445 INFO L130 PetriNetUnfolder]: 106/500 cut-off events. [2022-12-12 11:38:38,445 INFO L131 PetriNetUnfolder]: For 381/475 co-relation queries the response was YES. [2022-12-12 11:38:38,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 500 events. 106/500 cut-off events. For 381/475 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2936 event pairs, 0 based on Foata normal form. 34/495 useless extension candidates. Maximal degree in co-relation 1126. Up to 69 conditions per place. [2022-12-12 11:38:38,448 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 26 selfloop transitions, 21 changer transitions 108/197 dead transitions. [2022-12-12 11:38:38,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 197 transitions, 1573 flow [2022-12-12 11:38:38,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:38:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:38:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 715 transitions. [2022-12-12 11:38:38,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-12-12 11:38:38,452 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 40 predicate places. [2022-12-12 11:38:38,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 197 transitions, 1573 flow [2022-12-12 11:38:38,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 197 transitions, 1412 flow, removed 72 selfloop flow, removed 2 redundant places. [2022-12-12 11:38:38,455 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 197 transitions, 1412 flow [2022-12-12 11:38:38,456 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-12 11:38:38,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:38,456 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:38:38,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:38:38,456 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-12 11:38:38,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1658623746, now seen corresponding path program 2 times [2022-12-12 11:38:38,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:38,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489741166] [2022-12-12 11:38:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:38,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:38,562 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-12 11:38:38,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:38,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489741166] [2022-12-12 11:38:38,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489741166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:38:38,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:38:38,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:38:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468504681] [2022-12-12 11:38:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:38:38,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:38:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:38,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:38:38,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:38:38,564 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:38,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 197 transitions, 1412 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-12 11:38:38,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:38,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:38,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:38,700 INFO L130 PetriNetUnfolder]: 107/508 cut-off events. [2022-12-12 11:38:38,700 INFO L131 PetriNetUnfolder]: For 539/678 co-relation queries the response was YES. [2022-12-12 11:38:38,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 508 events. 107/508 cut-off events. For 539/678 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3036 event pairs, 0 based on Foata normal form. 59/530 useless extension candidates. Maximal degree in co-relation 1223. Up to 62 conditions per place. [2022-12-12 11:38:38,702 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 24 selfloop transitions, 21 changer transitions 124/211 dead transitions. [2022-12-12 11:38:38,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 211 transitions, 1844 flow [2022-12-12 11:38:38,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 11:38:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 11:38:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 653 transitions. [2022-12-12 11:38:38,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8244949494949495 [2022-12-12 11:38:38,706 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 49 predicate places. [2022-12-12 11:38:38,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 211 transitions, 1844 flow [2022-12-12 11:38:38,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 211 transitions, 1732 flow, removed 40 selfloop flow, removed 5 redundant places. [2022-12-12 11:38:38,710 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 211 transitions, 1732 flow [2022-12-12 11:38:38,710 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-12 11:38:38,710 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:38,710 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:38:38,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:38:38,711 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-12 11:38:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1530396034, now seen corresponding path program 3 times [2022-12-12 11:38:38,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:38,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470764539] [2022-12-12 11:38:38,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:38,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:38,802 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-12 11:38:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470764539] [2022-12-12 11:38:38,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470764539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:38:38,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:38:38,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:38:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099504927] [2022-12-12 11:38:38,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:38:38,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:38:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:38,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:38:38,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:38:38,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:38,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 211 transitions, 1732 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-12 11:38:38,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:38,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:38,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:38,971 INFO L130 PetriNetUnfolder]: 116/542 cut-off events. [2022-12-12 11:38:38,971 INFO L131 PetriNetUnfolder]: For 743/895 co-relation queries the response was YES. [2022-12-12 11:38:38,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 542 events. 116/542 cut-off events. For 743/895 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3338 event pairs, 0 based on Foata normal form. 57/560 useless extension candidates. Maximal degree in co-relation 1412. Up to 66 conditions per place. [2022-12-12 11:38:38,973 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 33 selfloop transitions, 17 changer transitions 133/225 dead transitions. [2022-12-12 11:38:38,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 225 transitions, 2180 flow [2022-12-12 11:38:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-12 11:38:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-12 11:38:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 815 transitions. [2022-12-12 11:38:38,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8232323232323232 [2022-12-12 11:38:38,975 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 58 predicate places. [2022-12-12 11:38:38,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 225 transitions, 2180 flow [2022-12-12 11:38:38,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 225 transitions, 1904 flow, removed 104 selfloop flow, removed 10 redundant places. [2022-12-12 11:38:38,980 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 225 transitions, 1904 flow [2022-12-12 11:38:38,980 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-12 11:38:38,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:38,980 INFO L214 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-12 11:38:38,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:38:38,980 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-12 11:38:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:38,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2090532918, now seen corresponding path program 1 times [2022-12-12 11:38:38,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:38,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942077818] [2022-12-12 11:38:38,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:38,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:39,111 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-12 11:38:39,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:39,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942077818] [2022-12-12 11:38:39,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942077818] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:38:39,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880264293] [2022-12-12 11:38:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:39,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:39,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:38:39,115 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-12 11:38:39,171 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-12 11:38:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:39,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-12 11:38:39,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:38:39,369 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-12 11:38:39,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:38:39,493 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-12 11:38:39,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880264293] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:38:39,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:38:39,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-12-12 11:38:39,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719973187] [2022-12-12 11:38:39,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:38:39,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-12 11:38:39,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:39,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-12 11:38:39,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-12 11:38:39,495 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:39,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 225 transitions, 1904 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-12 11:38:39,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:39,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:39,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:39,797 INFO L130 PetriNetUnfolder]: 188/890 cut-off events. [2022-12-12 11:38:39,797 INFO L131 PetriNetUnfolder]: For 1317/1482 co-relation queries the response was YES. [2022-12-12 11:38:39,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 890 events. 188/890 cut-off events. For 1317/1482 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5809 event pairs, 0 based on Foata normal form. 62/877 useless extension candidates. Maximal degree in co-relation 2421. Up to 115 conditions per place. [2022-12-12 11:38:39,802 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 34 selfloop transitions, 36 changer transitions 223/335 dead transitions. [2022-12-12 11:38:39,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 335 transitions, 3663 flow [2022-12-12 11:38:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-12 11:38:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-12 11:38:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1195 transitions. [2022-12-12 11:38:39,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8230027548209367 [2022-12-12 11:38:39,806 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 69 predicate places. [2022-12-12 11:38:39,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 335 transitions, 3663 flow [2022-12-12 11:38:39,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 335 transitions, 3415 flow, removed 91 selfloop flow, removed 7 redundant places. [2022-12-12 11:38:39,814 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 335 transitions, 3415 flow [2022-12-12 11:38:39,814 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-12 11:38:39,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:39,814 INFO L214 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-12 11:38:39,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-12 11:38:40,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:40,019 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-12 11:38:40,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash 64894311, now seen corresponding path program 1 times [2022-12-12 11:38:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:40,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569956550] [2022-12-12 11:38:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:40,167 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-12 11:38:40,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569956550] [2022-12-12 11:38:40,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569956550] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:38:40,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564346009] [2022-12-12 11:38:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:40,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:40,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:38:40,184 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-12 11:38:40,207 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-12 11:38:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:40,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-12 11:38:40,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:38:40,340 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-12 11:38:40,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:38:40,506 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-12 11:38:40,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564346009] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:38:40,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:38:40,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2022-12-12 11:38:40,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908448767] [2022-12-12 11:38:40,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:38:40,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-12 11:38:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:40,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-12 11:38:40,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-12 11:38:40,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:40,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 335 transitions, 3415 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-12 11:38:40,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:40,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:40,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:40,939 INFO L130 PetriNetUnfolder]: 356/1758 cut-off events. [2022-12-12 11:38:40,939 INFO L131 PetriNetUnfolder]: For 3805/3989 co-relation queries the response was YES. [2022-12-12 11:38:40,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 1758 events. 356/1758 cut-off events. For 3805/3989 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 12941 event pairs, 0 based on Foata normal form. 66/1662 useless extension candidates. Maximal degree in co-relation 5132. Up to 280 conditions per place. [2022-12-12 11:38:40,947 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 73 selfloop transitions, 25 changer transitions 454/594 dead transitions. [2022-12-12 11:38:40,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 594 transitions, 7835 flow [2022-12-12 11:38:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-12 11:38:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-12 11:38:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1647 transitions. [2022-12-12 11:38:40,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8318181818181818 [2022-12-12 11:38:40,952 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 91 predicate places. [2022-12-12 11:38:40,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 594 transitions, 7835 flow [2022-12-12 11:38:40,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 594 transitions, 7410 flow, removed 134 selfloop flow, removed 7 redundant places. [2022-12-12 11:38:40,968 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 594 transitions, 7410 flow [2022-12-12 11:38:40,968 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-12 11:38:40,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:40,968 INFO L214 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-12 11:38:40,975 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-12 11:38:41,174 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,SelfDestructingSolverStorable8 [2022-12-12 11:38:41,175 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-12 11:38:41,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1563130219, now seen corresponding path program 2 times [2022-12-12 11:38:41,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:41,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618745816] [2022-12-12 11:38:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:41,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:41,289 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-12 11:38:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:41,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618745816] [2022-12-12 11:38:41,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618745816] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:38:41,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086823406] [2022-12-12 11:38:41,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 11:38:41,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:41,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:38:41,292 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-12 11:38:41,323 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-12 11:38:41,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 11:38:41,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 11:38:41,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-12 11:38:41,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:38:41,415 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-12 11:38:41,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:38:41,546 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-12 11:38:41,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086823406] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:38:41,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:38:41,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2022-12-12 11:38:41,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341107964] [2022-12-12 11:38:41,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:38:41,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-12 11:38:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-12 11:38:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-12-12 11:38:41,548 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:41,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 594 transitions, 7410 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-12 11:38:41,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:41,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:41,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:42,288 INFO L130 PetriNetUnfolder]: 618/3041 cut-off events. [2022-12-12 11:38:42,288 INFO L131 PetriNetUnfolder]: For 6845/7244 co-relation queries the response was YES. [2022-12-12 11:38:42,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9343 conditions, 3041 events. 618/3041 cut-off events. For 6845/7244 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 27011 event pairs, 0 based on Foata normal form. 160/2924 useless extension candidates. Maximal degree in co-relation 9303. Up to 463 conditions per place. [2022-12-12 11:38:42,303 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 92 selfloop transitions, 82 changer transitions 764/980 dead transitions. [2022-12-12 11:38:42,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 980 transitions, 14008 flow [2022-12-12 11:38:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-12 11:38:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-12 11:38:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2181 transitions. [2022-12-12 11:38:42,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8261363636363637 [2022-12-12 11:38:42,306 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 123 predicate places. [2022-12-12 11:38:42,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 980 transitions, 14008 flow [2022-12-12 11:38:42,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 980 transitions, 13260 flow, removed 340 selfloop flow, removed 11 redundant places. [2022-12-12 11:38:42,344 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 980 transitions, 13260 flow [2022-12-12 11:38:42,344 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-12 11:38:42,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:42,344 INFO L214 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-12 11:38:42,350 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-12 11:38:42,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:42,551 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-12 11:38:42,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:42,551 INFO L85 PathProgramCache]: Analyzing trace with hash -640107091, now seen corresponding path program 3 times [2022-12-12 11:38:42,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:42,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688756280] [2022-12-12 11:38:42,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:42,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:42,664 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-12 11:38:42,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:42,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688756280] [2022-12-12 11:38:42,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688756280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:38:42,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472408081] [2022-12-12 11:38:42,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 11:38:42,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:42,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:38:42,672 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-12 11:38:42,674 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-12 11:38:42,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-12 11:38:42,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 11:38:42,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-12 11:38:42,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:38:42,782 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-12 11:38:42,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:38:42,889 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-12 11:38:42,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472408081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:38:42,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:38:42,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-12-12 11:38:42,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380112502] [2022-12-12 11:38:42,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:38:42,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-12 11:38:42,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:42,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-12 11:38:42,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-12-12 11:38:42,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:42,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 980 transitions, 13260 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-12 11:38:42,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:42,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:42,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:43,889 INFO L130 PetriNetUnfolder]: 779/3778 cut-off events. [2022-12-12 11:38:43,889 INFO L131 PetriNetUnfolder]: For 9938/10373 co-relation queries the response was YES. [2022-12-12 11:38:43,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12308 conditions, 3778 events. 779/3778 cut-off events. For 9938/10373 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 35224 event pairs, 0 based on Foata normal form. 170/3608 useless extension candidates. Maximal degree in co-relation 12268. Up to 579 conditions per place. [2022-12-12 11:38:43,906 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 103 selfloop transitions, 125 changer transitions 979/1249 dead transitions. [2022-12-12 11:38:43,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 1249 transitions, 19000 flow [2022-12-12 11:38:43,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-12 11:38:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-12 11:38:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 2280 transitions. [2022-12-12 11:38:43,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8225108225108225 [2022-12-12 11:38:43,909 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 153 predicate places. [2022-12-12 11:38:43,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 1249 transitions, 19000 flow [2022-12-12 11:38:43,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 1249 transitions, 18419 flow, removed 239 selfloop flow, removed 14 redundant places. [2022-12-12 11:38:43,944 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 1249 transitions, 18419 flow [2022-12-12 11:38:43,944 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-12 11:38:43,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:43,944 INFO L214 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-12 11:38:43,950 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-12 11:38:44,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:44,149 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-12 11:38:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:44,149 INFO L85 PathProgramCache]: Analyzing trace with hash 994160527, now seen corresponding path program 4 times [2022-12-12 11:38:44,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:44,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64946814] [2022-12-12 11:38:44,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:44,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:44,307 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-12 11:38:44,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:44,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64946814] [2022-12-12 11:38:44,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64946814] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:38:44,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914866846] [2022-12-12 11:38:44,308 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 11:38:44,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:44,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:38:44,309 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-12 11:38:44,311 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-12 11:38:44,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 11:38:44,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 11:38:44,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-12 11:38:44,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:38:44,451 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-12 11:38:44,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:38:44,624 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-12 11:38:44,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914866846] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:38:44,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:38:44,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 25 [2022-12-12 11:38:44,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585639992] [2022-12-12 11:38:44,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:38:44,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-12 11:38:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:44,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-12 11:38:44,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2022-12-12 11:38:44,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:44,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 1249 transitions, 18419 flow. Second operand has 25 states, 25 states have (on average 52.32) internal successors, (1308), 25 states have internal predecessors, (1308), 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-12 11:38:44,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:44,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:44,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:46,171 INFO L130 PetriNetUnfolder]: 1237/6137 cut-off events. [2022-12-12 11:38:46,171 INFO L131 PetriNetUnfolder]: For 19362/19852 co-relation queries the response was YES. [2022-12-12 11:38:46,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20951 conditions, 6137 events. 1237/6137 cut-off events. For 19362/19852 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 59202 event pairs, 0 based on Foata normal form. 189/5747 useless extension candidates. Maximal degree in co-relation 20910. Up to 933 conditions per place. [2022-12-12 11:38:46,206 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 147 selfloop transitions, 181 changer transitions 1579/1949 dead transitions. [2022-12-12 11:38:46,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 1949 transitions, 32646 flow [2022-12-12 11:38:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-12 11:38:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-12-12 11:38:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 3145 transitions. [2022-12-12 11:38:46,217 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8215778474399164 [2022-12-12 11:38:46,217 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 196 predicate places. [2022-12-12 11:38:46,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 1949 transitions, 32646 flow [2022-12-12 11:38:46,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 1949 transitions, 31800 flow, removed 342 selfloop flow, removed 11 redundant places. [2022-12-12 11:38:46,279 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 1949 transitions, 31800 flow [2022-12-12 11:38:46,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 52.32) internal successors, (1308), 25 states have internal predecessors, (1308), 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-12 11:38:46,280 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:46,280 INFO L214 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-12 11:38:46,285 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-12 11:38:46,486 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,SelfDestructingSolverStorable11 [2022-12-12 11:38:46,487 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-12 11:38:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash 205277079, now seen corresponding path program 5 times [2022-12-12 11:38:46,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:46,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865115088] [2022-12-12 11:38:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:46,918 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-12 11:38:46,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:46,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865115088] [2022-12-12 11:38:46,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865115088] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:38:46,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077796582] [2022-12-12 11:38:46,918 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 11:38:46,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:46,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:38:46,920 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-12 11:38:46,922 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-12 11:38:46,988 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-12-12 11:38:46,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 11:38:46,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-12 11:38:46,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:38:47,233 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-12 11:38:47,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:38:47,738 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-12 11:38:47,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077796582] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:38:47,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:38:47,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 41 [2022-12-12 11:38:47,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351208843] [2022-12-12 11:38:47,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:38:47,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-12 11:38:47,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-12 11:38:47,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2022-12-12 11:38:47,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:47,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 1949 transitions, 31800 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-12 11:38:47,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:47,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:47,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:49,413 INFO L130 PetriNetUnfolder]: 1457/7190 cut-off events. [2022-12-12 11:38:49,413 INFO L131 PetriNetUnfolder]: For 27849/28290 co-relation queries the response was YES. [2022-12-12 11:38:49,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26509 conditions, 7190 events. 1457/7190 cut-off events. For 27849/28290 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 69082 event pairs, 0 based on Foata normal form. 91/6601 useless extension candidates. Maximal degree in co-relation 26467. Up to 1135 conditions per place. [2022-12-12 11:38:49,439 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 315 selfloop transitions, 45 changer transitions 1885/2287 dead transitions. [2022-12-12 11:38:49,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 2287 transitions, 42176 flow [2022-12-12 11:38:49,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-12 11:38:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-12 11:38:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2735 transitions. [2022-12-12 11:38:49,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8287878787878787 [2022-12-12 11:38:49,447 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 234 predicate places. [2022-12-12 11:38:49,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 2287 transitions, 42176 flow [2022-12-12 11:38:49,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 2287 transitions, 39183 flow, removed 1110 selfloop flow, removed 27 redundant places. [2022-12-12 11:38:49,537 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 2287 transitions, 39183 flow [2022-12-12 11:38:49,538 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-12 11:38:49,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:49,538 INFO L214 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-12 11:38:49,542 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-12 11:38:49,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:49,743 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-12 11:38:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1752570625, now seen corresponding path program 6 times [2022-12-12 11:38:49,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:49,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272397592] [2022-12-12 11:38:49,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:49,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:50,104 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-12 11:38:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:50,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272397592] [2022-12-12 11:38:50,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272397592] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:38:50,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097132934] [2022-12-12 11:38:50,105 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 11:38:50,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:38:50,112 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-12 11:38:50,114 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-12 11:38:50,182 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-12-12 11:38:50,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 11:38:50,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-12 11:38:50,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:38:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 1 proven. 311 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-12 11:38:50,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:38:50,898 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-12 11:38:50,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097132934] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:38:50,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:38:50,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2022-12-12 11:38:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104331267] [2022-12-12 11:38:50,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:38:50,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-12 11:38:50,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:50,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-12 11:38:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1360, Unknown=0, NotChecked=0, Total=1722 [2022-12-12 11:38:50,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:50,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 2287 transitions, 39183 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-12 11:38:50,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:50,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:50,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:38:54,226 INFO L130 PetriNetUnfolder]: 2515/12706 cut-off events. [2022-12-12 11:38:54,227 INFO L131 PetriNetUnfolder]: For 50803/51439 co-relation queries the response was YES. [2022-12-12 11:38:54,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47815 conditions, 12706 events. 2515/12706 cut-off events. For 50803/51439 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 140713 event pairs, 0 based on Foata normal form. 170/11642 useless extension candidates. Maximal degree in co-relation 47772. Up to 2039 conditions per place. [2022-12-12 11:38:54,267 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 362 selfloop transitions, 178 changer transitions 3337/3919 dead transitions. [2022-12-12 11:38:54,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 3919 transitions, 75442 flow [2022-12-12 11:38:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-12-12 11:38:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2022-12-12 11:38:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 4708 transitions. [2022-12-12 11:38:54,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8199233716475096 [2022-12-12 11:38:54,272 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 293 predicate places. [2022-12-12 11:38:54,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 3919 transitions, 75442 flow [2022-12-12 11:38:54,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 3919 transitions, 71076 flow, removed 2080 selfloop flow, removed 15 redundant places. [2022-12-12 11:38:54,471 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 3919 transitions, 71076 flow [2022-12-12 11:38:54,472 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-12 11:38:54,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:38:54,472 INFO L214 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-12 11:38:54,476 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-12 11:38:54,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:54,678 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-12 11:38:54,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:38:54,679 INFO L85 PathProgramCache]: Analyzing trace with hash 42251481, now seen corresponding path program 7 times [2022-12-12 11:38:54,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:38:54,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938920269] [2022-12-12 11:38:54,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:38:54,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:38:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:55,040 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-12 11:38:55,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:38:55,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938920269] [2022-12-12 11:38:55,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938920269] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:38:55,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569016755] [2022-12-12 11:38:55,040 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 11:38:55,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:38:55,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:38:55,042 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-12 11:38:55,042 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-12 11:38:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:38:55,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-12 11:38:55,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:38:55,308 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-12 11:38:55,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:38:55,756 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-12 11:38:55,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569016755] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:38:55,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:38:55,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 41 [2022-12-12 11:38:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931323395] [2022-12-12 11:38:55,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:38:55,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-12 11:38:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:55,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-12 11:38:55,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1347, Unknown=0, NotChecked=0, Total=1640 [2022-12-12 11:38:55,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:38:55,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 3919 transitions, 71076 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-12 11:38:55,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:55,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:38:55,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:39:00,967 INFO L130 PetriNetUnfolder]: 3625/18343 cut-off events. [2022-12-12 11:39:00,968 INFO L131 PetriNetUnfolder]: For 80529/81669 co-relation queries the response was YES. [2022-12-12 11:39:01,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70622 conditions, 18343 events. 3625/18343 cut-off events. For 80529/81669 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 219358 event pairs, 0 based on Foata normal form. 395/16962 useless extension candidates. Maximal degree in co-relation 70579. Up to 3019 conditions per place. [2022-12-12 11:39:01,029 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 388 selfloop transitions, 332 changer transitions 4867/5629 dead transitions. [2022-12-12 11:39:01,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 5629 transitions, 111906 flow [2022-12-12 11:39:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-12-12 11:39:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2022-12-12 11:39:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 4886 transitions. [2022-12-12 11:39:01,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8225589225589226 [2022-12-12 11:39:01,033 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 367 predicate places. [2022-12-12 11:39:01,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 5629 transitions, 111906 flow [2022-12-12 11:39:01,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 5629 transitions, 106457 flow, removed 2345 selfloop flow, removed 24 redundant places. [2022-12-12 11:39:01,673 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 5629 transitions, 106457 flow [2022-12-12 11:39:01,674 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-12 11:39:01,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:39:01,674 INFO L214 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-12 11:39:01,682 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-12 11:39:01,875 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,SelfDestructingSolverStorable14 [2022-12-12 11:39:01,875 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-12 11:39:01,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:39:01,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1981894417, now seen corresponding path program 8 times [2022-12-12 11:39:01,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:39:01,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587852313] [2022-12-12 11:39:01,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:39:01,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:39:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:39:02,213 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-12 11:39:02,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:39:02,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587852313] [2022-12-12 11:39:02,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587852313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:39:02,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654530100] [2022-12-12 11:39:02,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 11:39:02,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:39:02,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:39:02,215 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-12 11:39:02,217 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-12 11:39:02,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 11:39:02,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 11:39:02,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-12 11:39:02,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:39:02,430 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-12 11:39:02,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:39:02,837 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-12 11:39:02,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654530100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:39:02,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:39:02,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2022-12-12 11:39:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625671345] [2022-12-12 11:39:02,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:39:02,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-12 11:39:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:39:02,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-12 11:39:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1470, Unknown=0, NotChecked=0, Total=1722 [2022-12-12 11:39:02,840 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:39:02,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 5629 transitions, 106457 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-12 11:39:02,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:39:02,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:39:02,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:39:10,259 INFO L130 PetriNetUnfolder]: 4079/20533 cut-off events. [2022-12-12 11:39:10,259 INFO L131 PetriNetUnfolder]: For 101382/102722 co-relation queries the response was YES. [2022-12-12 11:39:10,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81350 conditions, 20533 events. 4079/20533 cut-off events. For 101382/102722 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 252199 event pairs, 0 based on Foata normal form. 472/19045 useless extension candidates. Maximal degree in co-relation 81306. Up to 3285 conditions per place. [2022-12-12 11:39:10,335 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 431 selfloop transitions, 462 changer transitions 5407/6342 dead transitions. [2022-12-12 11:39:10,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 6342 transitions, 130015 flow [2022-12-12 11:39:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-12-12 11:39:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2022-12-12 11:39:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 4494 transitions. [2022-12-12 11:39:10,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8203723986856517 [2022-12-12 11:39:10,341 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 425 predicate places. [2022-12-12 11:39:10,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 6342 transitions, 130015 flow [2022-12-12 11:39:11,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 6342 transitions, 124581 flow, removed 2157 selfloop flow, removed 29 redundant places. [2022-12-12 11:39:11,109 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 6342 transitions, 124581 flow [2022-12-12 11:39:11,110 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-12 11:39:11,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:39:11,110 INFO L214 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-12 11:39:11,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-12 11:39:11,310 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,SelfDestructingSolverStorable15 [2022-12-12 11:39:11,311 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-12 11:39:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:39:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1773767063, now seen corresponding path program 9 times [2022-12-12 11:39:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:39:11,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768896667] [2022-12-12 11:39:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:39:11,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:39:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:39:11,600 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-12 11:39:11,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:39:11,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768896667] [2022-12-12 11:39:11,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768896667] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:39:11,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200136224] [2022-12-12 11:39:11,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 11:39:11,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:39:11,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:39:11,606 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-12 11:39:11,609 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-12 11:39:11,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-12-12 11:39:11,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 11:39:11,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-12 11:39:11,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:39:11,799 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-12 11:39:11,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:39:12,112 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-12 11:39:12,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200136224] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:39:12,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:39:12,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 41 [2022-12-12 11:39:12,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374957398] [2022-12-12 11:39:12,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:39:12,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-12 11:39:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:39:12,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-12 11:39:12,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1278, Unknown=0, NotChecked=0, Total=1640 [2022-12-12 11:39:12,115 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 66 [2022-12-12 11:39:12,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 6342 transitions, 124581 flow. Second operand has 41 states, 41 states have (on average 52.26829268292683) internal successors, (2143), 41 states have internal predecessors, (2143), 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-12 11:39:12,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:39:12,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 66 [2022-12-12 11:39:12,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:39:19,868 INFO L130 PetriNetUnfolder]: 4222/21246 cut-off events. [2022-12-12 11:39:19,869 INFO L131 PetriNetUnfolder]: For 114029/115329 co-relation queries the response was YES. [2022-12-12 11:39:19,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87374 conditions, 21246 events. 4222/21246 cut-off events. For 114029/115329 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 262947 event pairs, 0 based on Foata normal form. 453/19674 useless extension candidates. Maximal degree in co-relation 87329. Up to 3354 conditions per place. [2022-12-12 11:39:19,944 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 451 selfloop transitions, 509 changer transitions 5563/6565 dead transitions. [2022-12-12 11:39:19,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 6565 transitions, 140874 flow [2022-12-12 11:39:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-12-12 11:39:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2022-12-12 11:39:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 4007 transitions. [2022-12-12 11:39:19,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8204340704340705 [2022-12-12 11:39:19,948 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 469 predicate places. [2022-12-12 11:39:19,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 6565 transitions, 140874 flow [2022-12-12 11:39:20,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 6565 transitions, 133558 flow, removed 2745 selfloop flow, removed 42 redundant places. [2022-12-12 11:39:20,788 INFO L495 AbstractCegarLoop]: Abstraction has has 493 places, 6565 transitions, 133558 flow [2022-12-12 11:39:20,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 52.26829268292683) internal successors, (2143), 41 states have internal predecessors, (2143), 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-12 11:39:20,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:39:20,789 INFO L214 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-12 11:39:20,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-12 11:39:20,989 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,SelfDestructingSolverStorable16 [2022-12-12 11:39:20,990 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-12 11:39:20,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:39:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1154895769, now seen corresponding path program 10 times [2022-12-12 11:39:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:39:20,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93355695] [2022-12-12 11:39:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:39:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:39:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:39:21,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 11:39:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:39:21,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 11:39:21,082 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 11:39:21,083 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-12 11:39:21,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-12 11:39:21,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-12 11:39:21,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-12 11:39:21,085 INFO L445 BasicCegarLoop]: Path program histogram: [10, 3, 2, 1, 1, 1] [2022-12-12 11:39:21,091 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:39:21,091 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:39:21,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:39:21 BasicIcfg [2022-12-12 11:39:21,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:39:21,183 INFO L158 Benchmark]: Toolchain (without parser) took 45491.00ms. Allocated memory was 190.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 166.0MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-12 11:39:21,183 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:39:21,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.78ms. Allocated memory is still 190.8MB. Free memory was 166.0MB in the beginning and 146.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-12 11:39:21,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.08ms. Allocated memory is still 190.8MB. Free memory was 145.6MB in the beginning and 144.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:39:21,183 INFO L158 Benchmark]: Boogie Preprocessor took 31.66ms. Allocated memory is still 190.8MB. Free memory was 144.0MB in the beginning and 142.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 11:39:21,183 INFO L158 Benchmark]: RCFGBuilder took 308.96ms. Allocated memory is still 190.8MB. Free memory was 142.5MB in the beginning and 129.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-12 11:39:21,184 INFO L158 Benchmark]: TraceAbstraction took 44765.41ms. Allocated memory was 190.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 128.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-12 11:39:21,185 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.10ms. Allocated memory is still 190.8MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 336.78ms. Allocated memory is still 190.8MB. Free memory was 166.0MB in the beginning and 146.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.08ms. Allocated memory is still 190.8MB. Free memory was 145.6MB in the beginning and 144.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.66ms. Allocated memory is still 190.8MB. Free memory was 144.0MB in the beginning and 142.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 308.96ms. Allocated memory is still 190.8MB. Free memory was 142.5MB in the beginning and 129.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 44765.41ms. Allocated memory was 190.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 128.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. 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] [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=0] [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=0] [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=0] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L696] COND TRUE 1 k < 10 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=1, k=0] [L716] 0 int condI = i >= (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, i=9, id1={5:0}, id2={3:0}, j=8, k=1, k=0] [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] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=1] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, 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=2] [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=2] [L698] 1 i = j + 1 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=2, k=3] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=2, k=3] [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=3, k=4] [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=3, k=5] [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=4, k=5] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, k=4] [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=4, k=5] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [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=5] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=5] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=5] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [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=7, k=5] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=7] [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=6, k=7] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=6] [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=7, k=8] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=7] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=7] [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: 2.7s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 44.6s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4222 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4222 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 471 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3476 IncrementalHoareTripleChecker+Invalid, 3947 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 471 mSolverCounterUnsat, 83 mSDtfsCounter, 3476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2540 GetRequests, 1673 SyntacticMatches, 6 SemanticMatches, 861 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26044 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133558occurred in iteration=17, InterpolantAutomatonStates: 653, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 29143 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2190 NumberOfCodeBlocks, 2190 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 2923 ConstructedInterpolants, 0 QuantifiedInterpolants, 12573 SizeOfPredicates, 122 NumberOfNonLiveVariables, 2050 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 37 InterpolantComputations, 7 PerfectInterpolantSequences, 109/5145 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-12 11:39:21,205 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...