/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/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:33:56,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:33:56,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:33:56,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:33:56,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:33:56,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:33:56,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:33:56,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:33:56,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:33:56,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:33:56,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:33:56,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:33:56,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:33:56,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:33:56,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:33:56,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:33:56,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:33:56,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:33:56,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:33:56,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:33:56,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:33:56,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:33:56,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:33:56,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:33:56,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:33:56,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:33:56,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:33:56,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:33:56,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:33:56,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:33:56,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:33:56,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:33:56,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:33:56,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:33:56,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:33:56,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:33:56,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:33:56,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:33:56,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:33:56,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:33:56,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:33:56,250 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:33:56,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:33:56,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:33:56,273 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:33:56,273 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:33:56,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:33:56,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:33:56,274 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:33:56,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:33:56,274 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:33:56,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:33:56,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:33:56,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:33:56,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:33:56,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:33:56,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:33:56,276 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:33:56,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:33:56,276 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:33:56,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:33:56,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:33:56,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:33:56,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:33:56,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:33:56,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:33:56,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:33:56,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:33:56,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:33:56,277 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:33:56,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:33:56,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:33:56,277 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:33:56,277 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:33:56,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:33:56,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:33:56,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:33:56,535 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:33:56,535 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:33:56,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2022-12-12 11:33:57,465 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:33:57,689 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:33:57,689 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2022-12-12 11:33:57,713 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc90ef396/fc83232075fa4f56b395223bad2f012d/FLAG1d09b5dd8 [2022-12-12 11:33:57,728 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc90ef396/fc83232075fa4f56b395223bad2f012d [2022-12-12 11:33:57,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:33:57,730 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:33:57,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:33:57,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:33:57,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:33:57,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:33:57" (1/1) ... [2022-12-12 11:33:57,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9c9d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:57, skipping insertion in model container [2022-12-12 11:33:57,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:33:57" (1/1) ... [2022-12-12 11:33:57,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:33:57,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:33:58,091 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/queue_longer.i[43296,43309] [2022-12-12 11:33:58,098 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/queue_longer.i[43503,43516] [2022-12-12 11:33:58,102 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/queue_longer.i[43783,43796] [2022-12-12 11:33:58,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:33:58,118 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:33:58,167 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/queue_longer.i[43296,43309] [2022-12-12 11:33:58,172 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/queue_longer.i[43503,43516] [2022-12-12 11:33:58,173 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/queue_longer.i[43783,43796] [2022-12-12 11:33:58,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:33:58,217 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:33:58,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:58 WrapperNode [2022-12-12 11:33:58,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:33:58,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:33:58,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:33:58,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:33:58,224 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:33:58" (1/1) ... [2022-12-12 11:33:58,249 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:33:58" (1/1) ... [2022-12-12 11:33:58,289 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2022-12-12 11:33:58,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:33:58,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:33:58,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:33:58,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:33:58,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:58" (1/1) ... [2022-12-12 11:33:58,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:58" (1/1) ... [2022-12-12 11:33:58,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:58" (1/1) ... [2022-12-12 11:33:58,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:58" (1/1) ... [2022-12-12 11:33:58,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:58" (1/1) ... [2022-12-12 11:33:58,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:58" (1/1) ... [2022-12-12 11:33:58,325 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:58" (1/1) ... [2022-12-12 11:33:58,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:58" (1/1) ... [2022-12-12 11:33:58,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:33:58,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:33:58,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:33:58,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:33:58,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:58" (1/1) ... [2022-12-12 11:33:58,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:33:58,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:33:58,394 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:33:58,412 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:33:58,423 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-12 11:33:58,423 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-12 11:33:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-12 11:33:58,424 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-12 11:33:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:33:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:33:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 11:33:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:33:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-12 11:33:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:33:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:33:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:33:58,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:33:58,426 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:33:58,583 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:33:58,584 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:33:58,830 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:33:58,836 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:33:58,836 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-12 11:33:58,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:33:58 BoogieIcfgContainer [2022-12-12 11:33:58,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:33:58,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:33:58,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:33:58,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:33:58,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:33:57" (1/3) ... [2022-12-12 11:33:58,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b046bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:33:58, skipping insertion in model container [2022-12-12 11:33:58,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:33:58" (2/3) ... [2022-12-12 11:33:58,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b046bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:33:58, skipping insertion in model container [2022-12-12 11:33:58,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:33:58" (3/3) ... [2022-12-12 11:33:58,843 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2022-12-12 11:33:58,855 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:33:58,855 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-12 11:33:58,855 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:33:58,997 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 11:33:59,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 256 transitions, 528 flow [2022-12-12 11:33:59,088 INFO L130 PetriNetUnfolder]: 15/254 cut-off events. [2022-12-12 11:33:59,088 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 11:33:59,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 254 events. 15/254 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 363 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-12-12 11:33:59,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 256 transitions, 528 flow [2022-12-12 11:33:59,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 245 transitions, 499 flow [2022-12-12 11:33:59,115 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:33:59,119 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;@6c2f8505, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:33:59,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 11:33:59,134 INFO L130 PetriNetUnfolder]: 1/56 cut-off events. [2022-12-12 11:33:59,134 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:33:59,134 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:33:59,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:33:59,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:33:59,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:33:59,139 INFO L85 PathProgramCache]: Analyzing trace with hash 812412170, now seen corresponding path program 1 times [2022-12-12 11:33:59,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:33:59,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002687714] [2022-12-12 11:33:59,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:33:59,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:33:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:33:59,381 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:33:59,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:33:59,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002687714] [2022-12-12 11:33:59,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002687714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:33:59,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:33:59,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:33:59,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964881648] [2022-12-12 11:33:59,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:33:59,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-12 11:33:59,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:33:59,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-12 11:33:59,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-12 11:33:59,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 256 [2022-12-12 11:33:59,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 245 transitions, 499 flow. Second operand has 2 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 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:33:59,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:33:59,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 256 [2022-12-12 11:33:59,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:33:59,523 INFO L130 PetriNetUnfolder]: 10/234 cut-off events. [2022-12-12 11:33:59,523 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-12 11:33:59,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 234 events. 10/234 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 280 event pairs, 0 based on Foata normal form. 7/229 useless extension candidates. Maximal degree in co-relation 176. Up to 4 conditions per place. [2022-12-12 11:33:59,530 INFO L137 encePairwiseOnDemand]: 251/256 looper letters, 3 selfloop transitions, 0 changer transitions 0/234 dead transitions. [2022-12-12 11:33:59,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 234 transitions, 483 flow [2022-12-12 11:33:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-12 11:33:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-12 11:33:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 494 transitions. [2022-12-12 11:33:59,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.96484375 [2022-12-12 11:33:59,549 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, -5 predicate places. [2022-12-12 11:33:59,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 234 transitions, 483 flow [2022-12-12 11:33:59,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 234 transitions, 472 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-12 11:33:59,555 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 234 transitions, 472 flow [2022-12-12 11:33:59,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 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:33:59,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:33:59,556 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:33:59,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:33:59,556 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:33:59,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:33:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash -510713771, now seen corresponding path program 1 times [2022-12-12 11:33:59,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:33:59,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709160036] [2022-12-12 11:33:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:33:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:33:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:00,264 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:34:00,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:00,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709160036] [2022-12-12 11:34:00,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709160036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:00,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:00,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 11:34:00,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097869027] [2022-12-12 11:34:00,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:00,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 11:34:00,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:00,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 11:34:00,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-12 11:34:00,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 256 [2022-12-12 11:34:00,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 234 transitions, 472 flow. Second operand has 12 states, 12 states have (on average 181.75) internal successors, (2181), 12 states have internal predecessors, (2181), 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:34:00,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:00,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 256 [2022-12-12 11:34:00,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:01,037 INFO L130 PetriNetUnfolder]: 995/3867 cut-off events. [2022-12-12 11:34:01,037 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-12 11:34:01,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 3867 events. 995/3867 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 31467 event pairs, 789 based on Foata normal form. 0/3596 useless extension candidates. Maximal degree in co-relation 4510. Up to 1435 conditions per place. [2022-12-12 11:34:01,054 INFO L137 encePairwiseOnDemand]: 243/256 looper letters, 52 selfloop transitions, 12 changer transitions 0/230 dead transitions. [2022-12-12 11:34:01,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 592 flow [2022-12-12 11:34:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:34:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:34:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2392 transitions. [2022-12-12 11:34:01,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71875 [2022-12-12 11:34:01,067 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 0 predicate places. [2022-12-12 11:34:01,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 592 flow [2022-12-12 11:34:01,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 230 transitions, 541 flow, removed 14 selfloop flow, removed 11 redundant places. [2022-12-12 11:34:01,099 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 230 transitions, 541 flow [2022-12-12 11:34:01,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 181.75) internal successors, (2181), 12 states have internal predecessors, (2181), 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:34:01,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:01,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:34:01,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:34:01,100 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:01,101 INFO L85 PathProgramCache]: Analyzing trace with hash 662506766, now seen corresponding path program 1 times [2022-12-12 11:34:01,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:01,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488635082] [2022-12-12 11:34:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:01,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:01,172 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:34:01,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:01,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488635082] [2022-12-12 11:34:01,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488635082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:01,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:01,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 11:34:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562572365] [2022-12-12 11:34:01,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:01,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 11:34:01,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:01,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 11:34:01,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 11:34:01,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 256 [2022-12-12 11:34:01,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 230 transitions, 541 flow. Second operand has 4 states, 4 states have (on average 233.75) internal successors, (935), 4 states have internal predecessors, (935), 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:34:01,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:01,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 256 [2022-12-12 11:34:01,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:01,505 INFO L130 PetriNetUnfolder]: 996/3856 cut-off events. [2022-12-12 11:34:01,506 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-12 11:34:01,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5528 conditions, 3856 events. 996/3856 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 31306 event pairs, 785 based on Foata normal form. 0/3600 useless extension candidates. Maximal degree in co-relation 4794. Up to 1444 conditions per place. [2022-12-12 11:34:01,522 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 9 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2022-12-12 11:34:01,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 230 transitions, 577 flow [2022-12-12 11:34:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 11:34:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 11:34:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 943 transitions. [2022-12-12 11:34:01,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9208984375 [2022-12-12 11:34:01,526 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, -9 predicate places. [2022-12-12 11:34:01,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 230 transitions, 577 flow [2022-12-12 11:34:01,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 575 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-12 11:34:01,531 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 230 transitions, 575 flow [2022-12-12 11:34:01,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 233.75) internal successors, (935), 4 states have internal predecessors, (935), 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:34:01,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:01,532 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:34:01,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:34:01,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:01,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash 314833467, now seen corresponding path program 1 times [2022-12-12 11:34:01,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:01,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427905268] [2022-12-12 11:34:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:01,689 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:34:01,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:01,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427905268] [2022-12-12 11:34:01,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427905268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:01,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:01,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 11:34:01,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020461804] [2022-12-12 11:34:01,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:01,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:34:01,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:01,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:34:01,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:34:01,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 256 [2022-12-12 11:34:01,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 230 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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:34:01,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:01,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 256 [2022-12-12 11:34:01,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:01,962 INFO L130 PetriNetUnfolder]: 567/2547 cut-off events. [2022-12-12 11:34:01,962 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-12-12 11:34:01,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 2547 events. 567/2547 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 16661 event pairs, 437 based on Foata normal form. 0/2407 useless extension candidates. Maximal degree in co-relation 2977. Up to 890 conditions per place. [2022-12-12 11:34:01,972 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 13 selfloop transitions, 3 changer transitions 0/235 dead transitions. [2022-12-12 11:34:01,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 235 transitions, 634 flow [2022-12-12 11:34:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:34:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:34:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2022-12-12 11:34:01,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9440104166666666 [2022-12-12 11:34:01,975 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, -7 predicate places. [2022-12-12 11:34:01,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 235 transitions, 634 flow [2022-12-12 11:34:01,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 235 transitions, 630 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-12 11:34:01,977 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 235 transitions, 630 flow [2022-12-12 11:34:01,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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:34:01,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:01,978 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:34:01,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:34:01,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1038158996, now seen corresponding path program 1 times [2022-12-12 11:34:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:01,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445610662] [2022-12-12 11:34:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:02,042 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:34:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:02,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445610662] [2022-12-12 11:34:02,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445610662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:02,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:02,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 11:34:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288753735] [2022-12-12 11:34:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:02,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 11:34:02,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:02,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 11:34:02,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 11:34:02,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 256 [2022-12-12 11:34:02,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 235 transitions, 630 flow. Second operand has 4 states, 4 states have (on average 235.75) internal successors, (943), 4 states have internal predecessors, (943), 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:34:02,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:02,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 256 [2022-12-12 11:34:02,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:02,679 INFO L130 PetriNetUnfolder]: 1088/4777 cut-off events. [2022-12-12 11:34:02,680 INFO L131 PetriNetUnfolder]: For 832/832 co-relation queries the response was YES. [2022-12-12 11:34:02,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 4777 events. 1088/4777 cut-off events. For 832/832 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 39042 event pairs, 829 based on Foata normal form. 0/4515 useless extension candidates. Maximal degree in co-relation 5846. Up to 1692 conditions per place. [2022-12-12 11:34:02,700 INFO L137 encePairwiseOnDemand]: 251/256 looper letters, 24 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2022-12-12 11:34:02,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 247 transitions, 774 flow [2022-12-12 11:34:02,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 11:34:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 11:34:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1191 transitions. [2022-12-12 11:34:02,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.93046875 [2022-12-12 11:34:02,707 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, -3 predicate places. [2022-12-12 11:34:02,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 247 transitions, 774 flow [2022-12-12 11:34:02,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 247 transitions, 766 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-12 11:34:02,710 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 247 transitions, 766 flow [2022-12-12 11:34:02,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 235.75) internal successors, (943), 4 states have internal predecessors, (943), 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:34:02,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:02,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:34:02,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:34:02,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:02,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1520880418, now seen corresponding path program 1 times [2022-12-12 11:34:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:02,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145210682] [2022-12-12 11:34:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:02,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:03,576 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:34:03,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:03,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145210682] [2022-12-12 11:34:03,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145210682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:03,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:03,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-12 11:34:03,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121884609] [2022-12-12 11:34:03,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:03,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-12 11:34:03,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:03,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-12 11:34:03,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-12-12 11:34:03,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 256 [2022-12-12 11:34:03,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 247 transitions, 766 flow. Second operand has 17 states, 17 states have (on average 169.41176470588235) internal successors, (2880), 17 states have internal predecessors, (2880), 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:34:03,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:03,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 256 [2022-12-12 11:34:03,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:04,903 INFO L130 PetriNetUnfolder]: 1699/6773 cut-off events. [2022-12-12 11:34:04,903 INFO L131 PetriNetUnfolder]: For 2287/2305 co-relation queries the response was YES. [2022-12-12 11:34:04,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12854 conditions, 6773 events. 1699/6773 cut-off events. For 2287/2305 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 59352 event pairs, 1273 based on Foata normal form. 0/6389 useless extension candidates. Maximal degree in co-relation 10601. Up to 2703 conditions per place. [2022-12-12 11:34:04,931 INFO L137 encePairwiseOnDemand]: 240/256 looper letters, 92 selfloop transitions, 20 changer transitions 0/269 dead transitions. [2022-12-12 11:34:04,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 269 transitions, 1072 flow [2022-12-12 11:34:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-12 11:34:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-12 11:34:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2606 transitions. [2022-12-12 11:34:04,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6786458333333333 [2022-12-12 11:34:04,936 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 11 predicate places. [2022-12-12 11:34:04,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 269 transitions, 1072 flow [2022-12-12 11:34:04,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 269 transitions, 891 flow, removed 84 selfloop flow, removed 7 redundant places. [2022-12-12 11:34:04,941 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 269 transitions, 891 flow [2022-12-12 11:34:04,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 169.41176470588235) internal successors, (2880), 17 states have internal predecessors, (2880), 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:34:04,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:04,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:04,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:34:04,943 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:04,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1493657272, now seen corresponding path program 1 times [2022-12-12 11:34:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:04,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472364091] [2022-12-12 11:34:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:06,852 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:34:06,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:06,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472364091] [2022-12-12 11:34:06,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472364091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:06,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:06,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-12-12 11:34:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98946473] [2022-12-12 11:34:06,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:06,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-12 11:34:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:06,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-12 11:34:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-12-12 11:34:06,856 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 256 [2022-12-12 11:34:06,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 269 transitions, 891 flow. Second operand has 27 states, 27 states have (on average 155.92592592592592) internal successors, (4210), 27 states have internal predecessors, (4210), 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:34:06,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:06,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 256 [2022-12-12 11:34:06,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:09,378 INFO L130 PetriNetUnfolder]: 1895/7270 cut-off events. [2022-12-12 11:34:09,378 INFO L131 PetriNetUnfolder]: For 2448/2469 co-relation queries the response was YES. [2022-12-12 11:34:09,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14113 conditions, 7270 events. 1895/7270 cut-off events. For 2448/2469 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 64825 event pairs, 1422 based on Foata normal form. 2/6871 useless extension candidates. Maximal degree in co-relation 13464. Up to 2813 conditions per place. [2022-12-12 11:34:09,424 INFO L137 encePairwiseOnDemand]: 225/256 looper letters, 103 selfloop transitions, 45 changer transitions 0/299 dead transitions. [2022-12-12 11:34:09,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 299 transitions, 1297 flow [2022-12-12 11:34:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-12 11:34:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-12 11:34:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4292 transitions. [2022-12-12 11:34:09,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6209490740740741 [2022-12-12 11:34:09,431 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 30 predicate places. [2022-12-12 11:34:09,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 299 transitions, 1297 flow [2022-12-12 11:34:09,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 299 transitions, 1186 flow, removed 42 selfloop flow, removed 12 redundant places. [2022-12-12 11:34:09,434 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 299 transitions, 1186 flow [2022-12-12 11:34:09,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 155.92592592592592) internal successors, (4210), 27 states have internal predecessors, (4210), 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:34:09,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:09,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:09,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:34:09,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2011179461, now seen corresponding path program 1 times [2022-12-12 11:34:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:09,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866625882] [2022-12-12 11:34:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:10,466 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:34:10,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:10,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866625882] [2022-12-12 11:34:10,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866625882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:10,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:10,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-12 11:34:10,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448515458] [2022-12-12 11:34:10,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:10,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-12 11:34:10,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-12 11:34:10,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-12-12 11:34:10,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 256 [2022-12-12 11:34:10,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 299 transitions, 1186 flow. Second operand has 18 states, 18 states have (on average 160.72222222222223) internal successors, (2893), 18 states have internal predecessors, (2893), 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:34:10,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:10,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 256 [2022-12-12 11:34:10,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:11,991 INFO L130 PetriNetUnfolder]: 1887/7242 cut-off events. [2022-12-12 11:34:11,992 INFO L131 PetriNetUnfolder]: For 4543/4576 co-relation queries the response was YES. [2022-12-12 11:34:12,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16840 conditions, 7242 events. 1887/7242 cut-off events. For 4543/4576 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 64756 event pairs, 804 based on Foata normal form. 0/6845 useless extension candidates. Maximal degree in co-relation 16096. Up to 2771 conditions per place. [2022-12-12 11:34:12,026 INFO L137 encePairwiseOnDemand]: 239/256 looper letters, 123 selfloop transitions, 24 changer transitions 0/306 dead transitions. [2022-12-12 11:34:12,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 306 transitions, 1566 flow [2022-12-12 11:34:12,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-12 11:34:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-12 11:34:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2467 transitions. [2022-12-12 11:34:12,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424479166666667 [2022-12-12 11:34:12,031 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 30 predicate places. [2022-12-12 11:34:12,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 306 transitions, 1566 flow [2022-12-12 11:34:12,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 306 transitions, 1321 flow, removed 115 selfloop flow, removed 8 redundant places. [2022-12-12 11:34:12,038 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 306 transitions, 1321 flow [2022-12-12 11:34:12,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 160.72222222222223) internal successors, (2893), 18 states have internal predecessors, (2893), 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:34:12,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:12,039 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:12,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 11:34:12,039 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:12,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:12,039 INFO L85 PathProgramCache]: Analyzing trace with hash 206860257, now seen corresponding path program 1 times [2022-12-12 11:34:12,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:12,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263624415] [2022-12-12 11:34:12,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:12,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:14,029 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:34:14,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:14,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263624415] [2022-12-12 11:34:14,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263624415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:14,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:14,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-12-12 11:34:14,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344666470] [2022-12-12 11:34:14,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:14,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-12 11:34:14,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:14,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-12 11:34:14,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-12-12 11:34:14,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 256 [2022-12-12 11:34:14,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 306 transitions, 1321 flow. Second operand has 29 states, 29 states have (on average 147.06896551724137) internal successors, (4265), 29 states have internal predecessors, (4265), 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:34:14,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:14,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 256 [2022-12-12 11:34:14,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:16,646 INFO L130 PetriNetUnfolder]: 1011/3783 cut-off events. [2022-12-12 11:34:16,646 INFO L131 PetriNetUnfolder]: For 2550/2645 co-relation queries the response was YES. [2022-12-12 11:34:16,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9082 conditions, 3783 events. 1011/3783 cut-off events. For 2550/2645 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 27881 event pairs, 402 based on Foata normal form. 0/3569 useless extension candidates. Maximal degree in co-relation 8320. Up to 1470 conditions per place. [2022-12-12 11:34:16,728 INFO L137 encePairwiseOnDemand]: 227/256 looper letters, 139 selfloop transitions, 44 changer transitions 1/317 dead transitions. [2022-12-12 11:34:16,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 317 transitions, 1842 flow [2022-12-12 11:34:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-12 11:34:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-12 11:34:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4055 transitions. [2022-12-12 11:34:16,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866608796296297 [2022-12-12 11:34:16,738 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 40 predicate places. [2022-12-12 11:34:16,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 317 transitions, 1842 flow [2022-12-12 11:34:16,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 317 transitions, 1489 flow, removed 152 selfloop flow, removed 18 redundant places. [2022-12-12 11:34:16,749 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 317 transitions, 1489 flow [2022-12-12 11:34:16,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 147.06896551724137) internal successors, (4265), 29 states have internal predecessors, (4265), 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:34:16,751 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:16,751 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:16,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 11:34:16,751 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:16,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1970003538, now seen corresponding path program 1 times [2022-12-12 11:34:16,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:16,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731383208] [2022-12-12 11:34:16,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:16,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:16,848 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:34:16,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:16,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731383208] [2022-12-12 11:34:16,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731383208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:16,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:16,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 11:34:16,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417629351] [2022-12-12 11:34:16,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:16,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:34:16,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:16,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:34:16,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:34:16,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 256 [2022-12-12 11:34:16,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 317 transitions, 1489 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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:34:16,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:16,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 256 [2022-12-12 11:34:16,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:16,977 INFO L130 PetriNetUnfolder]: 382/1571 cut-off events. [2022-12-12 11:34:16,977 INFO L131 PetriNetUnfolder]: For 1352/1363 co-relation queries the response was YES. [2022-12-12 11:34:16,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3910 conditions, 1571 events. 382/1571 cut-off events. For 1352/1363 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8400 event pairs, 25 based on Foata normal form. 21/1529 useless extension candidates. Maximal degree in co-relation 3309. Up to 419 conditions per place. [2022-12-12 11:34:16,984 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 41 selfloop transitions, 6 changer transitions 3/323 dead transitions. [2022-12-12 11:34:16,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 323 transitions, 1662 flow [2022-12-12 11:34:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:34:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:34:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2022-12-12 11:34:16,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.92578125 [2022-12-12 11:34:16,986 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 24 predicate places. [2022-12-12 11:34:16,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 323 transitions, 1662 flow [2022-12-12 11:34:16,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 323 transitions, 1580 flow, removed 41 selfloop flow, removed 0 redundant places. [2022-12-12 11:34:16,992 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 323 transitions, 1580 flow [2022-12-12 11:34:16,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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:34:16,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:16,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:16,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 11:34:16,993 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:16,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash -853986226, now seen corresponding path program 1 times [2022-12-12 11:34:16,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:16,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709482663] [2022-12-12 11:34:16,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:18,882 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:34:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:18,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709482663] [2022-12-12 11:34:18,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709482663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:18,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:18,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-12-12 11:34:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292515493] [2022-12-12 11:34:18,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:18,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-12 11:34:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-12 11:34:18,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2022-12-12 11:34:18,886 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 256 [2022-12-12 11:34:18,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 323 transitions, 1580 flow. Second operand has 29 states, 29 states have (on average 151.68965517241378) internal successors, (4399), 29 states have internal predecessors, (4399), 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:34:18,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:18,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 256 [2022-12-12 11:34:18,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:21,667 INFO L130 PetriNetUnfolder]: 538/2241 cut-off events. [2022-12-12 11:34:21,667 INFO L131 PetriNetUnfolder]: For 2571/2614 co-relation queries the response was YES. [2022-12-12 11:34:21,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6648 conditions, 2241 events. 538/2241 cut-off events. For 2571/2614 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13605 event pairs, 55 based on Foata normal form. 5/2149 useless extension candidates. Maximal degree in co-relation 4427. Up to 701 conditions per place. [2022-12-12 11:34:21,677 INFO L137 encePairwiseOnDemand]: 221/256 looper letters, 213 selfloop transitions, 69 changer transitions 0/415 dead transitions. [2022-12-12 11:34:21,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 415 transitions, 2837 flow [2022-12-12 11:34:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-12 11:34:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-12 11:34:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4963 transitions. [2022-12-12 11:34:21,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6058349609375 [2022-12-12 11:34:21,682 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 55 predicate places. [2022-12-12 11:34:21,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 415 transitions, 2837 flow [2022-12-12 11:34:21,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 415 transitions, 2218 flow, removed 269 selfloop flow, removed 21 redundant places. [2022-12-12 11:34:21,691 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 415 transitions, 2218 flow [2022-12-12 11:34:21,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 151.68965517241378) internal successors, (4399), 29 states have internal predecessors, (4399), 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:34:21,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:21,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:21,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 11:34:21,693 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash -79999802, now seen corresponding path program 2 times [2022-12-12 11:34:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:21,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003739341] [2022-12-12 11:34:21,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:23,235 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:34:23,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:23,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003739341] [2022-12-12 11:34:23,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003739341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:23,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:23,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-12-12 11:34:23,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307336632] [2022-12-12 11:34:23,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:23,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-12 11:34:23,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:23,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-12 11:34:23,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2022-12-12 11:34:23,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 256 [2022-12-12 11:34:23,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 415 transitions, 2218 flow. Second operand has 30 states, 30 states have (on average 157.4) internal successors, (4722), 30 states have internal predecessors, (4722), 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:34:23,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:23,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 256 [2022-12-12 11:34:23,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:24,966 INFO L130 PetriNetUnfolder]: 448/1878 cut-off events. [2022-12-12 11:34:24,966 INFO L131 PetriNetUnfolder]: For 1666/1700 co-relation queries the response was YES. [2022-12-12 11:34:24,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5233 conditions, 1878 events. 448/1878 cut-off events. For 1666/1700 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10615 event pairs, 25 based on Foata normal form. 4/1808 useless extension candidates. Maximal degree in co-relation 3656. Up to 428 conditions per place. [2022-12-12 11:34:24,974 INFO L137 encePairwiseOnDemand]: 224/256 looper letters, 210 selfloop transitions, 64 changer transitions 3/416 dead transitions. [2022-12-12 11:34:24,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 416 transitions, 2762 flow [2022-12-12 11:34:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-12 11:34:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-12 11:34:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4337 transitions. [2022-12-12 11:34:24,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6274594907407407 [2022-12-12 11:34:24,980 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 60 predicate places. [2022-12-12 11:34:24,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 416 transitions, 2762 flow [2022-12-12 11:34:24,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 416 transitions, 2336 flow, removed 174 selfloop flow, removed 20 redundant places. [2022-12-12 11:34:24,989 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 416 transitions, 2336 flow [2022-12-12 11:34:24,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 157.4) internal successors, (4722), 30 states have internal predecessors, (4722), 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:34:24,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:24,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:24,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 11:34:24,990 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:24,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2063612297, now seen corresponding path program 1 times [2022-12-12 11:34:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:24,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655839006] [2022-12-12 11:34:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:24,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:28,984 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:34:28,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:28,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655839006] [2022-12-12 11:34:28,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655839006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:28,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:28,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-12-12 11:34:28,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379311095] [2022-12-12 11:34:28,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:28,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-12 11:34:28,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-12 11:34:28,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2022-12-12 11:34:28,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 256 [2022-12-12 11:34:28,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 416 transitions, 2336 flow. Second operand has 35 states, 35 states have (on average 139.54285714285714) internal successors, (4884), 35 states have internal predecessors, (4884), 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:34:28,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:28,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 256 [2022-12-12 11:34:28,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:32,438 INFO L130 PetriNetUnfolder]: 530/2201 cut-off events. [2022-12-12 11:34:32,438 INFO L131 PetriNetUnfolder]: For 2528/2566 co-relation queries the response was YES. [2022-12-12 11:34:32,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6637 conditions, 2201 events. 530/2201 cut-off events. For 2528/2566 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 12998 event pairs, 34 based on Foata normal form. 4/2118 useless extension candidates. Maximal degree in co-relation 4852. Up to 575 conditions per place. [2022-12-12 11:34:32,449 INFO L137 encePairwiseOnDemand]: 220/256 looper letters, 269 selfloop transitions, 63 changer transitions 0/456 dead transitions. [2022-12-12 11:34:32,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 456 transitions, 3291 flow [2022-12-12 11:34:32,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-12 11:34:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-12 11:34:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4719 transitions. [2022-12-12 11:34:32,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.55859375 [2022-12-12 11:34:32,453 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 72 predicate places. [2022-12-12 11:34:32,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 456 transitions, 3291 flow [2022-12-12 11:34:32,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 456 transitions, 2625 flow, removed 291 selfloop flow, removed 23 redundant places. [2022-12-12 11:34:32,464 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 456 transitions, 2625 flow [2022-12-12 11:34:32,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 139.54285714285714) internal successors, (4884), 35 states have internal predecessors, (4884), 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:34:32,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:32,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:32,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 11:34:32,465 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1564185692, now seen corresponding path program 1 times [2022-12-12 11:34:32,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:32,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102262467] [2022-12-12 11:34:32,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:32,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:34:37,507 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:34:37,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:34:37,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102262467] [2022-12-12 11:34:37,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102262467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:34:37,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:34:37,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-12-12 11:34:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078967351] [2022-12-12 11:34:37,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:34:37,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-12 11:34:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:34:37,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-12 11:34:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1997, Unknown=0, NotChecked=0, Total=2162 [2022-12-12 11:34:37,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 256 [2022-12-12 11:34:37,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 456 transitions, 2625 flow. Second operand has 47 states, 47 states have (on average 117.31914893617021) internal successors, (5514), 47 states have internal predecessors, (5514), 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:34:37,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:34:37,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 256 [2022-12-12 11:34:37,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:34:50,937 INFO L130 PetriNetUnfolder]: 6087/14214 cut-off events. [2022-12-12 11:34:50,937 INFO L131 PetriNetUnfolder]: For 15719/15780 co-relation queries the response was YES. [2022-12-12 11:34:50,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39975 conditions, 14214 events. 6087/14214 cut-off events. For 15719/15780 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 111773 event pairs, 1112 based on Foata normal form. 7/13198 useless extension candidates. Maximal degree in co-relation 26927. Up to 5129 conditions per place. [2022-12-12 11:34:50,994 INFO L137 encePairwiseOnDemand]: 197/256 looper letters, 775 selfloop transitions, 193 changer transitions 75/1157 dead transitions. [2022-12-12 11:34:50,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 1157 transitions, 7954 flow [2022-12-12 11:34:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-12-12 11:34:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-12-12 11:34:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 10555 transitions. [2022-12-12 11:34:51,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4850643382352941 [2022-12-12 11:34:51,016 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 133 predicate places. [2022-12-12 11:34:51,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 1157 transitions, 7954 flow [2022-12-12 11:34:51,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 1157 transitions, 7071 flow, removed 420 selfloop flow, removed 15 redundant places. [2022-12-12 11:34:51,048 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 1157 transitions, 7071 flow [2022-12-12 11:34:51,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 117.31914893617021) internal successors, (5514), 47 states have internal predecessors, (5514), 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:34:51,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:34:51,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:51,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 11:34:51,050 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:34:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:34:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1771181584, now seen corresponding path program 2 times [2022-12-12 11:34:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:34:51,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902502927] [2022-12-12 11:34:51,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:34:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:34:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-12 11:44:54,350 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 11:44:54,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 11:44:54,405 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-12 11:44:54,414 INFO L158 Benchmark]: Toolchain (without parser) took 656683.76ms. Allocated memory was 181.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 155.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2022-12-12 11:44:54,415 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:44:54,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.97ms. Allocated memory is still 181.4MB. Free memory was 155.3MB in the beginning and 124.9MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-12 11:44:54,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.22ms. Allocated memory is still 181.4MB. Free memory was 124.9MB in the beginning and 121.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 11:44:54,415 INFO L158 Benchmark]: Boogie Preprocessor took 55.08ms. Allocated memory is still 181.4MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:44:54,415 INFO L158 Benchmark]: RCFGBuilder took 492.26ms. Allocated memory is still 181.4MB. Free memory was 119.7MB in the beginning and 97.2MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-12 11:44:54,415 INFO L158 Benchmark]: TraceAbstraction took 655573.92ms. Allocated memory was 181.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 96.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. [2022-12-12 11:44:54,416 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 181.4MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 484.97ms. Allocated memory is still 181.4MB. Free memory was 155.3MB in the beginning and 124.9MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.22ms. Allocated memory is still 181.4MB. Free memory was 124.9MB in the beginning and 121.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.08ms. Allocated memory is still 181.4MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 492.26ms. Allocated memory is still 181.4MB. Free memory was 119.7MB in the beginning and 97.2MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 655573.92ms. Allocated memory was 181.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 96.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown