/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:47:43,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:47:43,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:47:43,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:47:43,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:47:43,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:47:43,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:47:43,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:47:43,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:47:43,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:47:43,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:47:43,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:47:43,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:47:43,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:47:43,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:47:43,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:47:43,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:47:43,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:47:43,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:47:43,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:47:43,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:47:43,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:47:43,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:47:43,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:47:43,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:47:43,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:47:43,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:47:43,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:47:43,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:47:43,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:47:43,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:47:43,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:47:43,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:47:43,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:47:43,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:47:43,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:47:43,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:47:43,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:47:43,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:47:43,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:47:43,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:47:43,335 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-VariableLbe.epf [2023-01-28 00:47:43,359 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:47:43,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:47:43,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:47:43,361 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:47:43,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:47:43,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:47:43,362 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:47:43,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:47:43,362 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:47:43,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:47:43,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:47:43,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:47:43,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:47:43,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:47:43,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:47:43,363 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:47:43,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:47:43,363 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:47:43,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:47:43,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:47:43,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:47:43,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:47:43,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:47:43,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:47:43,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:47:43,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:47:43,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:47:43,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:47:43,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:47:43,365 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:47:43,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:47:43,365 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:47:43,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:47:43,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:47:43,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:47:43,703 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:47:43,704 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:47:43,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 00:47:44,772 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:47:44,962 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:47:44,963 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 00:47:44,979 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/318dfc5f6/53b62a7e7ee54c818999cd918beea8f2/FLAGa7b645ced [2023-01-28 00:47:44,988 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/318dfc5f6/53b62a7e7ee54c818999cd918beea8f2 [2023-01-28 00:47:44,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:47:44,990 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:47:44,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:47:44,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:47:44,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:47:44,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:47:44" (1/1) ... [2023-01-28 00:47:44,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d475aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:44, skipping insertion in model container [2023-01-28 00:47:44,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:47:44" (1/1) ... [2023-01-28 00:47:44,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:47:45,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:47:45,136 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-01-28 00:47:45,283 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:47:45,293 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:47:45,303 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-01-28 00:47:45,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:47:45,396 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:47:45,396 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:47:45,400 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:47:45,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45 WrapperNode [2023-01-28 00:47:45,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:47:45,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:47:45,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:47:45,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:47:45,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (1/1) ... [2023-01-28 00:47:45,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (1/1) ... [2023-01-28 00:47:45,454 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-01-28 00:47:45,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:47:45,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:47:45,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:47:45,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:47:45,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (1/1) ... [2023-01-28 00:47:45,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (1/1) ... [2023-01-28 00:47:45,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (1/1) ... [2023-01-28 00:47:45,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (1/1) ... [2023-01-28 00:47:45,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (1/1) ... [2023-01-28 00:47:45,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (1/1) ... [2023-01-28 00:47:45,479 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (1/1) ... [2023-01-28 00:47:45,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (1/1) ... [2023-01-28 00:47:45,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:47:45,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:47:45,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:47:45,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:47:45,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (1/1) ... [2023-01-28 00:47:45,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:47:45,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:47:45,515 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) [2023-01-28 00:47:45,528 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 [2023-01-28 00:47:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:47:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:47:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:47:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:47:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:47:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:47:45,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:47:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:47:45,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:47:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:47:45,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:47:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:47:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:47:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:47:45,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:47:45,552 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:47:45,713 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:47:45,715 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:47:45,951 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:47:46,099 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:47:46,099 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:47:46,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:47:46 BoogieIcfgContainer [2023-01-28 00:47:46,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:47:46,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:47:46,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:47:46,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:47:46,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:47:44" (1/3) ... [2023-01-28 00:47:46,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8e1c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:47:46, skipping insertion in model container [2023-01-28 00:47:46,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:47:45" (2/3) ... [2023-01-28 00:47:46,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8e1c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:47:46, skipping insertion in model container [2023-01-28 00:47:46,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:47:46" (3/3) ... [2023-01-28 00:47:46,105 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 00:47:46,120 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:47:46,120 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:47:46,120 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:47:46,173 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:47:46,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2023-01-28 00:47:46,228 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-01-28 00:47:46,228 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:47:46,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:47:46,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2023-01-28 00:47:46,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2023-01-28 00:47:46,236 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:47:46,242 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2023-01-28 00:47:46,244 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2023-01-28 00:47:46,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2023-01-28 00:47:46,260 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-01-28 00:47:46,260 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:47:46,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:47:46,262 INFO L119 LiptonReduction]: Number of co-enabled transitions 1818 [2023-01-28 00:47:49,528 INFO L134 LiptonReduction]: Checked pairs total: 4335 [2023-01-28 00:47:49,528 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-01-28 00:47:49,547 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:47:49,551 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;@23470f2f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:47:49,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:47:49,565 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:47:49,565 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:47:49,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:49,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:47:49,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:49,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash 464724, now seen corresponding path program 1 times [2023-01-28 00:47:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401217282] [2023-01-28 00:47:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:49,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:49,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401217282] [2023-01-28 00:47:49,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401217282] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:49,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:49,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:47:49,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162204493] [2023-01-28 00:47:49,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:49,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:47:49,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:49,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:47:49,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:47:49,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 199 [2023-01-28 00:47:49,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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) [2023-01-28 00:47:49,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:49,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 199 [2023-01-28 00:47:49,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:50,064 INFO L130 PetriNetUnfolder]: 711/1126 cut-off events. [2023-01-28 00:47:50,064 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-01-28 00:47:50,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2245 conditions, 1126 events. 711/1126 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5132 event pairs, 191 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 2234. Up to 871 conditions per place. [2023-01-28 00:47:50,074 INFO L137 encePairwiseOnDemand]: 196/199 looper letters, 29 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2023-01-28 00:47:50,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 151 flow [2023-01-28 00:47:50,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:47:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:47:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-01-28 00:47:50,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142378559463987 [2023-01-28 00:47:50,089 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-01-28 00:47:50,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-01-28 00:47:50,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:50,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-01-28 00:47:50,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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) [2023-01-28 00:47:50,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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) [2023-01-28 00:47:50,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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) [2023-01-28 00:47:50,102 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 307 transitions. [2023-01-28 00:47:50,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 151 flow [2023-01-28 00:47:50,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:47:50,106 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-01-28 00:47:50,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-01-28 00:47:50,110 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-28 00:47:50,111 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-01-28 00:47:50,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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) [2023-01-28 00:47:50,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:50,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:50,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:47:50,112 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:50,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:50,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1006435865, now seen corresponding path program 1 times [2023-01-28 00:47:50,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:50,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708046152] [2023-01-28 00:47:50,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:50,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:51,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:51,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708046152] [2023-01-28 00:47:51,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708046152] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:47:51,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421497494] [2023-01-28 00:47:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:51,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:47:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:51,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:47:51,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:47:51,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 00:47:51,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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) [2023-01-28 00:47:51,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:51,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 00:47:51,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:51,429 INFO L130 PetriNetUnfolder]: 988/1483 cut-off events. [2023-01-28 00:47:51,430 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-01-28 00:47:51,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3108 conditions, 1483 events. 988/1483 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5978 event pairs, 204 based on Foata normal form. 36/1519 useless extension candidates. Maximal degree in co-relation 3098. Up to 1101 conditions per place. [2023-01-28 00:47:51,436 INFO L137 encePairwiseOnDemand]: 190/199 looper letters, 30 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2023-01-28 00:47:51,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 164 flow [2023-01-28 00:47:51,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:47:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:47:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2023-01-28 00:47:51,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4472361809045226 [2023-01-28 00:47:51,438 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 356 transitions. [2023-01-28 00:47:51,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 356 transitions. [2023-01-28 00:47:51,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:51,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 356 transitions. [2023-01-28 00:47:51,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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) [2023-01-28 00:47:51,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:51,442 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:51,442 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 4 states and 356 transitions. [2023-01-28 00:47:51,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 164 flow [2023-01-28 00:47:51,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:47:51,443 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 106 flow [2023-01-28 00:47:51,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2023-01-28 00:47:51,444 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-01-28 00:47:51,444 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 106 flow [2023-01-28 00:47:51,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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) [2023-01-28 00:47:51,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:51,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:51,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:47:51,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:51,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1134739560, now seen corresponding path program 1 times [2023-01-28 00:47:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:51,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993434118] [2023-01-28 00:47:51,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:52,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:52,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993434118] [2023-01-28 00:47:52,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993434118] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:52,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:52,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:47:52,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268794892] [2023-01-28 00:47:52,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:52,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:47:52,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:52,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:47:52,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:47:52,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 00:47:52,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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) [2023-01-28 00:47:52,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:52,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 00:47:52,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:52,481 INFO L130 PetriNetUnfolder]: 992/1491 cut-off events. [2023-01-28 00:47:52,481 INFO L131 PetriNetUnfolder]: For 647/647 co-relation queries the response was YES. [2023-01-28 00:47:52,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4202 conditions, 1491 events. 992/1491 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6210 event pairs, 293 based on Foata normal form. 8/1499 useless extension candidates. Maximal degree in co-relation 4189. Up to 1256 conditions per place. [2023-01-28 00:47:52,490 INFO L137 encePairwiseOnDemand]: 190/199 looper letters, 37 selfloop transitions, 16 changer transitions 0/53 dead transitions. [2023-01-28 00:47:52,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 302 flow [2023-01-28 00:47:52,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:47:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:47:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-01-28 00:47:52,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.457286432160804 [2023-01-28 00:47:52,491 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-01-28 00:47:52,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-01-28 00:47:52,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:52,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-01-28 00:47:52,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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) [2023-01-28 00:47:52,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:52,494 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:52,494 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 106 flow. Second operand 4 states and 364 transitions. [2023-01-28 00:47:52,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 302 flow [2023-01-28 00:47:52,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 53 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:47:52,499 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 201 flow [2023-01-28 00:47:52,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2023-01-28 00:47:52,500 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-01-28 00:47:52,502 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 201 flow [2023-01-28 00:47:52,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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) [2023-01-28 00:47:52,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:52,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:52,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:47:52,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:52,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash 796112234, now seen corresponding path program 1 times [2023-01-28 00:47:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:52,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171211216] [2023-01-28 00:47:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:52,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:53,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171211216] [2023-01-28 00:47:53,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171211216] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:53,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:53,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:53,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290907726] [2023-01-28 00:47:53,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:53,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:53,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:53,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:53,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:53,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 00:47:53,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 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) [2023-01-28 00:47:53,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:53,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 00:47:53,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:53,496 INFO L130 PetriNetUnfolder]: 1469/2216 cut-off events. [2023-01-28 00:47:53,497 INFO L131 PetriNetUnfolder]: For 2439/2439 co-relation queries the response was YES. [2023-01-28 00:47:53,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7479 conditions, 2216 events. 1469/2216 cut-off events. For 2439/2439 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10372 event pairs, 208 based on Foata normal form. 72/2288 useless extension candidates. Maximal degree in co-relation 7463. Up to 1075 conditions per place. [2023-01-28 00:47:53,511 INFO L137 encePairwiseOnDemand]: 190/199 looper letters, 41 selfloop transitions, 10 changer transitions 14/65 dead transitions. [2023-01-28 00:47:53,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 65 transitions, 461 flow [2023-01-28 00:47:53,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:47:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:47:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2023-01-28 00:47:53,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45125628140703516 [2023-01-28 00:47:53,513 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 449 transitions. [2023-01-28 00:47:53,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 449 transitions. [2023-01-28 00:47:53,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:53,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 449 transitions. [2023-01-28 00:47:53,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 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) [2023-01-28 00:47:53,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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) [2023-01-28 00:47:53,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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) [2023-01-28 00:47:53,519 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 201 flow. Second operand 5 states and 449 transitions. [2023-01-28 00:47:53,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 65 transitions, 461 flow [2023-01-28 00:47:53,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:47:53,525 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 208 flow [2023-01-28 00:47:53,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-01-28 00:47:53,527 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-01-28 00:47:53,527 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 208 flow [2023-01-28 00:47:53,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 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) [2023-01-28 00:47:53,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:53,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:53,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:47:53,528 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:53,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash 817191614, now seen corresponding path program 2 times [2023-01-28 00:47:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:53,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930570647] [2023-01-28 00:47:53,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:54,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:54,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930570647] [2023-01-28 00:47:54,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930570647] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:54,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:54,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:54,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813767519] [2023-01-28 00:47:54,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:54,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:54,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:54,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 00:47:54,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 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) [2023-01-28 00:47:54,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:54,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 00:47:54,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:54,486 INFO L130 PetriNetUnfolder]: 906/1373 cut-off events. [2023-01-28 00:47:54,487 INFO L131 PetriNetUnfolder]: For 2191/2191 co-relation queries the response was YES. [2023-01-28 00:47:54,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5016 conditions, 1373 events. 906/1373 cut-off events. For 2191/2191 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5564 event pairs, 279 based on Foata normal form. 6/1379 useless extension candidates. Maximal degree in co-relation 4997. Up to 1162 conditions per place. [2023-01-28 00:47:54,493 INFO L137 encePairwiseOnDemand]: 188/199 looper letters, 37 selfloop transitions, 19 changer transitions 0/56 dead transitions. [2023-01-28 00:47:54,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 410 flow [2023-01-28 00:47:54,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:47:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:47:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-01-28 00:47:54,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585427135678392 [2023-01-28 00:47:54,495 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-01-28 00:47:54,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-01-28 00:47:54,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:54,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-01-28 00:47:54,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 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) [2023-01-28 00:47:54,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:54,497 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:54,497 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 208 flow. Second operand 4 states and 365 transitions. [2023-01-28 00:47:54,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 410 flow [2023-01-28 00:47:54,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 376 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-01-28 00:47:54,500 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 273 flow [2023-01-28 00:47:54,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2023-01-28 00:47:54,501 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-01-28 00:47:54,501 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 273 flow [2023-01-28 00:47:54,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 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) [2023-01-28 00:47:54,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:54,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:54,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:47:54,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:54,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:54,502 INFO L85 PathProgramCache]: Analyzing trace with hash -437094604, now seen corresponding path program 1 times [2023-01-28 00:47:54,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:54,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191746810] [2023-01-28 00:47:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:54,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:54,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191746810] [2023-01-28 00:47:54,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191746810] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:54,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:54,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:54,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049089296] [2023-01-28 00:47:54,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:54,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:47:54,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:54,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:47:54,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:47:54,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2023-01-28 00:47:54,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 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) [2023-01-28 00:47:54,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:54,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2023-01-28 00:47:54,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:54,850 INFO L130 PetriNetUnfolder]: 1247/2027 cut-off events. [2023-01-28 00:47:54,851 INFO L131 PetriNetUnfolder]: For 4081/4177 co-relation queries the response was YES. [2023-01-28 00:47:54,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 2027 events. 1247/2027 cut-off events. For 4081/4177 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10626 event pairs, 369 based on Foata normal form. 110/2125 useless extension candidates. Maximal degree in co-relation 7505. Up to 912 conditions per place. [2023-01-28 00:47:54,859 INFO L137 encePairwiseOnDemand]: 195/199 looper letters, 40 selfloop transitions, 4 changer transitions 22/68 dead transitions. [2023-01-28 00:47:54,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 539 flow [2023-01-28 00:47:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:47:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:47:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2023-01-28 00:47:54,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4904522613065327 [2023-01-28 00:47:54,861 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 488 transitions. [2023-01-28 00:47:54,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 488 transitions. [2023-01-28 00:47:54,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:54,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 488 transitions. [2023-01-28 00:47:54,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 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) [2023-01-28 00:47:54,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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) [2023-01-28 00:47:54,865 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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) [2023-01-28 00:47:54,865 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 273 flow. Second operand 5 states and 488 transitions. [2023-01-28 00:47:54,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 539 flow [2023-01-28 00:47:54,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 539 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:47:54,868 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 249 flow [2023-01-28 00:47:54,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-01-28 00:47:54,870 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-01-28 00:47:54,870 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 249 flow [2023-01-28 00:47:54,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 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) [2023-01-28 00:47:54,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:54,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:54,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:47:54,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:54,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:54,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1794977514, now seen corresponding path program 1 times [2023-01-28 00:47:54,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:54,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452074529] [2023-01-28 00:47:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:54,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:55,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:55,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452074529] [2023-01-28 00:47:55,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452074529] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:55,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:55,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:55,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566928858] [2023-01-28 00:47:55,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:55,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:55,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:55,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:55,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:55,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 199 [2023-01-28 00:47:55,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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) [2023-01-28 00:47:55,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:55,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 199 [2023-01-28 00:47:55,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:55,452 INFO L130 PetriNetUnfolder]: 920/1459 cut-off events. [2023-01-28 00:47:55,452 INFO L131 PetriNetUnfolder]: For 3854/3910 co-relation queries the response was YES. [2023-01-28 00:47:55,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5879 conditions, 1459 events. 920/1459 cut-off events. For 3854/3910 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6649 event pairs, 294 based on Foata normal form. 63/1519 useless extension candidates. Maximal degree in co-relation 5856. Up to 1291 conditions per place. [2023-01-28 00:47:55,459 INFO L137 encePairwiseOnDemand]: 191/199 looper letters, 55 selfloop transitions, 17 changer transitions 5/79 dead transitions. [2023-01-28 00:47:55,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 692 flow [2023-01-28 00:47:55,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:47:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:47:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2023-01-28 00:47:55,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824120603015075 [2023-01-28 00:47:55,461 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 480 transitions. [2023-01-28 00:47:55,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 480 transitions. [2023-01-28 00:47:55,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:55,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 480 transitions. [2023-01-28 00:47:55,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 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) [2023-01-28 00:47:55,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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) [2023-01-28 00:47:55,463 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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) [2023-01-28 00:47:55,463 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 249 flow. Second operand 5 states and 480 transitions. [2023-01-28 00:47:55,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 692 flow [2023-01-28 00:47:55,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 668 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:47:55,469 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 423 flow [2023-01-28 00:47:55,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2023-01-28 00:47:55,469 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2023-01-28 00:47:55,470 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 423 flow [2023-01-28 00:47:55,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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) [2023-01-28 00:47:55,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:55,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:55,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:47:55,470 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:55,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash 764989082, now seen corresponding path program 2 times [2023-01-28 00:47:55,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:55,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942971224] [2023-01-28 00:47:55,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:55,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:55,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942971224] [2023-01-28 00:47:55,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942971224] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:55,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:55,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:55,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148936663] [2023-01-28 00:47:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:55,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:55,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:55,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:55,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:55,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 00:47:55,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 423 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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) [2023-01-28 00:47:55,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:55,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 00:47:55,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:56,110 INFO L130 PetriNetUnfolder]: 1028/1632 cut-off events. [2023-01-28 00:47:56,110 INFO L131 PetriNetUnfolder]: For 5834/5834 co-relation queries the response was YES. [2023-01-28 00:47:56,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7553 conditions, 1632 events. 1028/1632 cut-off events. For 5834/5834 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7468 event pairs, 437 based on Foata normal form. 6/1638 useless extension candidates. Maximal degree in co-relation 7529. Up to 1414 conditions per place. [2023-01-28 00:47:56,120 INFO L137 encePairwiseOnDemand]: 189/199 looper letters, 56 selfloop transitions, 22 changer transitions 4/82 dead transitions. [2023-01-28 00:47:56,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 837 flow [2023-01-28 00:47:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:47:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:47:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-01-28 00:47:56,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.457286432160804 [2023-01-28 00:47:56,122 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-01-28 00:47:56,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-01-28 00:47:56,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:56,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-01-28 00:47:56,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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) [2023-01-28 00:47:56,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:56,124 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:56,124 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 423 flow. Second operand 4 states and 364 transitions. [2023-01-28 00:47:56,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 837 flow [2023-01-28 00:47:56,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 829 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-01-28 00:47:56,129 INFO L231 Difference]: Finished difference. Result has 54 places, 59 transitions, 610 flow [2023-01-28 00:47:56,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=610, PETRI_PLACES=54, PETRI_TRANSITIONS=59} [2023-01-28 00:47:56,131 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-01-28 00:47:56,131 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 59 transitions, 610 flow [2023-01-28 00:47:56,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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) [2023-01-28 00:47:56,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:56,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:56,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:47:56,132 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:56,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash 766400822, now seen corresponding path program 3 times [2023-01-28 00:47:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166659642] [2023-01-28 00:47:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:56,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:56,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:56,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166659642] [2023-01-28 00:47:56,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166659642] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:56,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:56,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:47:56,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357839551] [2023-01-28 00:47:56,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:56,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:47:56,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:56,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:47:56,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:47:56,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 00:47:56,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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) [2023-01-28 00:47:56,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:56,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 00:47:56,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:57,209 INFO L130 PetriNetUnfolder]: 1011/1625 cut-off events. [2023-01-28 00:47:57,209 INFO L131 PetriNetUnfolder]: For 7290/7290 co-relation queries the response was YES. [2023-01-28 00:47:57,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 1625 events. 1011/1625 cut-off events. For 7290/7290 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7632 event pairs, 361 based on Foata normal form. 8/1633 useless extension candidates. Maximal degree in co-relation 8064. Up to 1204 conditions per place. [2023-01-28 00:47:57,218 INFO L137 encePairwiseOnDemand]: 190/199 looper letters, 58 selfloop transitions, 39 changer transitions 4/101 dead transitions. [2023-01-28 00:47:57,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 101 transitions, 1156 flow [2023-01-28 00:47:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:47:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:47:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2023-01-28 00:47:57,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542713567839196 [2023-01-28 00:47:57,220 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 452 transitions. [2023-01-28 00:47:57,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 452 transitions. [2023-01-28 00:47:57,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:57,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 452 transitions. [2023-01-28 00:47:57,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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) [2023-01-28 00:47:57,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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) [2023-01-28 00:47:57,222 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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) [2023-01-28 00:47:57,222 INFO L175 Difference]: Start difference. First operand has 54 places, 59 transitions, 610 flow. Second operand 5 states and 452 transitions. [2023-01-28 00:47:57,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 101 transitions, 1156 flow [2023-01-28 00:47:57,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 101 transitions, 1122 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 00:47:57,229 INFO L231 Difference]: Finished difference. Result has 58 places, 73 transitions, 874 flow [2023-01-28 00:47:57,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=874, PETRI_PLACES=58, PETRI_TRANSITIONS=73} [2023-01-28 00:47:57,229 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2023-01-28 00:47:57,229 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 73 transitions, 874 flow [2023-01-28 00:47:57,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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) [2023-01-28 00:47:57,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:57,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:57,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:47:57,230 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:57,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2056674693, now seen corresponding path program 1 times [2023-01-28 00:47:57,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:57,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002094669] [2023-01-28 00:47:57,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:57,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002094669] [2023-01-28 00:47:57,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002094669] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:57,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:47:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309361958] [2023-01-28 00:47:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:57,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:47:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:57,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:47:57,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:47:57,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 199 [2023-01-28 00:47:57,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 73 transitions, 874 flow. Second operand has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 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) [2023-01-28 00:47:57,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:57,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 199 [2023-01-28 00:47:57,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:57,916 INFO L130 PetriNetUnfolder]: 937/1516 cut-off events. [2023-01-28 00:47:57,916 INFO L131 PetriNetUnfolder]: For 9135/9135 co-relation queries the response was YES. [2023-01-28 00:47:57,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8468 conditions, 1516 events. 937/1516 cut-off events. For 9135/9135 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6974 event pairs, 340 based on Foata normal form. 9/1525 useless extension candidates. Maximal degree in co-relation 8439. Up to 1237 conditions per place. [2023-01-28 00:47:57,934 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 84 selfloop transitions, 34 changer transitions 9/127 dead transitions. [2023-01-28 00:47:57,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 127 transitions, 1701 flow [2023-01-28 00:47:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:47:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:47:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 541 transitions. [2023-01-28 00:47:57,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45309882747068675 [2023-01-28 00:47:57,937 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 541 transitions. [2023-01-28 00:47:57,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 541 transitions. [2023-01-28 00:47:57,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:57,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 541 transitions. [2023-01-28 00:47:57,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 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) [2023-01-28 00:47:57,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 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) [2023-01-28 00:47:57,941 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 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) [2023-01-28 00:47:57,941 INFO L175 Difference]: Start difference. First operand has 58 places, 73 transitions, 874 flow. Second operand 6 states and 541 transitions. [2023-01-28 00:47:57,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 127 transitions, 1701 flow [2023-01-28 00:47:57,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 127 transitions, 1685 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-28 00:47:57,950 INFO L231 Difference]: Finished difference. Result has 66 places, 90 transitions, 1224 flow [2023-01-28 00:47:57,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1224, PETRI_PLACES=66, PETRI_TRANSITIONS=90} [2023-01-28 00:47:57,951 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2023-01-28 00:47:57,951 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 1224 flow [2023-01-28 00:47:57,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 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) [2023-01-28 00:47:57,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:57,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:57,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:47:57,952 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:57,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2055182322, now seen corresponding path program 1 times [2023-01-28 00:47:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:57,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128124414] [2023-01-28 00:47:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:57,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128124414] [2023-01-28 00:47:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128124414] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:58,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:58,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:58,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374295762] [2023-01-28 00:47:58,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:58,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:58,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:58,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:58,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 199 [2023-01-28 00:47:58,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 1224 flow. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 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) [2023-01-28 00:47:58,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:58,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 199 [2023-01-28 00:47:58,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:58,425 INFO L130 PetriNetUnfolder]: 831/1375 cut-off events. [2023-01-28 00:47:58,425 INFO L131 PetriNetUnfolder]: For 11181/11216 co-relation queries the response was YES. [2023-01-28 00:47:58,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8479 conditions, 1375 events. 831/1375 cut-off events. For 11181/11216 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6406 event pairs, 338 based on Foata normal form. 37/1408 useless extension candidates. Maximal degree in co-relation 8445. Up to 1165 conditions per place. [2023-01-28 00:47:58,434 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 87 selfloop transitions, 19 changer transitions 0/108 dead transitions. [2023-01-28 00:47:58,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 1584 flow [2023-01-28 00:47:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:47:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:47:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 384 transitions. [2023-01-28 00:47:58,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824120603015075 [2023-01-28 00:47:58,436 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 384 transitions. [2023-01-28 00:47:58,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 384 transitions. [2023-01-28 00:47:58,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:58,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 384 transitions. [2023-01-28 00:47:58,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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) [2023-01-28 00:47:58,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:58,438 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:58,438 INFO L175 Difference]: Start difference. First operand has 66 places, 90 transitions, 1224 flow. Second operand 4 states and 384 transitions. [2023-01-28 00:47:58,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 1584 flow [2023-01-28 00:47:58,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 1578 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-01-28 00:47:58,450 INFO L231 Difference]: Finished difference. Result has 70 places, 93 transitions, 1308 flow [2023-01-28 00:47:58,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1308, PETRI_PLACES=70, PETRI_TRANSITIONS=93} [2023-01-28 00:47:58,450 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2023-01-28 00:47:58,450 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 93 transitions, 1308 flow [2023-01-28 00:47:58,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 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) [2023-01-28 00:47:58,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:58,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:58,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:47:58,451 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:58,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2055182105, now seen corresponding path program 1 times [2023-01-28 00:47:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873027105] [2023-01-28 00:47:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:58,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:58,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:58,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873027105] [2023-01-28 00:47:58,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873027105] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:58,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:58,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081887525] [2023-01-28 00:47:58,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:58,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:58,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:58,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:58,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 199 [2023-01-28 00:47:58,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 93 transitions, 1308 flow. Second operand has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 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) [2023-01-28 00:47:58,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:58,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 199 [2023-01-28 00:47:58,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:59,022 INFO L130 PetriNetUnfolder]: 813/1351 cut-off events. [2023-01-28 00:47:59,023 INFO L131 PetriNetUnfolder]: For 12365/12413 co-relation queries the response was YES. [2023-01-28 00:47:59,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8609 conditions, 1351 events. 813/1351 cut-off events. For 12365/12413 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6294 event pairs, 331 based on Foata normal form. 38/1389 useless extension candidates. Maximal degree in co-relation 8572. Up to 1157 conditions per place. [2023-01-28 00:47:59,030 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 87 selfloop transitions, 18 changer transitions 0/107 dead transitions. [2023-01-28 00:47:59,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 107 transitions, 1608 flow [2023-01-28 00:47:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:47:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:47:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2023-01-28 00:47:59,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46608040201005024 [2023-01-28 00:47:59,032 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 371 transitions. [2023-01-28 00:47:59,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 371 transitions. [2023-01-28 00:47:59,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:59,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 371 transitions. [2023-01-28 00:47:59,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 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) [2023-01-28 00:47:59,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:59,034 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:59,034 INFO L175 Difference]: Start difference. First operand has 70 places, 93 transitions, 1308 flow. Second operand 4 states and 371 transitions. [2023-01-28 00:47:59,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 107 transitions, 1608 flow [2023-01-28 00:47:59,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 107 transitions, 1596 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 00:47:59,054 INFO L231 Difference]: Finished difference. Result has 73 places, 93 transitions, 1350 flow [2023-01-28 00:47:59,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1350, PETRI_PLACES=73, PETRI_TRANSITIONS=93} [2023-01-28 00:47:59,055 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 41 predicate places. [2023-01-28 00:47:59,055 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 93 transitions, 1350 flow [2023-01-28 00:47:59,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 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) [2023-01-28 00:47:59,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:59,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:59,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:47:59,055 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:59,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:59,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2054310239, now seen corresponding path program 1 times [2023-01-28 00:47:59,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:59,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054892600] [2023-01-28 00:47:59,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:59,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:59,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:59,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054892600] [2023-01-28 00:47:59,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054892600] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:59,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:59,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:47:59,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571215685] [2023-01-28 00:47:59,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:59,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:47:59,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:59,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:47:59,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:47:59,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 199 [2023-01-28 00:47:59,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 93 transitions, 1350 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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) [2023-01-28 00:47:59,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:59,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 199 [2023-01-28 00:47:59,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:59,441 INFO L130 PetriNetUnfolder]: 599/1074 cut-off events. [2023-01-28 00:47:59,442 INFO L131 PetriNetUnfolder]: For 13171/13283 co-relation queries the response was YES. [2023-01-28 00:47:59,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6845 conditions, 1074 events. 599/1074 cut-off events. For 13171/13283 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5525 event pairs, 88 based on Foata normal form. 172/1239 useless extension candidates. Maximal degree in co-relation 6806. Up to 458 conditions per place. [2023-01-28 00:47:59,446 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 99 selfloop transitions, 5 changer transitions 7/119 dead transitions. [2023-01-28 00:47:59,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 1817 flow [2023-01-28 00:47:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:47:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:47:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 383 transitions. [2023-01-28 00:47:59,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48115577889447236 [2023-01-28 00:47:59,448 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 383 transitions. [2023-01-28 00:47:59,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 383 transitions. [2023-01-28 00:47:59,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:59,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 383 transitions. [2023-01-28 00:47:59,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 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) [2023-01-28 00:47:59,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:59,450 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-01-28 00:47:59,450 INFO L175 Difference]: Start difference. First operand has 73 places, 93 transitions, 1350 flow. Second operand 4 states and 383 transitions. [2023-01-28 00:47:59,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 1817 flow [2023-01-28 00:47:59,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 119 transitions, 1710 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-01-28 00:47:59,460 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 920 flow [2023-01-28 00:47:59,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2023-01-28 00:47:59,461 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2023-01-28 00:47:59,461 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 920 flow [2023-01-28 00:47:59,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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) [2023-01-28 00:47:59,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:59,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:59,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:47:59,461 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:59,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:59,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1400353198, now seen corresponding path program 1 times [2023-01-28 00:47:59,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:59,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423556196] [2023-01-28 00:47:59,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:59,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:59,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:59,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423556196] [2023-01-28 00:47:59,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423556196] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:59,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:59,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:47:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962338444] [2023-01-28 00:47:59,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:59,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:47:59,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:59,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:47:59,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:47:59,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 199 [2023-01-28 00:47:59,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 920 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 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) [2023-01-28 00:47:59,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:59,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 199 [2023-01-28 00:47:59,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:59,785 INFO L130 PetriNetUnfolder]: 306/592 cut-off events. [2023-01-28 00:47:59,785 INFO L131 PetriNetUnfolder]: For 7135/7193 co-relation queries the response was YES. [2023-01-28 00:47:59,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3810 conditions, 592 events. 306/592 cut-off events. For 7135/7193 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2717 event pairs, 39 based on Foata normal form. 103/692 useless extension candidates. Maximal degree in co-relation 3769. Up to 238 conditions per place. [2023-01-28 00:47:59,788 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 84 selfloop transitions, 8 changer transitions 8/108 dead transitions. [2023-01-28 00:47:59,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 108 transitions, 1518 flow [2023-01-28 00:47:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:47:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:47:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2023-01-28 00:47:59,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793969849246231 [2023-01-28 00:47:59,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 477 transitions. [2023-01-28 00:47:59,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 477 transitions. [2023-01-28 00:47:59,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:59,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 477 transitions. [2023-01-28 00:47:59,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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) [2023-01-28 00:47:59,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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) [2023-01-28 00:47:59,792 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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) [2023-01-28 00:47:59,792 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 920 flow. Second operand 5 states and 477 transitions. [2023-01-28 00:47:59,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 108 transitions, 1518 flow [2023-01-28 00:47:59,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 1448 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-01-28 00:47:59,799 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 774 flow [2023-01-28 00:47:59,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=774, PETRI_PLACES=78, PETRI_TRANSITIONS=63} [2023-01-28 00:47:59,800 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2023-01-28 00:47:59,800 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 774 flow [2023-01-28 00:47:59,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 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) [2023-01-28 00:47:59,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:59,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:59,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:47:59,800 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:59,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:59,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1154380677, now seen corresponding path program 1 times [2023-01-28 00:47:59,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:59,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83932374] [2023-01-28 00:47:59,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:59,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:47:59,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:59,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83932374] [2023-01-28 00:47:59,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83932374] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:59,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:59,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:47:59,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272571567] [2023-01-28 00:47:59,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:59,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:47:59,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:59,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:47:59,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:47:59,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 199 [2023-01-28 00:47:59,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 63 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 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) [2023-01-28 00:47:59,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:59,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 199 [2023-01-28 00:47:59,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:00,080 INFO L130 PetriNetUnfolder]: 188/380 cut-off events. [2023-01-28 00:48:00,080 INFO L131 PetriNetUnfolder]: For 3652/3673 co-relation queries the response was YES. [2023-01-28 00:48:00,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2436 conditions, 380 events. 188/380 cut-off events. For 3652/3673 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1575 event pairs, 33 based on Foata normal form. 27/405 useless extension candidates. Maximal degree in co-relation 2394. Up to 141 conditions per place. [2023-01-28 00:48:00,082 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 41 selfloop transitions, 11 changer transitions 39/95 dead transitions. [2023-01-28 00:48:00,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 95 transitions, 1302 flow [2023-01-28 00:48:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:48:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:48:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2023-01-28 00:48:00,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639865996649916 [2023-01-28 00:48:00,084 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 554 transitions. [2023-01-28 00:48:00,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 554 transitions. [2023-01-28 00:48:00,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:00,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 554 transitions. [2023-01-28 00:48:00,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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) [2023-01-28 00:48:00,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 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) [2023-01-28 00:48:00,087 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 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) [2023-01-28 00:48:00,087 INFO L175 Difference]: Start difference. First operand has 78 places, 63 transitions, 774 flow. Second operand 6 states and 554 transitions. [2023-01-28 00:48:00,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 95 transitions, 1302 flow [2023-01-28 00:48:00,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 1218 flow, removed 23 selfloop flow, removed 6 redundant places. [2023-01-28 00:48:00,093 INFO L231 Difference]: Finished difference. Result has 79 places, 38 transitions, 398 flow [2023-01-28 00:48:00,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=79, PETRI_TRANSITIONS=38} [2023-01-28 00:48:00,094 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 47 predicate places. [2023-01-28 00:48:00,094 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 38 transitions, 398 flow [2023-01-28 00:48:00,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 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) [2023-01-28 00:48:00,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:00,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:00,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 00:48:00,094 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:48:00,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:00,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1144513876, now seen corresponding path program 1 times [2023-01-28 00:48:00,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498525390] [2023-01-28 00:48:00,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498525390] [2023-01-28 00:48:00,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498525390] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:00,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:00,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:48:00,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568260333] [2023-01-28 00:48:00,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:00,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:48:00,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:00,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:48:00,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:48:00,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 199 [2023-01-28 00:48:00,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 38 transitions, 398 flow. Second operand has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 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) [2023-01-28 00:48:00,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:00,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 199 [2023-01-28 00:48:00,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:00,778 INFO L130 PetriNetUnfolder]: 111/223 cut-off events. [2023-01-28 00:48:00,778 INFO L131 PetriNetUnfolder]: For 1392/1392 co-relation queries the response was YES. [2023-01-28 00:48:00,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 223 events. 111/223 cut-off events. For 1392/1392 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 682 event pairs, 17 based on Foata normal form. 1/224 useless extension candidates. Maximal degree in co-relation 1320. Up to 127 conditions per place. [2023-01-28 00:48:00,779 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 33 selfloop transitions, 9 changer transitions 22/65 dead transitions. [2023-01-28 00:48:00,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 65 transitions, 738 flow [2023-01-28 00:48:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:48:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:48:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2023-01-28 00:48:00,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45226130653266333 [2023-01-28 00:48:00,780 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2023-01-28 00:48:00,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2023-01-28 00:48:00,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:00,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2023-01-28 00:48:00,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 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) [2023-01-28 00:48:00,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 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) [2023-01-28 00:48:00,784 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 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) [2023-01-28 00:48:00,784 INFO L175 Difference]: Start difference. First operand has 79 places, 38 transitions, 398 flow. Second operand 6 states and 540 transitions. [2023-01-28 00:48:00,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 65 transitions, 738 flow [2023-01-28 00:48:00,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 478 flow, removed 58 selfloop flow, removed 27 redundant places. [2023-01-28 00:48:00,787 INFO L231 Difference]: Finished difference. Result has 55 places, 33 transitions, 220 flow [2023-01-28 00:48:00,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=55, PETRI_TRANSITIONS=33} [2023-01-28 00:48:00,787 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2023-01-28 00:48:00,787 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 220 flow [2023-01-28 00:48:00,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 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) [2023-01-28 00:48:00,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:00,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:00,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 00:48:00,788 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:48:00,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash -795872754, now seen corresponding path program 2 times [2023-01-28 00:48:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:00,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243537597] [2023-01-28 00:48:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:00,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:48:00,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:48:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:48:00,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:48:00,889 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:48:00,890 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:48:00,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:48:00,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:48:00,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:48:00,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:48:00,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:48:00,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 00:48:00,892 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:00,896 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:48:00,896 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:48:00,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:48:00 BasicIcfg [2023-01-28 00:48:00,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:48:00,950 INFO L158 Benchmark]: Toolchain (without parser) took 15959.35ms. Allocated memory was 591.4MB in the beginning and 1.1GB in the end (delta: 534.8MB). Free memory was 541.2MB in the beginning and 966.2MB in the end (delta: -425.0MB). Peak memory consumption was 110.5MB. Max. memory is 16.0GB. [2023-01-28 00:48:00,950 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 364.9MB. Free memory is still 314.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:48:00,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.94ms. Allocated memory is still 591.4MB. Free memory was 540.8MB in the beginning and 517.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:48:00,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.43ms. Allocated memory is still 591.4MB. Free memory was 517.8MB in the beginning and 515.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:48:00,950 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 591.4MB. Free memory was 515.3MB in the beginning and 513.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:48:00,950 INFO L158 Benchmark]: RCFGBuilder took 617.95ms. Allocated memory is still 591.4MB. Free memory was 513.2MB in the beginning and 552.9MB in the end (delta: -39.7MB). Peak memory consumption was 40.4MB. Max. memory is 16.0GB. [2023-01-28 00:48:00,951 INFO L158 Benchmark]: TraceAbstraction took 14847.71ms. Allocated memory was 591.4MB in the beginning and 1.1GB in the end (delta: 534.8MB). Free memory was 551.9MB in the beginning and 966.2MB in the end (delta: -414.3MB). Peak memory consumption was 120.4MB. Max. memory is 16.0GB. [2023-01-28 00:48:00,951 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 364.9MB. Free memory is still 314.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 409.94ms. Allocated memory is still 591.4MB. Free memory was 540.8MB in the beginning and 517.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.43ms. Allocated memory is still 591.4MB. Free memory was 517.8MB in the beginning and 515.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 591.4MB. Free memory was 515.3MB in the beginning and 513.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 617.95ms. Allocated memory is still 591.4MB. Free memory was 513.2MB in the beginning and 552.9MB in the end (delta: -39.7MB). Peak memory consumption was 40.4MB. Max. memory is 16.0GB. * TraceAbstraction took 14847.71ms. Allocated memory was 591.4MB in the beginning and 1.1GB in the end (delta: 534.8MB). Free memory was 551.9MB in the beginning and 966.2MB in the end (delta: -414.3MB). Peak memory consumption was 120.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 110 PlacesBefore, 32 PlacesAfterwards, 102 TransitionsBefore, 22 TransitionsAfterwards, 1818 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 4335 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2253, independent: 2109, independent conditional: 0, independent unconditional: 2109, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1004, independent: 964, independent conditional: 0, independent unconditional: 964, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2253, independent: 1145, independent conditional: 0, independent unconditional: 1145, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 1004, unknown conditional: 0, unknown unconditional: 1004] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-1, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=1, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1117 IncrementalHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 22 mSDtfsCounter, 1117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1350occurred in iteration=12, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 2534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:48:00,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...